TSTP Solution File: SWC218+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC218+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n027.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:49:31 EDT 2024
% Result : Theorem 0.59s 0.76s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 18
% Syntax : Number of formulae : 76 ( 14 unt; 0 def)
% Number of atoms : 347 ( 111 equ)
% Maximal formula atoms : 24 ( 4 avg)
% Number of connectives : 391 ( 120 ~; 100 |; 132 &)
% ( 8 <=>; 31 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 115 ( 52 !; 63 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f484,plain,
$false,
inference(avatar_sat_refutation,[],[f204,f282,f320,f324,f483]) ).
fof(f483,plain,
( ~ spl11_7
| ~ spl11_10 ),
inference(avatar_contradiction_clause,[],[f482]) ).
fof(f482,plain,
( $false
| ~ spl11_7
| ~ spl11_10 ),
inference(subsumption_resolution,[],[f481,f176]) ).
fof(f176,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.KKkK0V5DWm/Vampire---4.8_26736',ax17) ).
fof(f481,plain,
( ~ ssList(nil)
| ~ spl11_7
| ~ spl11_10 ),
inference(subsumption_resolution,[],[f469,f147]) ).
fof(f147,plain,
ssItem(sK6),
inference(cnf_transformation,[],[f127]) ).
fof(f127,plain,
( ~ neq(sK0,nil)
& sK2 = app(app(sK4,cons(sK6,nil)),sK5)
& ssItem(sK6)
& sK3 = app(sK4,sK5)
& ssList(sK5)
& ssList(sK4)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6])],[f99,f126,f125,f124,f123,f122,f121,f120]) ).
fof(f120,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ neq(X0,nil)
& ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X4,cons(X6,nil)),X5) = X2
& ssItem(X6) )
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ neq(sK0,nil)
& ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X4,cons(X6,nil)),X5) = X2
& ssItem(X6) )
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f121,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ neq(sK0,nil)
& ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X4,cons(X6,nil)),X5) = X2
& ssItem(X6) )
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ~ neq(sK0,nil)
& ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X4,cons(X6,nil)),X5) = X2
& ssItem(X6) )
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f122,plain,
( ? [X2] :
( ? [X3] :
( ~ neq(sK0,nil)
& ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X4,cons(X6,nil)),X5) = X2
& ssItem(X6) )
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ~ neq(sK0,nil)
& ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X4,cons(X6,nil)),X5) = sK2
& ssItem(X6) )
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f123,plain,
( ? [X3] :
( ~ neq(sK0,nil)
& ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X4,cons(X6,nil)),X5) = sK2
& ssItem(X6) )
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ~ neq(sK0,nil)
& ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X4,cons(X6,nil)),X5) = sK2
& ssItem(X6) )
& app(X4,X5) = sK3
& ssList(X5) )
& ssList(X4) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f124,plain,
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X4,cons(X6,nil)),X5) = sK2
& ssItem(X6) )
& app(X4,X5) = sK3
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( ? [X6] :
( sK2 = app(app(sK4,cons(X6,nil)),X5)
& ssItem(X6) )
& sK3 = app(sK4,X5)
& ssList(X5) )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f125,plain,
( ? [X5] :
( ? [X6] :
( sK2 = app(app(sK4,cons(X6,nil)),X5)
& ssItem(X6) )
& sK3 = app(sK4,X5)
& ssList(X5) )
=> ( ? [X6] :
( sK2 = app(app(sK4,cons(X6,nil)),sK5)
& ssItem(X6) )
& sK3 = app(sK4,sK5)
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f126,plain,
( ? [X6] :
( sK2 = app(app(sK4,cons(X6,nil)),sK5)
& ssItem(X6) )
=> ( sK2 = app(app(sK4,cons(sK6,nil)),sK5)
& ssItem(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ neq(X0,nil)
& ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X4,cons(X6,nil)),X5) = X2
& ssItem(X6) )
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ neq(X0,nil)
& ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X4,cons(X6,nil)),X5) = X2
& ssItem(X6) )
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( neq(X0,nil)
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ! [X6] :
( ssItem(X6)
=> app(app(X4,cons(X6,nil)),X5) != X2 )
| app(X4,X5) != X3 ) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( neq(X0,nil)
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ! [X6] :
( ssItem(X6)
=> app(app(X4,cons(X6,nil)),X5) != X2 )
| app(X4,X5) != X3 ) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.KKkK0V5DWm/Vampire---4.8_26736',co1) ).
fof(f469,plain,
( ~ ssItem(sK6)
| ~ ssList(nil)
| ~ spl11_7
| ~ spl11_10 ),
inference(trivial_inequality_removal,[],[f466]) ).
fof(f466,plain,
( nil != nil
| ~ ssItem(sK6)
| ~ ssList(nil)
| ~ spl11_7
| ~ spl11_10 ),
inference(superposition,[],[f159,f401]) ).
fof(f401,plain,
( nil = cons(sK6,nil)
| ~ spl11_7
| ~ spl11_10 ),
inference(subsumption_resolution,[],[f400,f144]) ).
fof(f144,plain,
ssList(sK4),
inference(cnf_transformation,[],[f127]) ).
fof(f400,plain,
( nil = cons(sK6,nil)
| ~ ssList(sK4)
| ~ spl11_7
| ~ spl11_10 ),
inference(subsumption_resolution,[],[f397,f262]) ).
fof(f262,plain,
( ssList(cons(sK6,nil))
| ~ spl11_7 ),
inference(avatar_component_clause,[],[f261]) ).
fof(f261,plain,
( spl11_7
<=> ssList(cons(sK6,nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_7])]) ).
fof(f397,plain,
( nil = cons(sK6,nil)
| ~ ssList(cons(sK6,nil))
| ~ ssList(sK4)
| ~ spl11_10 ),
inference(trivial_inequality_removal,[],[f387]) ).
fof(f387,plain,
( nil != nil
| nil = cons(sK6,nil)
| ~ ssList(cons(sK6,nil))
| ~ ssList(sK4)
| ~ spl11_10 ),
inference(superposition,[],[f162,f281]) ).
fof(f281,plain,
( nil = app(sK4,cons(sK6,nil))
| ~ spl11_10 ),
inference(avatar_component_clause,[],[f279]) ).
fof(f279,plain,
( spl11_10
<=> nil = app(sK4,cons(sK6,nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_10])]) ).
fof(f162,plain,
! [X0,X1] :
( nil != app(X0,X1)
| nil = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f135]) ).
fof(f135,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X0
| nil != X1 )
& ( ( nil = X0
& nil = X1 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f134]) ).
fof(f134,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X0
| nil != X1 )
& ( ( nil = X0
& nil = X1 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f108]) ).
fof(f108,plain,
! [X0] :
( ! [X1] :
( ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.KKkK0V5DWm/Vampire---4.8_26736',ax83) ).
fof(f159,plain,
! [X0,X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f105]) ).
fof(f105,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f18,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) != X0 ) ),
file('/export/starexec/sandbox/tmp/tmp.KKkK0V5DWm/Vampire---4.8_26736',ax18) ).
fof(f324,plain,
( ~ spl11_7
| spl11_9 ),
inference(avatar_contradiction_clause,[],[f323]) ).
fof(f323,plain,
( $false
| ~ spl11_7
| spl11_9 ),
inference(subsumption_resolution,[],[f322,f144]) ).
fof(f322,plain,
( ~ ssList(sK4)
| ~ spl11_7
| spl11_9 ),
inference(subsumption_resolution,[],[f321,f262]) ).
fof(f321,plain,
( ~ ssList(cons(sK6,nil))
| ~ ssList(sK4)
| spl11_9 ),
inference(resolution,[],[f274,f171]) ).
fof(f171,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f117,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.KKkK0V5DWm/Vampire---4.8_26736',ax26) ).
fof(f274,plain,
( ~ ssList(app(sK4,cons(sK6,nil)))
| spl11_9 ),
inference(avatar_component_clause,[],[f272]) ).
fof(f272,plain,
( spl11_9
<=> ssList(app(sK4,cons(sK6,nil))) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_9])]) ).
fof(f320,plain,
spl11_7,
inference(avatar_contradiction_clause,[],[f319]) ).
fof(f319,plain,
( $false
| spl11_7 ),
inference(subsumption_resolution,[],[f318,f176]) ).
fof(f318,plain,
( ~ ssList(nil)
| spl11_7 ),
inference(subsumption_resolution,[],[f317,f147]) ).
fof(f317,plain,
( ~ ssItem(sK6)
| ~ ssList(nil)
| spl11_7 ),
inference(resolution,[],[f263,f160]) ).
fof(f160,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f106,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/tmp/tmp.KKkK0V5DWm/Vampire---4.8_26736',ax16) ).
fof(f263,plain,
( ~ ssList(cons(sK6,nil))
| spl11_7 ),
inference(avatar_component_clause,[],[f261]) ).
fof(f282,plain,
( ~ spl11_9
| spl11_10
| ~ spl11_3 ),
inference(avatar_split_clause,[],[f277,f198,f279,f272]) ).
fof(f198,plain,
( spl11_3
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl11_3])]) ).
fof(f277,plain,
( nil = app(sK4,cons(sK6,nil))
| ~ ssList(app(sK4,cons(sK6,nil)))
| ~ spl11_3 ),
inference(subsumption_resolution,[],[f276,f145]) ).
fof(f145,plain,
ssList(sK5),
inference(cnf_transformation,[],[f127]) ).
fof(f276,plain,
( nil = app(sK4,cons(sK6,nil))
| ~ ssList(sK5)
| ~ ssList(app(sK4,cons(sK6,nil)))
| ~ spl11_3 ),
inference(subsumption_resolution,[],[f248,f200]) ).
fof(f200,plain,
( nil = sK2
| ~ spl11_3 ),
inference(avatar_component_clause,[],[f198]) ).
fof(f248,plain,
( nil != sK2
| nil = app(sK4,cons(sK6,nil))
| ~ ssList(sK5)
| ~ ssList(app(sK4,cons(sK6,nil))) ),
inference(superposition,[],[f163,f148]) ).
fof(f148,plain,
sK2 = app(app(sK4,cons(sK6,nil)),sK5),
inference(cnf_transformation,[],[f127]) ).
fof(f163,plain,
! [X0,X1] :
( nil != app(X0,X1)
| nil = X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f135]) ).
fof(f204,plain,
spl11_3,
inference(avatar_split_clause,[],[f203,f198]) ).
fof(f203,plain,
nil = sK2,
inference(subsumption_resolution,[],[f202,f140]) ).
fof(f140,plain,
ssList(sK2),
inference(cnf_transformation,[],[f127]) ).
fof(f202,plain,
( nil = sK2
| ~ ssList(sK2) ),
inference(subsumption_resolution,[],[f188,f176]) ).
fof(f188,plain,
( nil = sK2
| ~ ssList(nil)
| ~ ssList(sK2) ),
inference(resolution,[],[f177,f173]) ).
fof(f173,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f136]) ).
fof(f136,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.KKkK0V5DWm/Vampire---4.8_26736',ax15) ).
fof(f177,plain,
~ neq(sK2,nil),
inference(definition_unfolding,[],[f149,f143]) ).
fof(f143,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f127]) ).
fof(f149,plain,
~ neq(sK0,nil),
inference(cnf_transformation,[],[f127]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC218+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n027.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 20:34:23 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.37 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.KKkK0V5DWm/Vampire---4.8_26736
% 0.59/0.75 % (27001)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2996ds/83Mi)
% 0.59/0.75 % (26995)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2996ds/34Mi)
% 0.59/0.75 % (26997)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.59/0.75 % (26996)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2996ds/51Mi)
% 0.59/0.75 % (26998)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.59/0.75 % (26999)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2996ds/34Mi)
% 0.59/0.75 % (27000)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.59/0.75 % (27002)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.59/0.75 % (27002)Refutation not found, incomplete strategy% (27002)------------------------------
% 0.59/0.75 % (27002)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.75 % (27002)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.75
% 0.59/0.75 % (27002)Memory used [KB]: 1128
% 0.59/0.75 % (27002)Time elapsed: 0.004 s
% 0.59/0.75 % (27002)Instructions burned: 4 (million)
% 0.59/0.76 % (27002)------------------------------
% 0.59/0.76 % (27002)------------------------------
% 0.59/0.76 % (27000)First to succeed.
% 0.59/0.76 % (26997)Also succeeded, but the first one will report.
% 0.59/0.76 % (27003)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on Vampire---4 for (2996ds/55Mi)
% 0.59/0.76 % (27000)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-26991"
% 0.59/0.76 % (27000)Refutation found. Thanks to Tanya!
% 0.59/0.76 % SZS status Theorem for Vampire---4
% 0.59/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.76 % (27000)------------------------------
% 0.59/0.76 % (27000)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.76 % (27000)Termination reason: Refutation
% 0.59/0.76
% 0.59/0.76 % (27000)Memory used [KB]: 1216
% 0.59/0.76 % (27000)Time elapsed: 0.010 s
% 0.59/0.76 % (27000)Instructions burned: 15 (million)
% 0.59/0.76 % (26991)Success in time 0.38 s
% 0.59/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------