%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC058-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 01:02:14 PM UTC 2026
% Result : Unsatisfiable 0.89s 1.05s
% Output : Refutation 3.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 31
% Syntax : Number of formulae : 120 ( 19 unt; 10 def)
% Number of atoms : 357 ( 36 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 478 ( 241 ~; 227 |; 0 &)
% ( 10 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 11 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn 37 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause8) ).
fof(f50,axiom,
! [X0,X1] : ssList(skaf46(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause50) ).
fof(f56,axiom,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause56) ).
fof(f57,axiom,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause57) ).
fof(f73,axiom,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause73) ).
fof(f79,axiom,
! [X0] :
( nil != X0
| ~ ssList(X0)
| segmentP(nil,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause79) ).
fof(f85,axiom,
! [X0,X1] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause85) ).
fof(f123,axiom,
! [X0,X1] :
( app(X0,X1) != nil
| ~ ssList(X1)
| ~ ssList(X0)
| nil = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause119) ).
fof(f124,plain,
! [X0,X1] :
( nil != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0)
| nil = X1 ),
inference(reorient_equations,[],[f123]) ).
fof(f142,axiom,
! [X0,X1] :
( ~ rearsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0)
| app(skaf46(X0,X1),X1) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause131) ).
fof(f187,axiom,
! [X2,X3,X0,X1] :
( app(app(X0,X1),X2) != X3
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X3)
| segmentP(X3,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause173) ).
fof(f201,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
fof(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_3) ).
fof(f204,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
fof(f207,negated_conjecture,
! [X0] :
( nil = sk2
| ~ ssList(X0)
| ~ neq(X0,nil)
| ~ segmentP(sk2,X0)
| ~ segmentP(sk1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f208,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
fof(f209,negated_conjecture,
! [X0] :
( nil != sk1
| ~ ssList(X0)
| ~ neq(X0,nil)
| ~ segmentP(sk2,X0)
| ~ segmentP(sk1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
fof(f210,negated_conjecture,
( nil = sk4
| neq(sk3,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
fof(f211,negated_conjecture,
( nil = sk4
| rearsegP(sk4,sk3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
fof(f212,negated_conjecture,
( nil = sk3
| neq(sk3,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
fof(f213,negated_conjecture,
( nil = sk3
| rearsegP(sk4,sk3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
fof(f214,plain,
( ~ ssList(nil)
| segmentP(nil,nil) ),
inference(equality_resolution,[],[f79]) ).
fof(f228,plain,
! [X2,X0,X1] :
( ~ ssList(app(app(X0,X1),X2))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| segmentP(app(app(X0,X1),X2),X1) ),
inference(equality_resolution,[],[f187]) ).
fof(f245,definition,
( spl0_1
<=> rearsegP(sk4,sk3) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f247,plain,
( rearsegP(sk4,sk3)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f245]) ).
fof(f249,definition,
( spl0_2
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f251,plain,
( nil = sk3
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f249]) ).
fof(f252,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f213,f249,f245]) ).
fof(f254,definition,
( spl0_3
<=> neq(sk3,nil) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f256,plain,
( neq(sk3,nil)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f254]) ).
fof(f257,plain,
( spl0_3
| spl0_2 ),
inference(avatar_split_clause,[],[f212,f249,f254]) ).
fof(f259,definition,
( spl0_4
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f261,plain,
( nil = sk4
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f259]) ).
fof(f262,plain,
( spl0_1
| spl0_4 ),
inference(avatar_split_clause,[],[f211,f259,f245]) ).
fof(f263,plain,
( spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f210,f259,f254]) ).
fof(f265,definition,
( spl0_5
<=> ! [X0] :
( ~ ssList(X0)
| ~ segmentP(sk1,X0)
| ~ segmentP(sk2,X0)
| ~ neq(X0,nil) ) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f266,plain,
( ! [X0] :
( ~ ssList(X0)
| ~ segmentP(sk1,X0)
| ~ segmentP(sk2,X0)
| ~ neq(X0,nil) )
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f265]) ).
fof(f268,definition,
( spl0_6
<=> nil = sk1 ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f270,plain,
( nil != sk1
| spl0_6 ),
inference(avatar_component_clause,[],[f268]) ).
fof(f271,plain,
( spl0_5
| ~ spl0_6 ),
inference(avatar_split_clause,[],[f209,f268,f265]) ).
fof(f273,definition,
( spl0_7
<=> neq(sk2,nil) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f275,plain,
( neq(sk2,nil)
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f273]) ).
fof(f276,plain,
( spl0_7
| ~ spl0_6 ),
inference(avatar_split_clause,[],[f208,f268,f273]) ).
fof(f278,definition,
( spl0_8
<=> nil = sk2 ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f280,plain,
( nil = sk2
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f278]) ).
fof(f281,plain,
( spl0_5
| spl0_8 ),
inference(avatar_split_clause,[],[f207,f278,f265]) ).
fof(f288,definition,
( spl0_10
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).
fof(f289,plain,
( ssList(nil)
| ~ spl0_10 ),
inference(avatar_component_clause,[],[f288]) ).
fof(f311,definition,
( spl0_15
<=> segmentP(nil,nil) ),
introduced(definition,[new_symbols(definition,[spl0_15])],[avatar_definition]) ).
fof(f313,plain,
( segmentP(nil,nil)
| ~ spl0_15 ),
inference(avatar_component_clause,[],[f311]) ).
fof(f314,plain,
( spl0_15
| ~ spl0_10 ),
inference(avatar_split_clause,[],[f214,f288,f311]) ).
fof(f324,plain,
spl0_10,
inference(avatar_split_clause,[],[f8,f288]) ).
fof(f330,plain,
( nil = sk2
| ~ spl0_4 ),
inference(superposition,[],[f204,f261]) ).
fof(f333,plain,
( spl0_8
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f330,f259,f278]) ).
fof(f334,plain,
( neq(nil,nil)
| ~ spl0_7
| ~ spl0_8 ),
inference(superposition,[],[f275,f280]) ).
fof(f337,plain,
( ! [X0] :
( ~ segmentP(sk3,X0)
| ~ ssList(X0)
| ~ segmentP(sk2,X0)
| ~ neq(X0,nil) )
| ~ spl0_5 ),
inference(forward_demodulation,[],[f266,f205]) ).
fof(f338,plain,
( ! [X0] :
( ~ segmentP(sk2,X0)
| ~ ssList(X0)
| ~ segmentP(nil,X0)
| ~ neq(X0,nil) )
| ~ spl0_2
| ~ spl0_5 ),
inference(forward_demodulation,[],[f337,f251]) ).
fof(f339,plain,
( ! [X0] :
( ~ segmentP(nil,X0)
| ~ segmentP(nil,X0)
| ~ ssList(X0)
| ~ neq(X0,nil) )
| ~ spl0_2
| ~ spl0_5
| ~ spl0_8 ),
inference(forward_demodulation,[],[f338,f280]) ).
fof(f340,plain,
( ! [X0] :
( ~ segmentP(nil,X0)
| ~ ssList(X0)
| ~ neq(X0,nil) )
| ~ spl0_2
| ~ spl0_5
| ~ spl0_8 ),
inference(duplicate_literal_removal,[],[f339]) ).
fof(f341,plain,
( ~ ssList(nil)
| ~ neq(nil,nil)
| ~ spl0_2
| ~ spl0_5
| ~ spl0_8
| ~ spl0_15 ),
inference(resolution,[],[f313,f340]) ).
fof(f342,plain,
( ~ neq(nil,nil)
| ~ spl0_2
| ~ spl0_5
| ~ spl0_8
| ~ spl0_10
| ~ spl0_15 ),
inference(forward_subsumption_resolution,[],[f341,f289]) ).
fof(f343,plain,
( $false
| ~ spl0_2
| ~ spl0_5
| ~ spl0_7
| ~ spl0_8
| ~ spl0_10
| ~ spl0_15 ),
inference(forward_subsumption_resolution,[],[f342,f334]) ).
fof(f344,plain,
( ~ spl0_2
| ~ spl0_5
| ~ spl0_7
| ~ spl0_8
| ~ spl0_10
| ~ spl0_15 ),
inference(avatar_contradiction_clause,[],[f343]) ).
fof(f346,plain,
( neq(nil,nil)
| ~ spl0_2
| ~ spl0_3 ),
inference(forward_demodulation,[],[f256,f251]) ).
fof(f350,plain,
( ~ ssList(sk2)
| ~ ssList(nil)
| ~ segmentP(nil,nil)
| ~ neq(nil,nil)
| ~ spl0_2
| ~ spl0_5 ),
inference(resolution,[],[f56,f338]) ).
fof(f351,plain,
( ~ ssList(nil)
| ~ segmentP(nil,nil)
| ~ neq(nil,nil)
| ~ spl0_2
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f350,f201]) ).
fof(f352,plain,
( ~ segmentP(nil,nil)
| ~ neq(nil,nil)
| ~ spl0_2
| ~ spl0_5
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f351,f289]) ).
fof(f353,plain,
( ~ neq(nil,nil)
| ~ spl0_2
| ~ spl0_5
| ~ spl0_10
| ~ spl0_15 ),
inference(forward_subsumption_resolution,[],[f352,f313]) ).
fof(f354,plain,
( $false
| ~ spl0_2
| ~ spl0_3
| ~ spl0_5
| ~ spl0_10
| ~ spl0_15 ),
inference(forward_subsumption_resolution,[],[f353,f346]) ).
fof(f355,plain,
( ~ spl0_2
| ~ spl0_3
| ~ spl0_5
| ~ spl0_10
| ~ spl0_15 ),
inference(avatar_contradiction_clause,[],[f354]) ).
fof(f356,plain,
( rearsegP(sk2,sk3)
| ~ spl0_1 ),
inference(forward_demodulation,[],[f247,f204]) ).
fof(f369,plain,
( ~ ssList(sk3)
| ~ ssList(sk3)
| ~ segmentP(sk2,sk3)
| ~ neq(sk3,nil)
| ~ spl0_5 ),
inference(resolution,[],[f57,f337]) ).
fof(f370,plain,
( ~ ssList(sk3)
| ~ segmentP(sk2,sk3)
| ~ neq(sk3,nil)
| ~ spl0_5 ),
inference(duplicate_literal_removal,[],[f369]) ).
fof(f371,plain,
( ~ segmentP(sk2,sk3)
| ~ neq(sk3,nil)
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f370,f202]) ).
fof(f372,plain,
( ~ segmentP(sk2,sk3)
| ~ spl0_3
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f371,f256]) ).
fof(f464,plain,
( ~ ssList(sk3)
| ~ ssList(sk2)
| sk2 = app(skaf46(sk2,sk3),sk3)
| ~ spl0_1 ),
inference(resolution,[],[f142,f356]) ).
fof(f471,plain,
( ~ ssList(sk2)
| sk2 = app(skaf46(sk2,sk3),sk3)
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f464,f202]) ).
fof(f473,plain,
( sk2 = app(skaf46(sk2,sk3),sk3)
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f471,f201]) ).
fof(f476,plain,
( nil != sk2
| ~ ssList(sk3)
| ~ ssList(skaf46(sk2,sk3))
| nil = sk3
| ~ spl0_1 ),
inference(superposition,[],[f124,f473]) ).
fof(f667,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(nil)
| segmentP(app(X0,X1),X1)
| ~ ssList(app(X0,X1)) ),
inference(superposition,[],[f228,f73]) ).
fof(f668,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(nil)
| segmentP(app(X0,X1),X1) ),
inference(duplicate_literal_removal,[],[f667]) ).
fof(f673,plain,
( ! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(X1)
| segmentP(app(X0,X1),X1) )
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f668,f289]) ).
fof(f1730,plain,
( ! [X0,X1] :
( segmentP(app(X0,X1),X1)
| ~ ssList(X1)
| ~ ssList(X0) )
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f673,f85]) ).
fof(f1751,plain,
( segmentP(sk2,sk3)
| ~ ssList(sk3)
| ~ ssList(skaf46(sk2,sk3))
| ~ spl0_1
| ~ spl0_10 ),
inference(superposition,[],[f1730,f473]) ).
fof(f1767,plain,
( ~ ssList(sk3)
| ~ ssList(skaf46(sk2,sk3))
| ~ spl0_1
| ~ spl0_3
| ~ spl0_5
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f1751,f372]) ).
fof(f1778,plain,
( ~ ssList(skaf46(sk2,sk3))
| ~ spl0_1
| ~ spl0_3
| ~ spl0_5
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f1767,f202]) ).
fof(f1787,plain,
( $false
| ~ spl0_1
| ~ spl0_3
| ~ spl0_5
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f1778,f50]) ).
fof(f1788,plain,
( ~ spl0_1
| ~ spl0_3
| ~ spl0_5
| ~ spl0_10 ),
inference(avatar_contradiction_clause,[],[f1787]) ).
fof(f1790,plain,
( nil != sk3
| spl0_6 ),
inference(forward_demodulation,[],[f270,f205]) ).
fof(f1794,plain,
( nil != sk2
| ~ ssList(skaf46(sk2,sk3))
| nil = sk3
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f476,f202]) ).
fof(f1818,plain,
( nil != sk2
| nil = sk3
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f1794,f50]) ).
fof(f1854,plain,
( ~ spl0_2
| spl0_6 ),
inference(avatar_split_clause,[],[f1790,f268,f249]) ).
fof(f1855,plain,
( spl0_2
| ~ spl0_8
| ~ spl0_1 ),
inference(avatar_split_clause,[],[f1818,f245,f278,f249]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f252]) ).
cnf(s2,plain,
( spl0_2
| spl0_3 ),
inference(sat_conversion,[],[f257]) ).
cnf(s3,plain,
( spl0_1
| spl0_4 ),
inference(sat_conversion,[],[f262]) ).
cnf(s4,plain,
( spl0_3
| spl0_4 ),
inference(sat_conversion,[],[f263]) ).
cnf(s5,plain,
( spl0_5
| ~ spl0_6 ),
inference(sat_conversion,[],[f271]) ).
cnf(s6,plain,
( ~ spl0_6
| spl0_7 ),
inference(sat_conversion,[],[f276]) ).
cnf(s7,plain,
( spl0_5
| spl0_8 ),
inference(sat_conversion,[],[f281]) ).
cnf(s14,plain,
( ~ spl0_10
| spl0_15 ),
inference(sat_conversion,[],[f314]) ).
cnf(s18,plain,
spl0_10,
inference(sat_conversion,[],[f324]) ).
cnf(s21,plain,
( ~ spl0_4
| spl0_8 ),
inference(sat_conversion,[],[f333]) ).
cnf(s24,plain,
( ~ spl0_2
| ~ spl0_5
| ~ spl0_7
| ~ spl0_8
| ~ spl0_10
| ~ spl0_15 ),
inference(sat_conversion,[],[f344]) ).
cnf(s26,plain,
( ~ spl0_2
| ~ spl0_3
| ~ spl0_5
| ~ spl0_10
| ~ spl0_15 ),
inference(sat_conversion,[],[f355]) ).
cnf(s79,plain,
( ~ spl0_1
| ~ spl0_3
| ~ spl0_5
| ~ spl0_10 ),
inference(sat_conversion,[],[f1788]) ).
cnf(s102,plain,
( ~ spl0_2
| spl0_6 ),
inference(sat_conversion,[],[f1854]) ).
cnf(s103,plain,
( ~ spl0_1
| spl0_2
| ~ spl0_8 ),
inference(sat_conversion,[],[f1855]) ).
cnf(s109,plain,
spl0_15,
inference(rat,[],[s14,s18]) ).
cnf(s114,plain,
spl0_1,
inference(rat,[],[s24,s5,s6,s102,s21,s1,s3,s18,s109]) ).
cnf(s116,plain,
spl0_2,
inference(rat,[],[s79,s7,s2,s103,s114,s18]) ).
cnf(s117,plain,
spl0_6,
inference(rat,[],[s102,s116]) ).
cnf(s118,plain,
spl0_7,
inference(rat,[],[s6,s117]) ).
cnf(s119,plain,
spl0_5,
inference(rat,[],[s5,s117]) ).
cnf(s120,plain,
~ spl0_8,
inference(rat,[],[s24,s109,s18,s118,s116,s119]) ).
cnf(s121,plain,
~ spl0_3,
inference(rat,[],[s26,s109,s18,s116,s119]) ).
cnf(s124,plain,
~ spl0_4,
inference(rat,[],[s21,s120]) ).
cnf(s125,plain,
$false,
inference(rat,[],[s4,s124,s121]) ).
fof(f1869,plain,
$false,
inference(avatar_sat_refutation,[],[s125]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC058-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n010.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 07:39:48 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.89/1.05 % (1745265)Input is clausal, will run a generic CNF schedule.
% 0.89/1.05 % (1745275)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=807394585:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 0.89/1.05 % (1745273)lrs+10_1_sil=8000:sp=occurrence:random_seed=2957565242:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 0.89/1.05 % (1745271)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1611471269:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 0.89/1.05 % (1745274)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1114379889:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 0.89/1.05 % (1745276)dis-21_1_sil=8000:lcm=predicate:random_seed=742426283:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 0.89/1.05 % (1745270)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=475470084:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 0.89/1.05 % (1745272)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1237971097:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 0.89/1.05 % (1745275)First to succeed.
% 0.89/1.05 % (1745275)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1745265"
% 0.89/1.05 % (1745276)Instruction limit reached!
% 0.89/1.05 % (1745276)------------------------------
% 0.89/1.05 % (1745276)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.89/1.05 % (1745276)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.89/1.05 % (1745276)CaDiCaL version: 2.1.3
% 0.89/1.05 % (1745276)Termination reason: Instruction limit
% 0.89/1.05 % (1745276)Termination phase: Saturation
% 0.89/1.05 % (1745276)Time elapsed: 0.049 s
% 0.89/1.05 % (1745276)Peak memory usage: 89 MB
% 0.89/1.05 % (1745276)Instructions burned: 120 (million)
% 0.89/1.05 % (1745274)Instruction limit reached!
% 0.89/1.05 % (1745274)------------------------------
% 0.89/1.05 % (1745274)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.89/1.05 % (1745274)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.89/1.05 % (1745274)CaDiCaL version: 2.1.3
% 0.89/1.05 % (1745274)Termination reason: Instruction limit
% 0.89/1.05 % (1745274)Termination phase: Saturation
% 0.89/1.05 % (1745274)Time elapsed: 0.057 s
% 0.89/1.05 % (1745274)Peak memory usage: 89 MB
% 0.89/1.05 % (1745274)Instructions burned: 115 (million)
% 0.89/1.05 % (1745273)Instruction limit reached!
% 0.89/1.05 % (1745273)------------------------------
% 0.89/1.05 % (1745273)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.89/1.05 % (1745273)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.89/1.05 % (1745273)CaDiCaL version: 2.1.3
% 0.89/1.05 % (1745273)Termination reason: Instruction limit
% 0.89/1.05 % (1745273)Termination phase: Saturation
% 0.89/1.05 % (1745273)Time elapsed: 0.066 s
% 0.89/1.05 % (1745273)Peak memory usage: 89 MB
% 0.89/1.05 % (1745273)Instructions burned: 107 (million)
% 0.89/1.05 % (1745285)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=3050134696:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2998 on theBenchmark for (2998ds/189Mi)
% 0.89/1.05 % (1745285)Also succeeded, but the first one will report.
% 0.89/1.05 % (1745284)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=3731466396:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 0.89/1.05 % (1745286)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=2735929680:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 0.89/1.05 % (1745284)Instruction limit reached!
% 0.89/1.05 % (1745284)------------------------------
% 0.89/1.05 % (1745284)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.89/1.05 % (1745284)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.89/1.05 % (1745284)CaDiCaL version: 2.1.3
% 0.89/1.05 % (1745284)Termination reason: Instruction limit
% 0.89/1.05 % (1745284)Termination phase: Saturation
% 0.89/1.05 % (1745284)Time elapsed: 0.090 s
% 0.89/1.05 % (1745284)Peak memory usage: 89 MB
% 0.89/1.05 % (1745284)Instructions burned: 143 (million)
% 0.89/1.05 % (1745275)Refutation found. Thanks to Tanya!
% 0.89/1.05 % SZS status Unsatisfiable for theBenchmark
% 0.89/1.05 % SZS output start Proof for theBenchmark
% See solution above
% 3.47/1.24 % (1745275)------------------------------
% 3.47/1.24 % (1745275)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.47/1.24 % (1745275)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.47/1.24 % (1745275)CaDiCaL version: 2.1.3
% 3.47/1.24 % (1745275)Termination reason: Refutation
% 3.47/1.24 % (1745275)Time elapsed: 0.037 s
% 3.47/1.24 % (1745275)Peak memory usage: 90 MB
% 3.47/1.24 % (1745275)Instructions burned: 52 (million)
% 3.47/1.24 % (1745275)------------------------------
% 3.47/1.24 % (1745275)------------------------------
% 3.47/1.24 % (1745265)Success in time 0.449 s
% 3.47/1.24 % Vampire exiting
%------------------------------------------------------------------------------