%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC112+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n001.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:04:43 PM UTC 2026
% Result : Theorem 0.17s 0.51s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 14
% Syntax : Number of formulae : 108 ( 22 unt; 8 def)
% Number of atoms : 395 ( 91 equ)
% Maximal formula atoms : 31 ( 3 avg)
% Number of connectives : 480 ( 193 ~; 187 |; 66 &)
% ( 14 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 9 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 101 ( 0 sgn 69 !; 32 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(app(X4,X2),X5) != X3
| ~ strictorderedP(X2)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X4
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(cons(X8,nil),X9) = X2
& lt(X6,X8) ) ) ) )
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& app(cons(X10,nil),X11) = X5
& ? [X12] :
( ssItem(X12)
& ? [X13] :
( ssList(X13)
& app(X13,cons(X12,nil)) = X2
& lt(X12,X10) ) ) ) ) ) ) )
| ( nil != X3
& nil = X2 )
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ( neq(X0,nil)
& segmentP(X1,X0) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(app(X4,X2),X5) != X3
| ~ strictorderedP(X2)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X4
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(cons(X8,nil),X9) = X2
& lt(X6,X8) ) ) ) )
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& app(cons(X10,nil),X11) = X5
& ? [X12] :
( ssItem(X12)
& ? [X13] :
( ssList(X13)
& app(X13,cons(X12,nil)) = X2
& lt(X12,X10) ) ) ) ) ) ) )
| ( nil != X3
& nil = X2 )
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ( neq(X0,nil)
& segmentP(X1,X0) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f103,plain,
! [X0] :
( ! [X1] :
( ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f132,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f200,plain,
! [X0] :
( ! [X1] :
( ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ? [X4] :
( ? [X5] :
( app(app(X4,X2),X5) = X3
& strictorderedP(X2)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X6,nil)) != X4
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != X2
| ~ lt(X6,X8) ) ) ) )
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X10,nil),X11) != X5
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2
| ~ lt(X12,X10) ) ) ) )
& ssList(X5) )
& ssList(X4) )
& ( nil = X3
| nil != X2 )
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ( ~ neq(X0,nil)
| ~ segmentP(X1,X0) ) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ? [X4] :
( ? [X5] :
( app(app(X4,X2),X5) = X3
& strictorderedP(X2)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X6,nil)) != X4
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != X2
| ~ lt(X6,X8) ) ) ) )
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X10,nil),X11) != X5
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2
| ~ lt(X12,X10) ) ) ) )
& ssList(X5) )
& ssList(X4) )
& ( nil = X3
| nil != X2 )
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ( ~ neq(X0,nil)
| ~ segmentP(X1,X0) ) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f241,plain,
! [X2,X3,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| app(app(X2,X1),X3) != X0
| ~ ssList(X3)
| ~ ssList(X2)
| segmentP(X0,X1) ),
inference(cnf_transformation,[],[f103]) ).
fof(f303,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f304,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 != X1
| ~ neq(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f306,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f318,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f394,plain,
! [X0,X1] :
( nil != app(X0,X1)
| ~ ssList(X1)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f200]) ).
fof(f395,plain,
! [X0,X1] :
( nil != app(X0,X1)
| ~ ssList(X1)
| nil = X1
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f200]) ).
fof(f413,plain,
ssList(sK52),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
sK50 = app(app(sK51,sK49),sK52),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
( ~ segmentP(sK48,sK47)
| ~ neq(sK47,nil)
| nil = sK48 ),
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
ssList(sK51),
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
( neq(sK48,nil)
| nil != sK47 ),
inference(cnf_transformation,[],[f222]) ).
fof(f421,plain,
( nil != sK49
| nil = sK50 ),
inference(cnf_transformation,[],[f222]) ).
fof(f422,plain,
ssList(sK50),
inference(cnf_transformation,[],[f222]) ).
fof(f423,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f424,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f425,plain,
ssList(sK49),
inference(cnf_transformation,[],[f222]) ).
fof(f431,plain,
( neq(sK50,nil)
| nil != sK49 ),
inference(definition_unfolding,[],[f419,f424,f423]) ).
fof(f433,plain,
( ~ segmentP(sK50,sK49)
| ~ neq(sK49,nil)
| nil = sK50 ),
inference(definition_unfolding,[],[f416,f424,f423,f423,f424]) ).
fof(f439,plain,
! [X2,X3,X1] :
( ~ ssList(app(app(X2,X1),X3))
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| segmentP(app(app(X2,X1),X3),X1) ),
inference(equality_resolution,[],[f241]) ).
fof(f448,plain,
! [X1] :
( ~ ssList(X1)
| ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(equality_resolution,[],[f304]) ).
fof(f471,plain,
! [X2,X3,X1] :
( ~ ssList(app(app(X2,X1),X3))
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ segmentP(app(app(X2,X1),X3),X1) ),
inference(consistent_polarity_flipping,[],[f439]) ).
fof(f499,plain,
! [X1] :
( ~ ssList(X1)
| ~ ssList(X1)
| neq(X1,X1) ),
inference(consistent_polarity_flipping,[],[f448]) ).
fof(f500,plain,
! [X0,X1] :
( ~ neq(X0,X1)
| ~ ssList(X1)
| X0 = X1
| ~ ssList(X0) ),
inference(consistent_polarity_flipping,[],[f303]) ).
fof(f552,plain,
( ~ neq(sK50,nil)
| nil != sK49 ),
inference(consistent_polarity_flipping,[],[f431]) ).
fof(f554,plain,
( segmentP(sK50,sK49)
| neq(sK49,nil)
| nil = sK50 ),
inference(consistent_polarity_flipping,[],[f433]) ).
fof(f559,plain,
! [X1] :
( neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f499]) ).
fof(f563,definition,
( spl53_1
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl53_1])],[avatar_definition]) ).
fof(f565,plain,
( nil = sK50
| ~ spl53_1 ),
inference(avatar_component_clause,[],[f563]) ).
fof(f567,definition,
( spl53_2
<=> neq(sK49,nil) ),
introduced(definition,[new_symbols(definition,[spl53_2])],[avatar_definition]) ).
fof(f569,plain,
( neq(sK49,nil)
| ~ spl53_2 ),
inference(avatar_component_clause,[],[f567]) ).
fof(f571,definition,
( spl53_3
<=> segmentP(sK50,sK49) ),
introduced(definition,[new_symbols(definition,[spl53_3])],[avatar_definition]) ).
fof(f573,plain,
( segmentP(sK50,sK49)
| ~ spl53_3 ),
inference(avatar_component_clause,[],[f571]) ).
fof(f574,plain,
( spl53_1
| spl53_2
| spl53_3 ),
inference(avatar_split_clause,[],[f554,f571,f567,f563]) ).
fof(f576,definition,
( spl53_4
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl53_4])],[avatar_definition]) ).
fof(f578,plain,
( nil != sK49
| spl53_4 ),
inference(avatar_component_clause,[],[f576]) ).
fof(f581,definition,
( spl53_5
<=> neq(sK50,nil) ),
introduced(definition,[new_symbols(definition,[spl53_5])],[avatar_definition]) ).
fof(f583,plain,
( ~ neq(sK50,nil)
| spl53_5 ),
inference(avatar_component_clause,[],[f581]) ).
fof(f584,plain,
( ~ spl53_4
| ~ spl53_5 ),
inference(avatar_split_clause,[],[f552,f581,f576]) ).
fof(f586,plain,
( spl53_1
| ~ spl53_4 ),
inference(avatar_split_clause,[],[f421,f576,f563]) ).
fof(f592,definition,
( spl53_7
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl53_7])],[avatar_definition]) ).
fof(f593,plain,
( ssList(nil)
| ~ spl53_7 ),
inference(avatar_component_clause,[],[f592]) ).
fof(f621,plain,
spl53_7,
inference(avatar_split_clause,[],[f306,f592]) ).
fof(f804,plain,
( ~ neq(nil,nil)
| ~ spl53_1
| spl53_5 ),
inference(superposition,[],[f583,f565]) ).
fof(f886,plain,
( ~ ssList(nil)
| ~ spl53_1
| spl53_5 ),
inference(resolution,[],[f804,f559]) ).
fof(f887,plain,
( $false
| ~ spl53_1
| spl53_5
| ~ spl53_7 ),
inference(forward_subsumption_resolution,[],[f886,f593]) ).
fof(f888,plain,
( ~ spl53_1
| spl53_5
| ~ spl53_7 ),
inference(avatar_contradiction_clause,[],[f887]) ).
fof(f893,plain,
( ~ ssList(nil)
| nil = sK49
| ~ ssList(sK49)
| ~ spl53_2 ),
inference(resolution,[],[f500,f569]) ).
fof(f900,plain,
( nil = sK49
| ~ ssList(sK49)
| ~ spl53_2
| ~ spl53_7 ),
inference(forward_subsumption_resolution,[],[f893,f593]) ).
fof(f901,plain,
( ~ ssList(sK49)
| ~ spl53_2
| spl53_4
| ~ spl53_7 ),
inference(forward_subsumption_resolution,[],[f900,f578]) ).
fof(f902,plain,
( $false
| ~ spl53_2
| spl53_4
| ~ spl53_7 ),
inference(forward_subsumption_resolution,[],[f901,f425]) ).
fof(f903,plain,
( ~ spl53_2
| spl53_4
| ~ spl53_7 ),
inference(avatar_contradiction_clause,[],[f902]) ).
fof(f1027,plain,
( nil != sK50
| ~ ssList(sK52)
| nil = app(sK51,sK49)
| ~ ssList(app(sK51,sK49)) ),
inference(superposition,[],[f394,f415]) ).
fof(f1052,definition,
( spl53_25
<=> ssList(app(sK51,sK49)) ),
introduced(definition,[new_symbols(definition,[spl53_25])],[avatar_definition]) ).
fof(f1053,plain,
( ssList(app(sK51,sK49))
| ~ spl53_25 ),
inference(avatar_component_clause,[],[f1052]) ).
fof(f1054,plain,
( ~ ssList(app(sK51,sK49))
| spl53_25 ),
inference(avatar_component_clause,[],[f1052]) ).
fof(f1056,definition,
( spl53_26
<=> nil = app(sK51,sK49) ),
introduced(definition,[new_symbols(definition,[spl53_26])],[avatar_definition]) ).
fof(f1058,plain,
( nil = app(sK51,sK49)
| ~ spl53_26 ),
inference(avatar_component_clause,[],[f1056]) ).
fof(f1098,plain,
( ~ ssList(sK49)
| ~ ssList(sK51)
| spl53_25 ),
inference(resolution,[],[f1054,f318]) ).
fof(f1099,plain,
( ~ ssList(sK51)
| spl53_25 ),
inference(forward_subsumption_resolution,[],[f1098,f425]) ).
fof(f1100,plain,
( $false
| spl53_25 ),
inference(forward_subsumption_resolution,[],[f1099,f418]) ).
fof(f1101,plain,
spl53_25,
inference(avatar_contradiction_clause,[],[f1100]) ).
fof(f1254,plain,
( nil != nil
| ~ ssList(sK49)
| nil = sK49
| ~ ssList(sK51)
| ~ spl53_26 ),
inference(superposition,[],[f395,f1058]) ).
fof(f1258,plain,
( ~ ssList(sK49)
| nil = sK49
| ~ ssList(sK51)
| ~ spl53_26 ),
inference(trivial_inequality_removal,[],[f1254]) ).
fof(f1260,plain,
( nil = sK49
| ~ ssList(sK51)
| ~ spl53_26 ),
inference(forward_subsumption_resolution,[],[f1258,f425]) ).
fof(f1265,plain,
( ~ ssList(sK51)
| spl53_4
| ~ spl53_26 ),
inference(forward_subsumption_resolution,[],[f1260,f578]) ).
fof(f1271,plain,
( $false
| spl53_4
| ~ spl53_26 ),
inference(forward_subsumption_resolution,[],[f1265,f418]) ).
fof(f1272,plain,
( spl53_4
| ~ spl53_26 ),
inference(avatar_contradiction_clause,[],[f1271]) ).
fof(f1283,plain,
( nil != sK50
| nil = app(sK51,sK49)
| ~ ssList(app(sK51,sK49)) ),
inference(forward_subsumption_resolution,[],[f1027,f413]) ).
fof(f1286,plain,
( nil != sK50
| nil = app(sK51,sK49)
| ~ spl53_25 ),
inference(forward_subsumption_resolution,[],[f1283,f1053]) ).
fof(f1288,plain,
( spl53_26
| ~ spl53_1
| ~ spl53_25 ),
inference(avatar_split_clause,[],[f1286,f1052,f563,f1056]) ).
fof(f2219,plain,
( ~ ssList(sK50)
| ~ ssList(sK49)
| ~ ssList(sK52)
| ~ ssList(sK51)
| ~ segmentP(sK50,sK49) ),
inference(superposition,[],[f471,f415]) ).
fof(f2222,plain,
( ~ ssList(sK49)
| ~ ssList(sK52)
| ~ ssList(sK51)
| ~ segmentP(sK50,sK49) ),
inference(forward_subsumption_resolution,[],[f2219,f422]) ).
fof(f2229,plain,
( ~ ssList(sK52)
| ~ ssList(sK51)
| ~ segmentP(sK50,sK49) ),
inference(forward_subsumption_resolution,[],[f2222,f425]) ).
fof(f2235,plain,
( ~ ssList(sK51)
| ~ segmentP(sK50,sK49) ),
inference(forward_subsumption_resolution,[],[f2229,f413]) ).
fof(f2236,plain,
~ segmentP(sK50,sK49),
inference(forward_subsumption_resolution,[],[f2235,f418]) ).
fof(f2237,plain,
( $false
| ~ spl53_3 ),
inference(forward_subsumption_resolution,[],[f2236,f573]) ).
fof(f2238,plain,
~ spl53_3,
inference(avatar_contradiction_clause,[],[f2237]) ).
cnf(s1,plain,
( spl53_1
| spl53_2
| spl53_3 ),
inference(sat_conversion,[],[f574]) ).
cnf(s3,plain,
( ~ spl53_4
| ~ spl53_5 ),
inference(sat_conversion,[],[f584]) ).
cnf(s5,plain,
( spl53_1
| ~ spl53_4 ),
inference(sat_conversion,[],[f586]) ).
cnf(s14,plain,
spl53_7,
inference(sat_conversion,[],[f621]) ).
cnf(s23,plain,
( ~ spl53_1
| spl53_5
| ~ spl53_7 ),
inference(sat_conversion,[],[f888]) ).
cnf(s25,plain,
( ~ spl53_2
| spl53_4
| ~ spl53_7 ),
inference(sat_conversion,[],[f903]) ).
cnf(s31,plain,
spl53_25,
inference(sat_conversion,[],[f1101]) ).
cnf(s42,plain,
( spl53_4
| ~ spl53_26 ),
inference(sat_conversion,[],[f1272]) ).
cnf(s45,plain,
( ~ spl53_1
| ~ spl53_25
| spl53_26 ),
inference(sat_conversion,[],[f1288]) ).
cnf(s83,plain,
~ spl53_3,
inference(sat_conversion,[],[f2238]) ).
cnf(s118,plain,
( spl53_1
| spl53_2 ),
inference(rat,[],[s1,s83]) ).
cnf(s119,plain,
spl53_1,
inference(rat,[],[s25,s118,s5,s14]) ).
cnf(s120,plain,
spl53_26,
inference(rat,[],[s45,s31,s119]) ).
cnf(s124,plain,
spl53_5,
inference(rat,[],[s23,s14,s119]) ).
cnf(s125,plain,
spl53_4,
inference(rat,[],[s42,s120]) ).
cnf(s127,plain,
$false,
inference(rat,[],[s3,s124,s125]) ).
fof(f2239,plain,
$false,
inference(avatar_sat_refutation,[],[s127]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC112+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n001.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 28 08:01:02 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.51 % (200099)Will run a generic schedule for satisfiability detection.
% 0.17/0.51 % (200109)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1980483947:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.51 % (200105)% WARNING: option uhcvi not known.
% 0.17/0.51 % (200104)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2650097354_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.51 % (200105)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1216474529:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.51 % (200106)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=171949540:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.51 % (200107)dis+10_1_sil=32000:sp=arity:random_seed=110847279:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.51 % (200108)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2280538933:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.51 % (200110)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1687113921:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.51 % TRYING [1]
% 0.17/0.51 % TRYING [2]
% 0.17/0.51 % TRYING [3]
% 0.17/0.51 % (200109)Instruction limit reached!
% 0.17/0.51 % (200109)------------------------------
% 0.17/0.51 % (200109)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.51 % (200109)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.51 % (200109)CaDiCaL version: 2.1.3
% 0.17/0.51 % (200109)Termination reason: Instruction limit
% 0.17/0.51 % (200109)Termination phase: Saturation
% 0.17/0.51 % (200109)Time elapsed: 0.044 s
% 0.17/0.51 % (200109)Peak memory usage: 14 MB
% 0.17/0.51 % (200109)Instructions burned: 132 (million)
% 0.17/0.51 % TRYING [4]
% 0.17/0.51 % (200105) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-200099-200105"...
% 0.17/0.51 % (200105)...printing done.
% 0.17/0.51 % (200105)Refutation found. Thanks to Tanya!
% 0.17/0.51 % SZS status Theorem for theBenchmark
% 0.17/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.51 % (200105)------------------------------
% 0.17/0.51 % (200105)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.51 % (200105)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.51 % (200105)CaDiCaL version: 2.1.3
% 0.17/0.51 % (200105)Termination reason: Refutation
% 0.17/0.51 % (200105)Time elapsed: 0.047 s
% 0.17/0.51 % (200105)Peak memory usage: 13 MB
% 0.17/0.51 % (200105)Instructions burned: 72 (million)
% 0.17/0.51 % (200099)Success in time 0.089 s
% 0.17/0.51 % Vampire exiting
%------------------------------------------------------------------------------