%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC031+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 : n017.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:22 PM UTC 2026
% Result : Theorem 5.65s 1.40s
% Output : Refutation 5.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 23
% Syntax : Number of formulae : 173 ( 18 unt; 9 def)
% Number of atoms : 631 ( 120 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 785 ( 327 ~; 337 |; 73 &)
% ( 19 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 19 ( 17 usr; 10 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 125 ( 0 sgn 107 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] :
( ssList(X0)
=> ( singletonP(X0)
<=> ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax4) ).
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax5) ).
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(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(f22,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssItem(hd(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(f24,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssList(tl(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(f39,axiom,
~ singletonP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax39) ).
fof(f46,axiom,
! [X0] :
( ssList(X0)
=> ( frontsegP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax46) ).
fof(f57,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax57) ).
fof(f67,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssList(X1)
=> ( totalorderedP(cons(X0,X1))
<=> ( nil = X1
| ( nil != X1
& totalorderedP(X1)
& leq(X0,hd(X1)) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax67) ).
fof(f78,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> cons(hd(X0),tl(X0)) = X0 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ frontsegP(X3,X2)
| ~ totalorderedP(X2)
| ? [X4] :
( ssList(X4)
& neq(X2,X4)
& frontsegP(X3,X4)
& segmentP(X4,X2)
& totalorderedP(X4) )
| ( ( nil != X1
| nil = X0 )
& ( nil != X0
| nil = X1 ) ) ) ) ) ) ),
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
| ~ frontsegP(X3,X2)
| ~ totalorderedP(X2)
| ? [X4] :
( ssList(X4)
& neq(X2,X4)
& frontsegP(X3,X4)
& segmentP(X4,X2)
& totalorderedP(X4) )
| ( ( nil != X1
| nil = X0 )
& ( nil != X0
| nil = X1 ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f100,plain,
! [X0] :
( ( singletonP(X0)
<=> ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f101,plain,
! [X0] :
( ! [X1] :
( ( frontsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f119,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f126,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f127,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f126]) ).
fof(f129,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f130,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f129]) ).
fof(f132,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f158,plain,
! [X0] :
( ( frontsegP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f46]) ).
fof(f175,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f57]) ).
fof(f181,plain,
! [X0] :
( ! [X1] :
( ( totalorderedP(cons(X0,X1))
<=> ( nil = X1
| ( nil != X1
& totalorderedP(X1)
& leq(X0,hd(X1)) ) ) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f67]) ).
fof(f192,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f78]) ).
fof(f193,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f192]) ).
fof(f198,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& frontsegP(X3,X2)
& totalorderedP(X2)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X2,X4)
| ~ frontsegP(X3,X4)
| ~ segmentP(X4,X2)
| ~ totalorderedP(X4) )
& ( ( nil = X1
& nil != X0 )
| ( nil = X0
& nil != X1 ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& frontsegP(X3,X2)
& totalorderedP(X2)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X2,X4)
| ~ frontsegP(X3,X4)
| ~ segmentP(X4,X2)
| ~ totalorderedP(X4) )
& ( ( nil = X1
& nil != X0 )
| ( nil = X0
& nil != X1 ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f237,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,nil) != X0 ) )
& ( ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f100]) ).
fof(f238,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,nil) != X0 ) )
& ( ? [X2] :
( ssItem(X2)
& cons(X2,nil) = X0 )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f237]) ).
fof(f239,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,nil) != X0 ) )
& ( ( ssItem(sK10(X0))
& cons(sK10(X0),nil) = X0 )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10]),skolemize(X2,sK10(X0))],[f238]) ).
fof(f240,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0 ) )
& ( ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f101]) ).
fof(f241,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0 ) )
& ( ? [X3] :
( ssList(X3)
& app(X1,X3) = X0 )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f240]) ).
fof(f242,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0 ) )
& ( ( ssList(sK11(X0,X1))
& app(X1,sK11(X0,X1)) = X0 )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11]),skolemize(X3,sK11(X0,X1))],[f241]) ).
fof(f273,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f283,plain,
! [X0] :
( ( ( frontsegP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ frontsegP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f158]) ).
fof(f286,plain,
! [X0] :
( ! [X1] :
( ( ( totalorderedP(cons(X0,X1))
| ( nil != X1
& ( nil = X1
| ~ totalorderedP(X1)
| ~ leq(X0,hd(X1)) ) ) )
& ( nil = X1
| ( nil != X1
& totalorderedP(X1)
& leq(X0,hd(X1)) )
| ~ totalorderedP(cons(X0,X1)) ) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f181]) ).
fof(f287,plain,
! [X0] :
( ! [X1] :
( ( ( totalorderedP(cons(X0,X1))
| ( nil != X1
& ( nil = X1
| ~ totalorderedP(X1)
| ~ leq(X0,hd(X1)) ) ) )
& ( nil = X1
| ( nil != X1
& totalorderedP(X1)
& leq(X0,hd(X1)) )
| ~ totalorderedP(cons(X0,X1)) ) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f286]) ).
fof(f296,plain,
( sK54 = sK56
& sK53 = sK55
& frontsegP(sK56,sK55)
& totalorderedP(sK55)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(sK55,X4)
| ~ frontsegP(sK56,X4)
| ~ segmentP(X4,sK55)
| ~ totalorderedP(X4) )
& ( ( nil = sK54
& nil != sK53 )
| ( nil = sK53
& nil != sK54 ) )
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56)],[f222]) ).
fof(f308,plain,
! [X0,X1] :
( singletonP(X0)
| ~ ssItem(X1)
| cons(X1,nil) != X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f239]) ).
fof(f311,plain,
! [X2,X0,X1] :
( frontsegP(X0,X1)
| ~ ssList(X2)
| app(X1,X2) != X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f242]) ).
fof(f387,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f273]) ).
fof(f388,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f397,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f127]) ).
fof(f399,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f401,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f420,plain,
~ singletonP(nil),
inference(cnf_transformation,[],[f39]) ).
fof(f429,plain,
! [X0] :
( ~ frontsegP(nil,X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f283]) ).
fof(f442,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f175]) ).
fof(f457,plain,
! [X0,X1] :
( totalorderedP(cons(X0,X1))
| nil != X1
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f287]) ).
fof(f474,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| cons(hd(X0),tl(X0)) = X0 ),
inference(cnf_transformation,[],[f193]) ).
fof(f477,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| cons(X1,X0) = app(cons(X1,nil),X0) ),
inference(cnf_transformation,[],[f198]) ).
fof(f498,plain,
ssList(sK55),
inference(cnf_transformation,[],[f296]) ).
fof(f499,plain,
ssList(sK56),
inference(cnf_transformation,[],[f296]) ).
fof(f500,plain,
( nil != sK53
| nil != sK54 ),
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
( nil = sK54
| nil = sK53 ),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
! [X4] :
( ~ ssList(X4)
| ~ neq(sK55,X4)
| ~ frontsegP(sK56,X4)
| ~ segmentP(X4,sK55)
| ~ totalorderedP(X4) ),
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
frontsegP(sK56,sK55),
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f508,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f509,plain,
( nil = sK56
| nil = sK55 ),
inference(definition_unfolding,[],[f503,f508,f507]) ).
fof(f512,plain,
( nil != sK55
| nil != sK56 ),
inference(definition_unfolding,[],[f500,f507,f508]) ).
fof(f517,plain,
! [X1] :
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| singletonP(cons(X1,nil)) ),
inference(equality_resolution,[],[f308]) ).
fof(f518,plain,
! [X2,X1] :
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(X1,X2)) ),
inference(equality_resolution,[],[f311]) ).
fof(f535,plain,
! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssList(nil)
| ~ ssItem(X0) ),
inference(equality_resolution,[],[f457]) ).
fof(f550,definition,
( spl57_1
<=> nil = sK55 ),
introduced(definition,[new_symbols(definition,[spl57_1])],[avatar_definition]) ).
fof(f551,plain,
( nil != sK55
| spl57_1 ),
inference(avatar_component_clause,[],[f550]) ).
fof(f552,plain,
( nil = sK55
| ~ spl57_1 ),
inference(avatar_component_clause,[],[f550]) ).
fof(f554,definition,
( spl57_2
<=> nil = sK56 ),
introduced(definition,[new_symbols(definition,[spl57_2])],[avatar_definition]) ).
fof(f555,plain,
( nil != sK56
| spl57_2 ),
inference(avatar_component_clause,[],[f554]) ).
fof(f556,plain,
( nil = sK56
| ~ spl57_2 ),
inference(avatar_component_clause,[],[f554]) ).
fof(f557,plain,
( spl57_1
| spl57_2 ),
inference(avatar_split_clause,[],[f509,f554,f550]) ).
fof(f558,plain,
( frontsegP(nil,sK55)
| ~ spl57_2 ),
inference(backward_demodulation,[],[f506,f556]) ).
fof(f560,plain,
( nil != sK55
| ~ spl57_2 ),
inference(forward_subsumption_resolution,[],[f512,f556]) ).
fof(f561,plain,
( ~ spl57_1
| ~ spl57_2 ),
inference(avatar_split_clause,[],[f560,f554,f550]) ).
fof(f588,plain,
( ssList(nil)
| ~ spl57_1 ),
inference(backward_demodulation,[],[f498,f552]) ).
fof(f880,plain,
( nil = sK55
| ~ ssList(sK55)
| ~ spl57_2 ),
inference(resolution,[],[f429,f558]) ).
fof(f883,plain,
( ~ ssList(sK55)
| spl57_1
| ~ spl57_2 ),
inference(forward_subsumption_resolution,[],[f880,f551]) ).
fof(f884,plain,
( $false
| spl57_1
| ~ spl57_2 ),
inference(forward_subsumption_resolution,[],[f883,f498]) ).
fof(f885,plain,
( spl57_1
| ~ spl57_2 ),
inference(avatar_contradiction_clause,[],[f884]) ).
fof(f1002,plain,
( ! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) )
| ~ spl57_1 ),
inference(forward_subsumption_resolution,[],[f535,f588]) ).
fof(f1024,plain,
( ! [X4] :
( ~ neq(nil,X4)
| ~ ssList(X4)
| ~ frontsegP(sK56,X4)
| ~ segmentP(X4,sK55)
| ~ totalorderedP(X4) )
| ~ spl57_1 ),
inference(forward_demodulation,[],[f504,f552]) ).
fof(f1025,plain,
( ! [X4] :
( ~ segmentP(X4,nil)
| ~ neq(nil,X4)
| ~ ssList(X4)
| ~ frontsegP(sK56,X4)
| ~ totalorderedP(X4) )
| ~ spl57_1 ),
inference(forward_demodulation,[],[f1024,f552]) ).
fof(f1381,plain,
( ! [X4] :
( ~ frontsegP(sK56,X4)
| ~ ssList(X4)
| ~ neq(nil,X4)
| ~ totalorderedP(X4) )
| ~ spl57_1 ),
inference(forward_subsumption_resolution,[],[f1025,f442]) ).
fof(f3297,plain,
! [X0] :
( ~ ssItem(X0)
| singletonP(cons(X0,nil))
| ~ ssItem(X0)
| ~ ssList(nil) ),
inference(resolution,[],[f517,f388]) ).
fof(f3298,plain,
! [X0] :
( ~ ssItem(X0)
| singletonP(cons(X0,nil))
| ~ ssList(nil) ),
inference(duplicate_literal_removal,[],[f3297]) ).
fof(f3299,plain,
( ! [X0] :
( singletonP(cons(X0,nil))
| ~ ssItem(X0) )
| ~ spl57_1 ),
inference(forward_subsumption_resolution,[],[f3298,f588]) ).
fof(f5281,plain,
( nil = sK56
| sK56 = cons(hd(sK56),tl(sK56)) ),
inference(resolution,[],[f474,f499]) ).
fof(f6043,plain,
( sK56 = cons(hd(sK56),tl(sK56))
| spl57_2 ),
inference(forward_subsumption_resolution,[],[f5281,f555]) ).
fof(f6623,plain,
! [X2,X1] :
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(forward_subsumption_resolution,[],[f518,f401]) ).
fof(f6716,definition,
( spl57_168
<=> ssList(tl(sK56)) ),
introduced(definition,[new_symbols(definition,[spl57_168])],[avatar_definition]) ).
fof(f6717,plain,
( ssList(tl(sK56))
| ~ spl57_168 ),
inference(avatar_component_clause,[],[f6716]) ).
fof(f6718,plain,
( ~ ssList(tl(sK56))
| spl57_168 ),
inference(avatar_component_clause,[],[f6716]) ).
fof(f6720,definition,
( spl57_169
<=> frontsegP(sK56,cons(hd(sK56),nil)) ),
introduced(definition,[new_symbols(definition,[spl57_169])],[avatar_definition]) ).
fof(f6721,plain,
( ~ frontsegP(sK56,cons(hd(sK56),nil))
| spl57_169 ),
inference(avatar_component_clause,[],[f6720]) ).
fof(f6722,plain,
( frontsegP(sK56,cons(hd(sK56),nil))
| ~ spl57_169 ),
inference(avatar_component_clause,[],[f6720]) ).
fof(f6724,plain,
( nil = sK56
| ~ ssList(sK56)
| spl57_168 ),
inference(resolution,[],[f6718,f399]) ).
fof(f6725,plain,
( ~ ssList(sK56)
| spl57_2
| spl57_168 ),
inference(forward_subsumption_resolution,[],[f6724,f555]) ).
fof(f6726,plain,
( $false
| spl57_2
| spl57_168 ),
inference(forward_subsumption_resolution,[],[f6725,f499]) ).
fof(f6727,plain,
( spl57_2
| spl57_168 ),
inference(avatar_contradiction_clause,[],[f6726]) ).
fof(f7335,definition,
( spl57_181
<=> ssItem(hd(sK56)) ),
introduced(definition,[new_symbols(definition,[spl57_181])],[avatar_definition]) ).
fof(f7336,plain,
( ssItem(hd(sK56))
| ~ spl57_181 ),
inference(avatar_component_clause,[],[f7335]) ).
fof(f7337,plain,
( ~ ssItem(hd(sK56))
| spl57_181 ),
inference(avatar_component_clause,[],[f7335]) ).
fof(f7689,plain,
( ! [X0] :
( ~ ssItem(X0)
| cons(X0,tl(sK56)) = app(cons(X0,nil),tl(sK56)) )
| ~ spl57_168 ),
inference(resolution,[],[f477,f6717]) ).
fof(f8265,plain,
( nil = sK56
| ~ ssList(sK56)
| spl57_181 ),
inference(resolution,[],[f7337,f397]) ).
fof(f8266,plain,
( ~ ssList(sK56)
| spl57_2
| spl57_181 ),
inference(forward_subsumption_resolution,[],[f8265,f555]) ).
fof(f8267,plain,
( $false
| spl57_2
| spl57_181 ),
inference(forward_subsumption_resolution,[],[f8266,f499]) ).
fof(f8268,plain,
( spl57_2
| spl57_181 ),
inference(avatar_contradiction_clause,[],[f8267]) ).
fof(f8269,plain,
( cons(hd(sK56),tl(sK56)) = app(cons(hd(sK56),nil),tl(sK56))
| ~ spl57_168
| ~ spl57_181 ),
inference(resolution,[],[f7336,f7689]) ).
fof(f8270,plain,
( sK56 = app(cons(hd(sK56),nil),tl(sK56))
| spl57_2
| ~ spl57_168
| ~ spl57_181 ),
inference(forward_demodulation,[],[f8269,f6043]) ).
fof(f8310,plain,
( frontsegP(sK56,cons(hd(sK56),nil))
| ~ ssList(tl(sK56))
| ~ ssList(cons(hd(sK56),nil))
| spl57_2
| ~ spl57_168
| ~ spl57_181 ),
inference(superposition,[],[f6623,f8270]) ).
fof(f8312,plain,
( ~ ssList(tl(sK56))
| ~ ssList(cons(hd(sK56),nil))
| spl57_2
| ~ spl57_168
| spl57_169
| ~ spl57_181 ),
inference(forward_subsumption_resolution,[],[f8310,f6721]) ).
fof(f8313,plain,
( ~ ssList(cons(hd(sK56),nil))
| spl57_2
| ~ spl57_168
| spl57_169
| ~ spl57_181 ),
inference(forward_subsumption_resolution,[],[f8312,f6717]) ).
fof(f8483,definition,
( spl57_196
<=> totalorderedP(cons(hd(sK56),nil)) ),
introduced(definition,[new_symbols(definition,[spl57_196])],[avatar_definition]) ).
fof(f8484,plain,
( totalorderedP(cons(hd(sK56),nil))
| ~ spl57_196 ),
inference(avatar_component_clause,[],[f8483]) ).
fof(f8485,plain,
( ~ totalorderedP(cons(hd(sK56),nil))
| spl57_196 ),
inference(avatar_component_clause,[],[f8483]) ).
fof(f8487,definition,
( spl57_197
<=> neq(nil,cons(hd(sK56),nil)) ),
introduced(definition,[new_symbols(definition,[spl57_197])],[avatar_definition]) ).
fof(f8488,plain,
( neq(nil,cons(hd(sK56),nil))
| ~ spl57_197 ),
inference(avatar_component_clause,[],[f8487]) ).
fof(f8489,plain,
( ~ neq(nil,cons(hd(sK56),nil))
| spl57_197 ),
inference(avatar_component_clause,[],[f8487]) ).
fof(f8491,plain,
( ~ ssItem(hd(sK56))
| ~ spl57_1
| spl57_196 ),
inference(resolution,[],[f8485,f1002]) ).
fof(f8492,plain,
( $false
| ~ spl57_1
| ~ spl57_181
| spl57_196 ),
inference(forward_subsumption_resolution,[],[f8491,f7336]) ).
fof(f8493,plain,
( ~ spl57_1
| ~ spl57_181
| spl57_196 ),
inference(avatar_contradiction_clause,[],[f8492]) ).
fof(f8550,plain,
( ~ ssList(cons(hd(sK56),nil))
| ~ neq(nil,cons(hd(sK56),nil))
| ~ totalorderedP(cons(hd(sK56),nil))
| ~ spl57_1
| ~ spl57_169 ),
inference(resolution,[],[f6722,f1381]) ).
fof(f8582,plain,
( ~ ssList(cons(hd(sK56),nil))
| ~ totalorderedP(cons(hd(sK56),nil))
| ~ spl57_1
| ~ spl57_169
| ~ spl57_197 ),
inference(forward_subsumption_resolution,[],[f8550,f8488]) ).
fof(f8583,plain,
( ~ ssList(cons(hd(sK56),nil))
| ~ spl57_1
| ~ spl57_169
| ~ spl57_196
| ~ spl57_197 ),
inference(forward_subsumption_resolution,[],[f8582,f8484]) ).
fof(f8584,plain,
( ~ ssItem(hd(sK56))
| ~ ssList(nil)
| ~ spl57_1
| ~ spl57_169
| ~ spl57_196
| ~ spl57_197 ),
inference(resolution,[],[f8583,f388]) ).
fof(f8585,plain,
( ~ ssList(nil)
| ~ spl57_1
| ~ spl57_169
| ~ spl57_181
| ~ spl57_196
| ~ spl57_197 ),
inference(forward_subsumption_resolution,[],[f8584,f7336]) ).
fof(f8586,plain,
( $false
| ~ spl57_1
| ~ spl57_169
| ~ spl57_181
| ~ spl57_196
| ~ spl57_197 ),
inference(forward_subsumption_resolution,[],[f8585,f588]) ).
fof(f8587,plain,
( ~ spl57_1
| ~ spl57_169
| ~ spl57_181
| ~ spl57_196
| ~ spl57_197 ),
inference(avatar_contradiction_clause,[],[f8586]) ).
fof(f8589,plain,
( nil = cons(hd(sK56),nil)
| ~ ssList(cons(hd(sK56),nil))
| ~ ssList(nil)
| spl57_197 ),
inference(resolution,[],[f8489,f387]) ).
fof(f8592,plain,
( nil = cons(hd(sK56),nil)
| ~ ssList(cons(hd(sK56),nil))
| ~ spl57_1
| spl57_197 ),
inference(forward_subsumption_resolution,[],[f8589,f588]) ).
fof(f8883,definition,
( spl57_206
<=> ssList(cons(hd(sK56),nil)) ),
introduced(definition,[new_symbols(definition,[spl57_206])],[avatar_definition]) ).
fof(f8884,plain,
( ssList(cons(hd(sK56),nil))
| ~ spl57_206 ),
inference(avatar_component_clause,[],[f8883]) ).
fof(f8885,plain,
( ~ ssList(cons(hd(sK56),nil))
| spl57_206 ),
inference(avatar_component_clause,[],[f8883]) ).
fof(f8887,definition,
( spl57_207
<=> nil = cons(hd(sK56),nil) ),
introduced(definition,[new_symbols(definition,[spl57_207])],[avatar_definition]) ).
fof(f8889,plain,
( nil = cons(hd(sK56),nil)
| ~ spl57_207 ),
inference(avatar_component_clause,[],[f8887]) ).
fof(f8890,plain,
( ~ spl57_206
| spl57_207
| ~ spl57_1
| spl57_197 ),
inference(avatar_split_clause,[],[f8592,f8487,f550,f8887,f8883]) ).
fof(f8895,plain,
( ~ ssItem(hd(sK56))
| ~ ssList(nil)
| spl57_206 ),
inference(resolution,[],[f8885,f388]) ).
fof(f8896,plain,
( ~ ssList(nil)
| ~ spl57_181
| spl57_206 ),
inference(forward_subsumption_resolution,[],[f8895,f7336]) ).
fof(f8899,plain,
( $false
| ~ spl57_1
| ~ spl57_181
| spl57_206 ),
inference(forward_subsumption_resolution,[],[f8896,f588]) ).
fof(f8900,plain,
( ~ spl57_1
| ~ spl57_181
| spl57_206 ),
inference(avatar_contradiction_clause,[],[f8899]) ).
fof(f8907,plain,
( singletonP(nil)
| ~ ssItem(hd(sK56))
| ~ spl57_1
| ~ spl57_207 ),
inference(superposition,[],[f3299,f8889]) ).
fof(f8927,plain,
( ~ ssItem(hd(sK56))
| ~ spl57_1
| ~ spl57_207 ),
inference(forward_subsumption_resolution,[],[f8907,f420]) ).
fof(f8929,plain,
( $false
| ~ spl57_1
| ~ spl57_181
| ~ spl57_207 ),
inference(forward_subsumption_resolution,[],[f8927,f7336]) ).
fof(f8930,plain,
( ~ spl57_1
| ~ spl57_181
| ~ spl57_207 ),
inference(avatar_contradiction_clause,[],[f8929]) ).
fof(f8940,plain,
( $false
| spl57_2
| ~ spl57_168
| spl57_169
| ~ spl57_181
| ~ spl57_206 ),
inference(forward_subsumption_resolution,[],[f8313,f8884]) ).
fof(f8941,plain,
( spl57_2
| ~ spl57_168
| spl57_169
| ~ spl57_181
| ~ spl57_206 ),
inference(avatar_contradiction_clause,[],[f8940]) ).
cnf(s1,plain,
( spl57_1
| spl57_2 ),
inference(sat_conversion,[],[f557]) ).
cnf(s2,plain,
( ~ spl57_1
| ~ spl57_2 ),
inference(sat_conversion,[],[f561]) ).
cnf(s17,plain,
( spl57_1
| ~ spl57_2 ),
inference(sat_conversion,[],[f885]) ).
cnf(s695,plain,
( spl57_2
| spl57_168 ),
inference(sat_conversion,[],[f6727]) ).
cnf(s739,plain,
( spl57_2
| spl57_181 ),
inference(sat_conversion,[],[f8268]) ).
cnf(s760,plain,
( ~ spl57_1
| ~ spl57_181
| spl57_196 ),
inference(sat_conversion,[],[f8493]) ).
cnf(s770,plain,
( ~ spl57_1
| ~ spl57_169
| ~ spl57_181
| ~ spl57_196
| ~ spl57_197 ),
inference(sat_conversion,[],[f8587]) ).
cnf(s798,plain,
( ~ spl57_1
| spl57_197
| ~ spl57_206
| spl57_207 ),
inference(sat_conversion,[],[f8890]) ).
cnf(s800,plain,
( ~ spl57_1
| ~ spl57_181
| spl57_206 ),
inference(sat_conversion,[],[f8900]) ).
cnf(s804,plain,
( ~ spl57_1
| ~ spl57_181
| ~ spl57_207 ),
inference(sat_conversion,[],[f8930]) ).
cnf(s806,plain,
( spl57_2
| ~ spl57_168
| spl57_169
| ~ spl57_181
| ~ spl57_206 ),
inference(sat_conversion,[],[f8941]) ).
cnf(s811,plain,
spl57_1,
inference(rat,[],[s1,s17]) ).
cnf(s829,plain,
~ spl57_2,
inference(rat,[],[s2,s811]) ).
cnf(s832,plain,
spl57_181,
inference(rat,[],[s739,s829]) ).
cnf(s833,plain,
spl57_168,
inference(rat,[],[s695,s829]) ).
cnf(s839,plain,
~ spl57_207,
inference(rat,[],[s804,s811,s832]) ).
cnf(s840,plain,
spl57_206,
inference(rat,[],[s800,s811,s832]) ).
cnf(s841,plain,
spl57_196,
inference(rat,[],[s760,s811,s832]) ).
cnf(s842,plain,
spl57_169,
inference(rat,[],[s806,s840,s832,s829,s833]) ).
cnf(s846,plain,
spl57_197,
inference(rat,[],[s798,s839,s811,s840]) ).
cnf(s847,plain,
$false,
inference(rat,[],[s770,s832,s841,s811,s846,s842]) ).
fof(f8942,plain,
$false,
inference(avatar_sat_refutation,[],[s847]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWC031+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.19/0.46 % Computer : n017.cluster.edu
% 0.19/0.46 % Model : x86_64 x86_64
% 0.19/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46 % Memory : 8046.5625MB
% 0.19/0.46 % OS : Linux 6.8.0-71-generic
% 0.19/0.46 % CPULimit : 300
% 0.19/0.46 % WCLimit : 300
% 0.19/0.46 % DateTime : Mon Sep 28 07:27:06 UTC 2026
% 0.19/0.46 % CPUTime :
% 0.19/0.46 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.22/0.51 Running first-order model finding
% 0.22/0.52 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
% 5.65/1.40 % (3375630)Will run a generic schedule for satisfiability detection.
% 5.65/1.40 % (3375637)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1522796366:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 5.65/1.40 % (3375636)% WARNING: option uhcvi not known.
% 5.65/1.40 % (3375635)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3283823004_2999 on theBenchmark for (2999ds/0Mi)
% 5.65/1.40 % (3375636)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4177008223:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 5.65/1.40 % (3375638)dis+10_1_sil=32000:sp=arity:random_seed=1779993450:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 5.65/1.40 % (3375639)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3844262718:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 5.65/1.40 % (3375640)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=103463455:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 5.65/1.40 % (3375641)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2859119036:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 5.65/1.40 % TRYING [1]
% 5.65/1.40 % TRYING [2]
% 5.65/1.40 % TRYING [3]
% 5.65/1.40 % TRYING [4]
% 5.65/1.40 % (3375638)Instruction limit reached!
% 5.65/1.40 % (3375638)------------------------------
% 5.65/1.40 % (3375638)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.65/1.40 % (3375638)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.65/1.40 % (3375638)CaDiCaL version: 2.1.3
% 5.65/1.40 % (3375638)Termination reason: Instruction limit
% 5.65/1.40 % (3375638)Termination phase: Saturation
% 5.65/1.40 % (3375638)Time elapsed: 0.107 s
% 5.65/1.40 % (3375638)Peak memory usage: 13 MB
% 5.65/1.40 % (3375638)Instructions burned: 104 (million)
% 5.65/1.40 % (3375639)Instruction limit reached!
% 5.65/1.40 % (3375639)------------------------------
% 5.65/1.40 % (3375639)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.65/1.40 % (3375639)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.65/1.40 % (3375639)CaDiCaL version: 2.1.3
% 5.65/1.40 % (3375639)Termination reason: Instruction limit
% 5.65/1.40 % (3375639)Termination phase: Saturation
% 5.65/1.40 % (3375639)Time elapsed: 0.119 s
% 5.65/1.40 % (3375639)Peak memory usage: 13 MB
% 5.65/1.40 % (3375639)Instructions burned: 116 (million)
% 5.65/1.40 % (3375640)Instruction limit reached!
% 5.65/1.40 % (3375640)------------------------------
% 5.65/1.40 % (3375640)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.65/1.40 % (3375640)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.65/1.40 % (3375640)CaDiCaL version: 2.1.3
% 5.65/1.40 % (3375640)Termination reason: Instruction limit
% 5.65/1.40 % (3375640)Termination phase: Saturation
% 5.65/1.40 % (3375640)Time elapsed: 0.132 s
% 5.65/1.40 % (3375640)Peak memory usage: 14 MB
% 5.65/1.40 % (3375640)Instructions burned: 131 (million)
% 5.65/1.40 % (3375649)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3916453119:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 5.65/1.40 % (3375650)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3648665626:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 5.65/1.40 % TRYING [5]
% 5.65/1.40 % (3375651)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=571166151:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 5.65/1.40 % TRYING [1]
% 5.65/1.40 % TRYING [2]
% 5.65/1.40 % (3375641)Instruction limit reached!
% 5.65/1.40 % (3375641)------------------------------
% 5.65/1.40 % (3375641)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.65/1.40 % (3375641)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.65/1.40 % (3375641)CaDiCaL version: 2.1.3
% 5.65/1.40 % (3375641)Termination reason: Instruction limit
% 5.65/1.40 % (3375641)Termination phase: Saturation
% 5.65/1.40 % (3375641)Time elapsed: 0.174 s
% 5.65/1.40 % (3375641)Peak memory usage: 14 MB
% 5.65/1.40 % (3375641)Instructions burned: 159 (million)
% 5.65/1.40 % TRYING [3]
% 5.65/1.40 % TRYING [4]
% 5.65/1.40 % (3375656)ott-21_1_sil=16000:fs=off:random_seed=483461166:i=180:av=off:fsr=off_2997 on theBenchmark for (2997ds/180Mi)
% 5.65/1.40 % (3375650)Instruction limit reached!
% 5.65/1.40 % (3375650)------------------------------
% 5.65/1.40 % (3375650)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.65/1.40 % (3375650)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.65/1.40 % (3375650)CaDiCaL version: 2.1.3
% 5.65/1.40 % (3375650)Termination reason: Instruction limit
% 5.65/1.40 % (3375650)Termination phase: Saturation
% 5.65/1.40 % (3375650)Time elapsed: 0.132 s
% 5.65/1.40 % (3375650)Peak memory usage: 13 MB
% 5.65/1.40 % (3375650)Instructions burned: 131 (million)
% 5.65/1.40 % TRYING [5]
% 5.65/1.40 % (3375658)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2144894450:i=477:bd=all_2996 on theBenchmark for (2996ds/477Mi)
% 5.65/1.40 % (3375656)Instruction limit reached!
% 5.65/1.40 % (3375656)------------------------------
% 5.65/1.40 % (3375656)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.65/1.40 % (3375656)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.65/1.40 % (3375656)CaDiCaL version: 2.1.3
% 5.65/1.40 % (3375656)Termination reason: Instruction limit
% 5.65/1.40 % (3375656)Termination phase: Saturation
% 5.65/1.40 % (3375656)Time elapsed: 0.165 s
% 5.65/1.40 % (3375656)Peak memory usage: 13 MB
% 5.65/1.40 % (3375656)Instructions burned: 180 (million)
% 5.65/1.40 % TRYING [6]
% 5.65/1.40 % (3375660)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3497273121:fmbsr=1.3:i=865:ins=25_2995 on theBenchmark for (2995ds/865Mi)
% 5.65/1.40 % TRYING [1]
% 5.65/1.40 % TRYING [2]
% 5.65/1.40 % TRYING [3]
% 5.65/1.40 % TRYING [4]
% 5.65/1.40 % TRYING [6]
% 5.65/1.40 % (3375649)Instruction limit reached!
% 5.65/1.40 % (3375649)------------------------------
% 5.65/1.40 % (3375649)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.65/1.40 % (3375649)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.65/1.40 % (3375649)CaDiCaL version: 2.1.3
% 5.65/1.40 % (3375649)Termination reason: Instruction limit
% 5.65/1.40 % (3375649)Termination phase: Finite model building constraint generation
% 5.65/1.40 % (3375649)Time elapsed: 0.543 s
% 5.65/1.40 % (3375649)Peak memory usage: 28 MB
% 5.65/1.40 % (3375649)Instructions burned: 715 (million)
% 5.65/1.40 % TRYING [5]
% 5.65/1.40 % (3375662)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2920780311:i=1179_2992 on theBenchmark for (2992ds/1179Mi)
% 5.65/1.40 % (3375651)Instruction limit reached!
% 5.65/1.40 % (3375651)------------------------------
% 5.65/1.40 % (3375651)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.65/1.40 % (3375651)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.65/1.40 % (3375651)CaDiCaL version: 2.1.3
% 5.65/1.40 % (3375651)Termination reason: Instruction limit
% 5.65/1.40 % (3375651)Termination phase: Saturation
% 5.65/1.40 % (3375651)Time elapsed: 0.639 s
% 5.65/1.40 % (3375651)Peak memory usage: 22 MB
% 5.65/1.40 % (3375651)Instructions burned: 684 (million)
% 5.65/1.40 % (3375658) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3375630-3375658"...
% 5.65/1.40 % (3375658)...printing done.
% 5.65/1.40 % (3375658)Refutation found. Thanks to Tanya!
% 5.65/1.40 % SZS status Theorem for theBenchmark
% 5.65/1.40 % SZS output start Proof for theBenchmark
% See solution above
% 5.65/1.40 % (3375658)------------------------------
% 5.65/1.40 % (3375658)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.65/1.40 % (3375658)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.65/1.40 % (3375658)CaDiCaL version: 2.1.3
% 5.65/1.40 % (3375658)Termination reason: Refutation
% 5.65/1.40 % (3375658)Time elapsed: 0.509 s
% 5.65/1.40 % (3375658)Peak memory usage: 15 MB
% 5.65/1.40 % (3375658)Instructions burned: 449 (million)
% 5.65/1.40 % (3375630)Success in time 0.872 s
% 5.65/1.40 % Vampire exiting
%------------------------------------------------------------------------------