%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC271+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 : n008.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:13 PM UTC 2026
% Result : Theorem 0.85s 0.96s
% Output : Refutation 2.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 4
% Syntax : Number of formulae : 50 ( 7 unt; 0 def)
% Number of atoms : 367 ( 37 equ)
% Maximal formula atoms : 17 ( 7 avg)
% Number of connectives : 522 ( 205 ~; 202 |; 83 &)
% ( 8 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 10 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 4 con; 0-2 aty)
% Number of variables : 152 ( 122 !; 30 ?)
% 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
| ~ frontsegP(X3,X2)
| ~ strictorderedP(X2)
| ? [X4] :
( ssList(X4)
& neq(X2,X4)
& frontsegP(X3,X4)
& segmentP(X4,X2)
& strictorderedP(X4) )
| totalorderedP(X0) ) ) ) ) ),
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
| ~ frontsegP(X3,X2)
| ~ strictorderedP(X2)
| ? [X4] :
( ssList(X4)
& neq(X2,X4)
& frontsegP(X3,X4)
& segmentP(X4,X2)
& strictorderedP(X4) )
| totalorderedP(X0) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& frontsegP(X3,X2)
& strictorderedP(X2)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X2,X4)
| ~ frontsegP(X3,X4)
| ~ segmentP(X4,X2)
| ~ strictorderedP(X4) )
& ~ totalorderedP(X0)
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& frontsegP(X3,X2)
& strictorderedP(X2)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X2,X4)
| ~ frontsegP(X3,X4)
| ~ segmentP(X4,X2)
| ~ strictorderedP(X4) )
& ~ totalorderedP(X0)
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f125,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(f126,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,[],[f125]) ).
fof(f129,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(f130,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,[],[f129]) ).
fof(f161,plain,
! [X0] :
( ! [X1] :
( ( lt(X0,X1)
<=> ( X0 != X1
& leq(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f93]) ).
fof(f171,plain,
( sK1 = sK3
& sK0 = sK2
& frontsegP(sK3,sK2)
& strictorderedP(sK2)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(sK2,X4)
| ~ frontsegP(sK3,X4)
| ~ segmentP(X4,sK2)
| ~ strictorderedP(X4) )
& ~ totalorderedP(sK0)
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f99]) ).
fof(f186,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,[],[f126]) ).
fof(f187,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,[],[f186]) ).
fof(f188,plain,
! [X0] :
( ( ( totalorderedP(X0)
| ( ~ leq(sK7(X0),sK8(X0))
& app(app(sK9(X0),cons(sK7(X0),sK10(X0))),cons(sK8(X0),sK11(X0))) = X0
& ssList(sK11(X0))
& ssList(sK10(X0))
& ssList(sK9(X0))
& ssItem(sK8(X0))
& ssItem(sK7(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,[sK7,sK8,sK9,sK10,sK11]),skolemize(X1,sK7(X0)),skolemize(X2,sK8(X0)),skolemize(X3,sK9(X0)),skolemize(X4,sK10(X0)),skolemize(X5,sK11(X0))],[f187]) ).
fof(f191,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,[],[f130]) ).
fof(f192,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,[],[f191]) ).
fof(f193,plain,
! [X0] :
( ( ( strictorderedP(X0)
| ( ~ lt(sK12(X0),sK13(X0))
& app(app(sK14(X0),cons(sK12(X0),sK15(X0))),cons(sK13(X0),sK16(X0))) = X0
& ssList(sK16(X0))
& ssList(sK15(X0))
& ssList(sK14(X0))
& ssItem(sK13(X0))
& ssItem(sK12(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,[sK12,sK13,sK14,sK15,sK16]),skolemize(X1,sK12(X0)),skolemize(X2,sK13(X0)),skolemize(X3,sK14(X0)),skolemize(X4,sK15(X0)),skolemize(X5,sK16(X0))],[f192]) ).
fof(f199,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,[],[f161]) ).
fof(f200,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,[],[f199]) ).
fof(f203,plain,
ssList(sK2),
inference(cnf_transformation,[],[f171]) ).
fof(f205,plain,
~ totalorderedP(sK0),
inference(cnf_transformation,[],[f171]) ).
fof(f207,plain,
strictorderedP(sK2),
inference(cnf_transformation,[],[f171]) ).
fof(f209,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f171]) ).
fof(f247,plain,
! [X0] :
( ssItem(sK7(X0))
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f188]) ).
fof(f248,plain,
! [X0] :
( ssItem(sK8(X0))
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f188]) ).
fof(f249,plain,
! [X0] :
( ssList(sK9(X0))
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f188]) ).
fof(f250,plain,
! [X0] :
( ssList(sK10(X0))
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f188]) ).
fof(f251,plain,
! [X0] :
( ssList(sK11(X0))
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f188]) ).
fof(f252,plain,
! [X0] :
( app(app(sK9(X0),cons(sK7(X0),sK10(X0))),cons(sK8(X0),sK11(X0))) = X0
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f188]) ).
fof(f253,plain,
! [X0] :
( ~ leq(sK7(X0),sK8(X0))
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f188]) ).
fof(f261,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,[],[f193]) ).
fof(f300,plain,
! [X0,X1] :
( leq(X0,X1)
| ~ lt(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f200]) ).
fof(f308,plain,
~ totalorderedP(sK2),
inference(definition_unfolding,[],[f205,f209]) ).
fof(f323,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,[],[f261]) ).
fof(f370,plain,
! [X0] :
( ~ lt(sK7(X0),sK8(X0))
| ~ ssItem(sK8(X0))
| ~ ssItem(sK7(X0))
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(resolution,[],[f300,f253]) ).
fof(f371,plain,
! [X0] :
( ~ lt(sK7(X0),sK8(X0))
| ~ ssItem(sK7(X0))
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f370,f248]) ).
fof(f372,plain,
! [X0] :
( ~ lt(sK7(X0),sK8(X0))
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f371,f247]) ).
fof(f1507,plain,
! [X0] :
( ~ strictorderedP(X0)
| ~ ssList(sK11(X0))
| ~ ssList(sK10(X0))
| ~ ssList(sK9(X0))
| ~ ssItem(sK8(X0))
| ~ ssItem(sK7(X0))
| lt(sK7(X0),sK8(X0))
| ~ ssList(X0)
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(superposition,[],[f323,f252]) ).
fof(f1512,plain,
! [X0] :
( ~ strictorderedP(X0)
| ~ ssList(sK11(X0))
| ~ ssList(sK10(X0))
| ~ ssList(sK9(X0))
| ~ ssItem(sK8(X0))
| ~ ssItem(sK7(X0))
| lt(sK7(X0),sK8(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(duplicate_literal_removal,[],[f1507]) ).
fof(f1516,plain,
! [X0] :
( ~ strictorderedP(X0)
| ~ ssList(sK11(X0))
| ~ ssList(sK10(X0))
| ~ ssList(sK9(X0))
| ~ ssItem(sK8(X0))
| ~ ssItem(sK7(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(forward_subsumption_resolution,[],[f1512,f372]) ).
fof(f1527,plain,
! [X0] :
( ~ strictorderedP(X0)
| ~ ssList(sK10(X0))
| ~ ssList(sK9(X0))
| ~ ssItem(sK8(X0))
| ~ ssItem(sK7(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(forward_subsumption_resolution,[],[f1516,f251]) ).
fof(f1534,plain,
! [X0] :
( ~ strictorderedP(X0)
| ~ ssList(sK9(X0))
| ~ ssItem(sK8(X0))
| ~ ssItem(sK7(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(forward_subsumption_resolution,[],[f1527,f250]) ).
fof(f1535,plain,
! [X0] :
( ~ strictorderedP(X0)
| ~ ssItem(sK8(X0))
| ~ ssItem(sK7(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(forward_subsumption_resolution,[],[f1534,f249]) ).
fof(f1536,plain,
! [X0] :
( ~ strictorderedP(X0)
| ~ ssItem(sK7(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(forward_subsumption_resolution,[],[f1535,f248]) ).
fof(f1537,plain,
! [X0] :
( totalorderedP(X0)
| ~ ssList(X0)
| ~ strictorderedP(X0) ),
inference(forward_subsumption_resolution,[],[f1536,f247]) ).
fof(f1665,plain,
( ~ ssList(sK2)
| ~ strictorderedP(sK2) ),
inference(resolution,[],[f1537,f308]) ).
fof(f1670,plain,
~ strictorderedP(sK2),
inference(forward_subsumption_resolution,[],[f1665,f203]) ).
fof(f1671,plain,
$false,
inference(forward_subsumption_resolution,[],[f1670,f207]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC271+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.08/0.20 % Computer : n008.cluster.edu
% 0.08/0.20 % Model : x86_64 x86_64
% 0.08/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20 % Memory : 8046.5625MB
% 0.08/0.20 % OS : Linux 6.8.0-71-generic
% 0.08/0.20 % CPULimit : 300
% 0.08/0.20 % WCLimit : 300
% 0.08/0.20 % DateTime : Mon Sep 28 08:49:10 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.24 Running first-order theorem proving
% 0.08/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
% 0.85/0.96 % (2106750)Detected formulas, will run a generic FOF schedule.
% 0.85/0.96 % (2106759)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1429668560:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.85/0.96 % (2106759)First to succeed.
% 0.85/0.96 % (2106759)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2106750"
% 0.85/0.96 % (2106760)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3375986382:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.85/0.96 % (2106755)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=1240729152:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.85/0.96 % (2106756)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=1984261190:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.85/0.96 % (2106757)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=3880975908:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.85/0.96 % (2106758)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2099308857:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.85/0.96 % (2106761)dis-21_1_sil=8000:lcm=predicate:random_seed=1633336616: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)
% 0.85/0.96 % (2106758)Instruction limit reached!
% 0.85/0.96 % (2106758)------------------------------
% 0.85/0.96 % (2106758)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.85/0.96 % (2106758)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.85/0.96 % (2106758)CaDiCaL version: 2.1.3
% 0.85/0.96 % (2106758)Termination reason: Instruction limit
% 0.85/0.96 % (2106758)Termination phase: Saturation
% 0.85/0.96 % (2106758)Time elapsed: 0.065 s
% 0.85/0.96 % (2106758)Peak memory usage: 89 MB
% 0.85/0.96 % (2106758)Instructions burned: 109 (million)
% 0.85/0.96 % (2106761)Instruction limit reached!
% 0.85/0.96 % (2106761)------------------------------
% 0.85/0.96 % (2106761)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.85/0.96 % (2106761)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.85/0.96 % (2106761)CaDiCaL version: 2.1.3
% 0.85/0.96 % (2106761)Termination reason: Instruction limit
% 0.85/0.96 % (2106761)Termination phase: Saturation
% 0.85/0.96 % (2106761)Time elapsed: 0.074 s
% 0.85/0.96 % (2106761)Peak memory usage: 90 MB
% 0.85/0.96 % (2106761)Instructions burned: 130 (million)
% 0.85/0.96 % (2106760)Instruction limit reached!
% 0.85/0.96 % (2106760)------------------------------
% 0.85/0.96 % (2106760)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.85/0.96 % (2106760)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.85/0.96 % (2106760)CaDiCaL version: 2.1.3
% 0.85/0.96 % (2106760)Termination reason: Instruction limit
% 0.85/0.96 % (2106760)Termination phase: Saturation
% 0.85/0.96 % (2106760)Time elapsed: 0.094 s
% 0.85/0.96 % (2106760)Peak memory usage: 90 MB
% 0.85/0.96 % (2106760)Instructions burned: 140 (million)
% 0.85/0.96 % (2106759)Refutation found. Thanks to Tanya!
% 0.85/0.96 % SZS status Theorem for theBenchmark
% 0.85/0.96 % SZS output start Proof for theBenchmark
% See solution above
% 2.68/1.15 % (2106759)------------------------------
% 2.68/1.15 % (2106759)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.68/1.15 % (2106759)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.68/1.15 % (2106759)CaDiCaL version: 2.1.3
% 2.68/1.15 % (2106759)Termination reason: Refutation
% 2.68/1.15 % (2106759)Time elapsed: 0.019 s
% 2.68/1.15 % (2106759)Peak memory usage: 89 MB
% 2.68/1.15 % (2106759)Instructions burned: 60 (million)
% 2.68/1.15 % (2106759)------------------------------
% 2.68/1.15 % (2106759)------------------------------
% 2.68/1.15 % (2106750)Success in time 0.284 s
% 2.68/1.15 % Vampire exiting
%------------------------------------------------------------------------------