%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC274+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 : n004.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:03:14 PM UTC 2026
% Result : Theorem 2.92s 1.10s
% Output : Refutation 3.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 4
% Syntax : Number of formulae : 49 ( 7 unt; 0 def)
% Number of atoms : 405 ( 63 equ)
% Maximal formula atoms : 27 ( 8 avg)
% Number of connectives : 581 ( 225 ~; 224 |; 100 &)
% ( 8 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 10 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 7 con; 0-2 aty)
% Number of variables : 181 ( 139 !; 42 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f11,axiom,
! [X0] :
( ssList(X0)
=> ( totalorderedP(X0)
<=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
=> leq(X1,X2) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax11) ).
fof(f12,axiom,
! [X0] :
( ssList(X0)
=> ( strictorderedP(X0)
<=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
=> lt(X1,X2) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax12) ).
fof(f93,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ( lt(X0,X1)
<=> ( X0 != X1
& leq(X0,X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax93) ).
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) ) ) ) ) ) )
| totalorderedP(X0)
| ( nil != X3
& nil = X2 ) ) ) ) ),
file('/export/starexec/sandbox/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) ) ) ) ) ) )
| totalorderedP(X0)
| ( nil != X3
& nil = X2 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& X1 = X3
& X0 = X2
& ? [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) ) ) ) ) )
& ssList(X4) )
& ~ totalorderedP(X0)
& ( nil = X3
| nil != X2 ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f117,plain,
! [X0] :
( ! [X1] :
( ( lt(X0,X1)
<=> ( X0 != X1
& leq(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f93]) ).
fof(f129,plain,
! [X0] :
( ( totalorderedP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( leq(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f11]) ).
fof(f130,plain,
! [X0] :
( ( totalorderedP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( leq(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) ) )
| ~ ssList(X0) ),
inference(flattening,[],[f129]) ).
fof(f133,plain,
! [X0] :
( ( strictorderedP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( lt(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f12]) ).
fof(f134,plain,
! [X0] :
( ( strictorderedP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( lt(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) ) )
| ~ ssList(X0) ),
inference(flattening,[],[f133]) ).
fof(f147,plain,
( ssList(sK3)
& sK1 = sK3
& sK0 = sK2
& ssList(sK5)
& sK3 = app(app(sK4,sK2),sK5)
& strictorderedP(sK2)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X6,nil)) != sK4
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != sK2
| ~ lt(X6,X8) ) ) ) )
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X10,nil),X11) != sK5
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != sK2
| ~ lt(X12,X10) ) ) ) )
& ssList(sK4)
& ~ totalorderedP(sK0)
& ( nil = sK3
| nil != sK2 )
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5)],[f98]) ).
fof(f152,plain,
! [X0] :
( ! [X1] :
( ( ( lt(X0,X1)
| X0 = X1
| ~ leq(X0,X1) )
& ( ( X0 != X1
& leq(X0,X1) )
| ~ lt(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f117]) ).
fof(f153,plain,
! [X0] :
( ! [X1] :
( ( ( lt(X0,X1)
| X0 = X1
| ~ leq(X0,X1) )
& ( ( X0 != X1
& leq(X0,X1) )
| ~ lt(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f152]) ).
fof(f156,plain,
! [X0] :
( ( ( totalorderedP(X0)
| ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ leq(X1,X2)
& app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ssItem(X1) ) )
& ( ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( leq(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) )
| ~ totalorderedP(X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f130]) ).
fof(f157,plain,
! [X0] :
( ( ( totalorderedP(X0)
| ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ leq(X1,X2)
& app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ssItem(X1) ) )
& ( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( leq(X6,X7)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssItem(X6) )
| ~ totalorderedP(X0) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f156]) ).
fof(f158,plain,
! [X0] :
( ( ( totalorderedP(X0)
| ( ~ leq(sK10(X0),sK11(X0))
& app(app(sK12(X0),cons(sK10(X0),sK13(X0))),cons(sK11(X0),sK14(X0))) = X0
& ssList(sK14(X0))
& ssList(sK13(X0))
& ssList(sK12(X0))
& ssItem(sK11(X0))
& ssItem(sK10(X0)) ) )
& ( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( leq(X6,X7)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssItem(X6) )
| ~ totalorderedP(X0) ) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10,sK11,sK12,sK13,sK14]),skolemize(X1,sK10(X0)),skolemize(X2,sK11(X0)),skolemize(X3,sK12(X0)),skolemize(X4,sK13(X0)),skolemize(X5,sK14(X0))],[f157]) ).
fof(f161,plain,
! [X0] :
( ( ( strictorderedP(X0)
| ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ lt(X1,X2)
& app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ssItem(X1) ) )
& ( ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( lt(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) )
| ~ strictorderedP(X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f134]) ).
fof(f162,plain,
! [X0] :
( ( ( strictorderedP(X0)
| ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ lt(X1,X2)
& app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ssItem(X1) ) )
& ( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( lt(X6,X7)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssItem(X6) )
| ~ strictorderedP(X0) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f161]) ).
fof(f163,plain,
! [X0] :
( ( ( strictorderedP(X0)
| ( ~ lt(sK15(X0),sK16(X0))
& app(app(sK17(X0),cons(sK15(X0),sK18(X0))),cons(sK16(X0),sK19(X0))) = X0
& ssList(sK19(X0))
& ssList(sK18(X0))
& ssList(sK17(X0))
& ssItem(sK16(X0))
& ssItem(sK15(X0)) ) )
& ( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( lt(X6,X7)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssItem(X6) )
| ~ strictorderedP(X0) ) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK15,sK16,sK17,sK18,sK19]),skolemize(X1,sK15(X0)),skolemize(X2,sK16(X0)),skolemize(X3,sK17(X0)),skolemize(X4,sK18(X0)),skolemize(X5,sK19(X0))],[f162]) ).
fof(f167,plain,
ssList(sK2),
inference(cnf_transformation,[],[f147]) ).
fof(f169,plain,
~ totalorderedP(sK0),
inference(cnf_transformation,[],[f147]) ).
fof(f173,plain,
strictorderedP(sK2),
inference(cnf_transformation,[],[f147]) ).
fof(f176,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f147]) ).
fof(f202,plain,
! [X0,X1] :
( leq(X0,X1)
| ~ lt(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f153]) ).
fof(f218,plain,
! [X0] :
( ssItem(sK10(X0))
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f158]) ).
fof(f219,plain,
! [X0] :
( ssItem(sK11(X0))
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f158]) ).
fof(f220,plain,
! [X0] :
( ssList(sK12(X0))
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f158]) ).
fof(f221,plain,
! [X0] :
( ssList(sK13(X0))
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f158]) ).
fof(f222,plain,
! [X0] :
( ssList(sK14(X0))
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f158]) ).
fof(f223,plain,
! [X0] :
( app(app(sK12(X0),cons(sK10(X0),sK13(X0))),cons(sK11(X0),sK14(X0))) = X0
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f158]) ).
fof(f224,plain,
! [X0] :
( ~ leq(sK10(X0),sK11(X0))
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f158]) ).
fof(f232,plain,
! [X10,X0,X8,X6,X9,X7] :
( lt(X6,X7)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssItem(X7)
| ~ ssItem(X6)
| ~ strictorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f163]) ).
fof(f248,plain,
~ totalorderedP(sK2),
inference(definition_unfolding,[],[f169,f176]) ).
fof(f259,plain,
! [X10,X8,X6,X9,X7] :
( ~ strictorderedP(app(app(X8,cons(X6,X9)),cons(X7,X10)))
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssItem(X7)
| ~ ssItem(X6)
| lt(X6,X7)
| ~ ssList(app(app(X8,cons(X6,X9)),cons(X7,X10))) ),
inference(equality_resolution,[],[f232]) ).
fof(f275,plain,
! [X0] :
( ~ lt(sK10(X0),sK11(X0))
| ~ ssItem(sK11(X0))
| ~ ssItem(sK10(X0))
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(resolution,[],[f202,f224]) ).
fof(f276,plain,
! [X0] :
( ~ lt(sK10(X0),sK11(X0))
| ~ ssItem(sK10(X0))
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f275,f219]) ).
fof(f277,plain,
! [X0] :
( ~ lt(sK10(X0),sK11(X0))
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f276,f218]) ).
fof(f841,plain,
! [X0] :
( ~ strictorderedP(X0)
| ~ ssList(sK14(X0))
| ~ ssList(sK13(X0))
| ~ ssList(sK12(X0))
| ~ ssItem(sK11(X0))
| ~ ssItem(sK10(X0))
| lt(sK10(X0),sK11(X0))
| ~ ssList(X0)
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(superposition,[],[f259,f223]) ).
fof(f846,plain,
! [X0] :
( ~ strictorderedP(X0)
| ~ ssList(sK14(X0))
| ~ ssList(sK13(X0))
| ~ ssList(sK12(X0))
| ~ ssItem(sK11(X0))
| ~ ssItem(sK10(X0))
| lt(sK10(X0),sK11(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(duplicate_literal_removal,[],[f841]) ).
fof(f850,plain,
! [X0] :
( ~ strictorderedP(X0)
| ~ ssList(sK14(X0))
| ~ ssList(sK13(X0))
| ~ ssList(sK12(X0))
| ~ ssItem(sK11(X0))
| ~ ssItem(sK10(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(forward_subsumption_resolution,[],[f846,f277]) ).
fof(f861,plain,
! [X0] :
( ~ strictorderedP(X0)
| ~ ssList(sK13(X0))
| ~ ssList(sK12(X0))
| ~ ssItem(sK11(X0))
| ~ ssItem(sK10(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(forward_subsumption_resolution,[],[f850,f222]) ).
fof(f868,plain,
! [X0] :
( ~ strictorderedP(X0)
| ~ ssList(sK12(X0))
| ~ ssItem(sK11(X0))
| ~ ssItem(sK10(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(forward_subsumption_resolution,[],[f861,f221]) ).
fof(f869,plain,
! [X0] :
( ~ strictorderedP(X0)
| ~ ssItem(sK11(X0))
| ~ ssItem(sK10(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(forward_subsumption_resolution,[],[f868,f220]) ).
fof(f870,plain,
! [X0] :
( ~ strictorderedP(X0)
| ~ ssItem(sK10(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(forward_subsumption_resolution,[],[f869,f219]) ).
fof(f871,plain,
! [X0] :
( totalorderedP(X0)
| ~ ssList(X0)
| ~ strictorderedP(X0) ),
inference(forward_subsumption_resolution,[],[f870,f218]) ).
fof(f997,plain,
( ~ ssList(sK2)
| ~ strictorderedP(sK2) ),
inference(resolution,[],[f871,f248]) ).
fof(f1002,plain,
~ strictorderedP(sK2),
inference(forward_subsumption_resolution,[],[f997,f167]) ).
fof(f1003,plain,
$false,
inference(forward_subsumption_resolution,[],[f1002,f173]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC274+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.20 % Computer : n004.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Mon Sep 28 08:48:52 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.24 Running first-order theorem proving
% 0.09/0.24 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
% 2.92/1.10 % (214812)Detected formulas, will run a generic FOF schedule.
% 2.92/1.10 % (214817)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=3259758567:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.92/1.10 % (214821)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3510792970:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.92/1.10 % (214819)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=2529787969:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.92/1.10 % (214818)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=202320505:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.92/1.10 % (214820)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1412975395:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.92/1.10 % (214822)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4150790311:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.92/1.10 % (214823)dis-21_1_sil=8000:lcm=predicate:random_seed=654399423:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.92/1.10 % (214821)First to succeed.
% 2.92/1.10 % (214821)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-214812"
% 2.92/1.10 % (214820)Instruction limit reached!
% 2.92/1.10 % (214820)------------------------------
% 2.92/1.10 % (214820)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.92/1.10 % (214820)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.10 % (214820)CaDiCaL version: 2.1.3
% 2.92/1.10 % (214820)Termination reason: Instruction limit
% 2.92/1.10 % (214820)Termination phase: Saturation
% 2.92/1.10 % (214820)Time elapsed: 0.068 s
% 2.92/1.10 % (214820)Peak memory usage: 89 MB
% 2.92/1.10 % (214820)Instructions burned: 109 (million)
% 2.92/1.10 % (214822)Also succeeded, but the first one will report.
% 2.92/1.10 % (214823)Instruction limit reached!
% 2.92/1.10 % (214823)------------------------------
% 2.92/1.10 % (214823)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.92/1.10 % (214823)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.10 % (214823)CaDiCaL version: 2.1.3
% 2.92/1.10 % (214823)Termination reason: Instruction limit
% 2.92/1.10 % (214823)Termination phase: Saturation
% 2.92/1.10 % (214823)Time elapsed: 0.069 s
% 2.92/1.10 % (214823)Peak memory usage: 91 MB
% 2.92/1.10 % (214823)Instructions burned: 130 (million)
% 2.92/1.10 % (214831)lrs+10_1_sil=8000:sp=occurrence:random_seed=3882038802:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.92/1.10 % (214832)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1416659229:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.92/1.10 % (214821)Refutation found. Thanks to Tanya!
% 2.92/1.10 % SZS status Theorem for theBenchmark
% 2.92/1.10 % SZS output start Proof for theBenchmark
% See solution above
% 3.51/1.29 % (214821)------------------------------
% 3.51/1.29 % (214821)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.51/1.29 % (214821)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.51/1.29 % (214821)CaDiCaL version: 2.1.3
% 3.51/1.29 % (214821)Termination reason: Refutation
% 3.51/1.29 % (214821)Time elapsed: 0.022 s
% 3.51/1.29 % (214821)Peak memory usage: 89 MB
% 3.51/1.29 % (214821)Instructions burned: 35 (million)
% 3.51/1.29 % (214821)------------------------------
% 3.51/1.29 % (214821)------------------------------
% 3.51/1.29 % (214812)Success in time 0.415 s
% 3.51/1.29 % Vampire exiting
%------------------------------------------------------------------------------