%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC271+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n012.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 : Fri Sep 25 03:09:05 PM UTC 2026
% Result : Theorem 6.97s 1.58s
% Output : CNFRefutation 6.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 63 ( 11 unt; 0 def)
% Number of atoms : 388 ( 40 equ)
% Maximal formula atoms : 17 ( 6 avg)
% Number of connectives : 527 ( 202 ~; 210 |; 83 &)
% ( 8 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 8 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% 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 : 156 ( 0 sgn 126 !; 30 ?; 15 :)
% 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/Axioms/SWC001+0.ax',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/Axioms/SWC001+0.ax',ax12) ).
fof(f93,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ( lt(X0,X1)
<=> ( leq(X0,X1)
& X0 != X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax93) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( totalorderedP(X0)
| ? [X4] :
( strictorderedP(X4)
& segmentP(X4,X2)
& frontsegP(X3,X4)
& neq(X2,X4)
& ssList(X4) )
| ~ strictorderedP(X2)
| ~ frontsegP(X3,X2)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( totalorderedP(X0)
| ? [X4] :
( strictorderedP(X4)
& segmentP(X4,X2)
& frontsegP(X3,X4)
& neq(X2,X4)
& ssList(X4) )
| ~ strictorderedP(X2)
| ~ frontsegP(X3,X2)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ~ totalorderedP(X0)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& strictorderedP(X2)
& frontsegP(X3,X2)
& X0 = X2
& X1 = X3 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ~ totalorderedP(X0)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& strictorderedP(X2)
& frontsegP(X3,X2)
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f98]) ).
fof(f125,plain,
! [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) ) ) ) ) ) ) ),
inference(ennf_transformation,[],[f11]) ).
fof(f126,plain,
! [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) ) ) ) ) ) ) ),
inference(flattening,[],[f125]) ).
fof(f129,plain,
! [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) ) ) ) ) ) ) ),
inference(ennf_transformation,[],[f12]) ).
fof(f130,plain,
! [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) ) ) ) ) ) ) ),
inference(flattening,[],[f129]) ).
fof(f160,plain,
! [X0] :
( ~ ssItem(X0)
| ! [X1] :
( ~ ssItem(X1)
| ( lt(X0,X1)
<=> ( leq(X0,X1)
& X0 != X1 ) ) ) ),
inference(ennf_transformation,[],[f93]) ).
fof(f182,plain,
( ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ssList(sK3)
& ~ totalorderedP(sK0)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,sK2)
| ~ frontsegP(sK3,X4)
| ~ neq(sK2,X4)
| ~ ssList(X4) )
& strictorderedP(sK2)
& frontsegP(sK3,sK2)
& sK0 = sK2
& sK1 = sK3 ),
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(f198,plain,
! [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) ) ) ) ) ) )
& ( ? [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) ) ) ) ) )
| totalorderedP(X0) ) ) ),
inference(nnf_transformation,[],[f126]) ).
fof(f199,plain,
! [X0] :
( ~ ssList(X0)
| ( ( ~ totalorderedP(X0)
| ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( ~ ssList(X10)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| leq(X6,X7) ) ) ) ) ) )
& ( ? [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) ) ) ) ) )
| totalorderedP(X0) ) ) ),
inference(rectify,[],[f198]) ).
fof(f200,plain,
! [X0] :
( ~ ssList(X0)
| ( ( ~ totalorderedP(X0)
| ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( ~ ssList(X10)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| leq(X6,X7) ) ) ) ) ) )
& ( ( ssItem(sK9(X0))
& ssItem(sK10(X0))
& ssList(sK11(X0))
& ssList(sK12(X0))
& ssList(sK13(X0))
& app(app(sK11(X0),cons(sK9(X0),sK12(X0))),cons(sK10(X0),sK13(X0))) = X0
& ~ leq(sK9(X0),sK10(X0)) )
| totalorderedP(X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9,sK10,sK11,sK12,sK13]),skolemize(X1,sK9(X0)),skolemize(X2,sK10(X0)),skolemize(X3,sK11(X0)),skolemize(X4,sK12(X0)),skolemize(X5,sK13(X0))],[f199]) ).
fof(f203,plain,
! [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) ) ) ) ) ) )
& ( ? [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) ) ) ) ) )
| strictorderedP(X0) ) ) ),
inference(nnf_transformation,[],[f130]) ).
fof(f204,plain,
! [X0] :
( ~ ssList(X0)
| ( ( ~ strictorderedP(X0)
| ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( ~ ssList(X10)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| lt(X6,X7) ) ) ) ) ) )
& ( ? [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) ) ) ) ) )
| strictorderedP(X0) ) ) ),
inference(rectify,[],[f203]) ).
fof(f205,plain,
! [X0] :
( ~ ssList(X0)
| ( ( ~ strictorderedP(X0)
| ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( ~ ssList(X10)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| lt(X6,X7) ) ) ) ) ) )
& ( ( ssItem(sK14(X0))
& ssItem(sK15(X0))
& ssList(sK16(X0))
& ssList(sK17(X0))
& ssList(sK18(X0))
& app(app(sK16(X0),cons(sK14(X0),sK17(X0))),cons(sK15(X0),sK18(X0))) = X0
& ~ lt(sK14(X0),sK15(X0)) )
| strictorderedP(X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK14,sK15,sK16,sK17,sK18]),skolemize(X1,sK14(X0)),skolemize(X2,sK15(X0)),skolemize(X3,sK16(X0)),skolemize(X4,sK17(X0)),skolemize(X5,sK18(X0))],[f204]) ).
fof(f210,plain,
! [X0] :
( ~ ssItem(X0)
| ! [X1] :
( ~ ssItem(X1)
| ( ( ~ lt(X0,X1)
| ( leq(X0,X1)
& X0 != X1 ) )
& ( ~ leq(X0,X1)
| X0 = X1
| lt(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f160]) ).
fof(f211,plain,
! [X0] :
( ~ ssItem(X0)
| ! [X1] :
( ~ ssItem(X1)
| ( ( ~ lt(X0,X1)
| ( leq(X0,X1)
& X0 != X1 ) )
& ( ~ leq(X0,X1)
| X0 = X1
| lt(X0,X1) ) ) ) ),
inference(flattening,[],[f210]) ).
fof(f213,plain,
ssList(sK0),
inference(cnf_transformation,[],[f182]) ).
fof(f217,plain,
~ totalorderedP(sK0),
inference(cnf_transformation,[],[f182]) ).
fof(f219,plain,
strictorderedP(sK2),
inference(cnf_transformation,[],[f182]) ).
fof(f221,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f182]) ).
fof(f262,plain,
! [X0] :
( ~ ssList(X0)
| ssItem(sK9(X0))
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f200]) ).
fof(f263,plain,
! [X0] :
( ~ ssList(X0)
| ssItem(sK10(X0))
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f200]) ).
fof(f264,plain,
! [X0] :
( ~ ssList(X0)
| ssList(sK11(X0))
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f200]) ).
fof(f265,plain,
! [X0] :
( ~ ssList(X0)
| ssList(sK12(X0))
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f200]) ).
fof(f266,plain,
! [X0] :
( ~ ssList(X0)
| ssList(sK13(X0))
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f200]) ).
fof(f267,plain,
! [X0] :
( ~ ssList(X0)
| app(app(sK11(X0),cons(sK9(X0),sK12(X0))),cons(sK10(X0),sK13(X0))) = X0
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f200]) ).
fof(f268,plain,
! [X0] :
( ~ ssList(X0)
| ~ leq(sK9(X0),sK10(X0))
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f200]) ).
fof(f276,plain,
! [X10,X0,X8,X6,X9,X7] :
( ~ ssList(X0)
| ~ strictorderedP(X0)
| ~ ssItem(X6)
| ~ ssItem(X7)
| ~ ssList(X8)
| ~ ssList(X9)
| ~ ssList(X10)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| lt(X6,X7) ),
inference(cnf_transformation,[],[f205]) ).
fof(f311,plain,
! [X0,X1] :
( ~ ssItem(X0)
| ~ ssItem(X1)
| ~ lt(X0,X1)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f211]) ).
fof(f327,plain,
~ totalorderedP(sK2),
inference(definition_unfolding,[],[f217,f221]) ).
fof(f329,plain,
ssList(sK2),
inference(definition_unfolding,[],[f213,f221]) ).
fof(f342,plain,
! [X10,X8,X6,X9,X7] :
( ~ ssList(app(app(X8,cons(X6,X9)),cons(X7,X10)))
| ~ strictorderedP(app(app(X8,cons(X6,X9)),cons(X7,X10)))
| ~ ssItem(X6)
| ~ ssItem(X7)
| ~ ssList(X8)
| ~ ssList(X9)
| ~ ssList(X10)
| lt(X6,X7) ),
inference(equality_resolution,[],[f276]) ).
tcf(c_50,negated_conjecture,
strictorderedP(sK2),
inference(cnf_transformation,[],[f219]) ).
tcf(c_52,negated_conjecture,
~ totalorderedP(sK2),
inference(cnf_transformation,[],[f327]) ).
tcf(c_56,negated_conjecture,
ssList(sK2),
inference(cnf_transformation,[],[f329]) ).
tcf(c_94,plain,
! [X0: $i] :
( totalorderedP(X0)
| ~ ssList(X0)
| ~ leq(sK9(X0),sK10(X0)) ),
inference(cnf_transformation,[],[f268]) ).
tcf(c_95,plain,
! [X0: $i] :
( totalorderedP(X0)
| ( app(app(sK11(X0),cons(sK9(X0),sK12(X0))),cons(sK10(X0),sK13(X0))) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f267]) ).
tcf(c_96,plain,
! [X0: $i] :
( totalorderedP(X0)
| ssList(sK13(X0))
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f266]) ).
tcf(c_97,plain,
! [X0: $i] :
( totalorderedP(X0)
| ssList(sK12(X0))
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f265]) ).
tcf(c_98,plain,
! [X0: $i] :
( totalorderedP(X0)
| ssList(sK11(X0))
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f264]) ).
tcf(c_99,plain,
! [X0: $i] :
( totalorderedP(X0)
| ssItem(sK10(X0))
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f263]) ).
tcf(c_100,plain,
! [X0: $i] :
( totalorderedP(X0)
| ssItem(sK9(X0))
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f262]) ).
tcf(c_115,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( lt(X1,X3)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssList(app(app(X0,cons(X1,X2)),cons(X3,X4)))
| ~ strictorderedP(app(app(X0,cons(X1,X2)),cons(X3,X4))) ),
inference(cnf_transformation,[],[f342]) ).
tcf(c_145,plain,
! [X0: $i,X1: $i] :
( leq(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X0)
| ~ lt(X0,X1) ),
inference(cnf_transformation,[],[f311]) ).
tcf(c_5445,plain,
( totalorderedP(sK2)
| ssList(sK13(sK2))
| ~ ssList(sK2) ),
inference(instantiation,[status(thm)],[c_96]) ).
tcf(c_5446,plain,
( totalorderedP(sK2)
| ssList(sK12(sK2))
| ~ ssList(sK2) ),
inference(instantiation,[status(thm)],[c_97]) ).
tcf(c_5447,plain,
( totalorderedP(sK2)
| ssList(sK11(sK2))
| ~ ssList(sK2) ),
inference(instantiation,[status(thm)],[c_98]) ).
tcf(c_5448,plain,
( totalorderedP(sK2)
| ssItem(sK10(sK2))
| ~ ssList(sK2) ),
inference(instantiation,[status(thm)],[c_99]) ).
tcf(c_5449,plain,
( totalorderedP(sK2)
| ssItem(sK9(sK2))
| ~ ssList(sK2) ),
inference(instantiation,[status(thm)],[c_100]) ).
tcf(c_5490,plain,
( totalorderedP(sK2)
| ~ ssList(sK2)
| ~ leq(sK9(sK2),sK10(sK2)) ),
inference(instantiation,[status(thm)],[c_94]) ).
tcf(c_6310,plain,
! [X0: $i] :
( leq(sK9(sK2),X0)
| ~ ssItem(X0)
| ~ ssItem(sK9(sK2))
| ~ lt(sK9(sK2),X0) ),
inference(instantiation,[status(thm)],[c_145]) ).
tcf(c_10165,plain,
( totalorderedP(sK2)
| ( app(app(sK11(sK2),cons(sK9(sK2),sK12(sK2))),cons(sK10(sK2),sK13(sK2))) = sK2 ) ),
inference(superposition,[status(thm)],[c_56,c_95]) ).
tcf(c_10187,plain,
app(app(sK11(sK2),cons(sK9(sK2),sK12(sK2))),cons(sK10(sK2),sK13(sK2))) = sK2,
inference(forward_subsumption_resolution,[status(thm)],[c_10165,c_52]) ).
tcf(c_14260,plain,
( lt(sK9(sK2),sK10(sK2))
| ~ ssList(sK2)
| ~ ssItem(sK10(sK2))
| ~ ssItem(sK9(sK2))
| ~ ssList(sK13(sK2))
| ~ ssList(sK12(sK2))
| ~ ssList(sK11(sK2))
| ~ strictorderedP(app(app(sK11(sK2),cons(sK9(sK2),sK12(sK2))),cons(sK10(sK2),sK13(sK2)))) ),
inference(superposition,[status(thm)],[c_10187,c_115]) ).
tcf(c_14337,plain,
( lt(sK9(sK2),sK10(sK2))
| ~ ssList(sK2)
| ~ strictorderedP(sK2)
| ~ ssItem(sK10(sK2))
| ~ ssItem(sK9(sK2))
| ~ ssList(sK13(sK2))
| ~ ssList(sK12(sK2))
| ~ ssList(sK11(sK2)) ),
inference(light_normalisation,[status(thm)],[c_14260,c_10187]) ).
tcf(c_14338,plain,
( lt(sK9(sK2),sK10(sK2))
| ~ ssItem(sK10(sK2))
| ~ ssItem(sK9(sK2))
| ~ ssList(sK13(sK2))
| ~ ssList(sK12(sK2))
| ~ ssList(sK11(sK2)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_14337,c_56,c_50]) ).
tcf(c_15321,plain,
( leq(sK9(sK2),sK10(sK2))
| ~ ssItem(sK10(sK2))
| ~ ssItem(sK9(sK2))
| ~ lt(sK9(sK2),sK10(sK2)) ),
inference(instantiation,[status(thm)],[c_6310]) ).
tcf(c_15322,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_15321,c_14338,c_5490,c_5449,c_5448,c_5447,c_5446,c_5445,c_52,c_56]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWC271+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.03/0.35 % Computer : n012.cluster.edu
% 0.03/0.35 % Model : x86_64 x86_64
% 0.03/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.35 % Memory : 8046.5625MB
% 0.03/0.35 % OS : Linux 6.8.0-71-generic
% 0.03/0.35 % CPULimit : 300
% 0.03/0.35 % WCLimit : 300
% 0.03/0.35 % DateTime : Thu Sep 24 17:19:50 UTC 2026
% 0.03/0.36 % CPUTime :
% 0.03/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.03/0.38 Running first-order theorem proving
% 0.03/0.38 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/0.38
% 0.03/0.38 % ======== iProver multi-core TPTP/SMT =========
% 0.03/0.38
% 0.03/0.38 % Detected problem language: tptp
% 0.03/0.39 % Proving...
% 6.97/1.58 % SZS status Started for theBenchmark.p
% 6.97/1.58 % SZS status Theorem for theBenchmark.p
% 6.97/1.58
% 6.97/1.58 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 6.97/1.58
% 6.97/1.58 % ------ iProver source info
% 6.97/1.58
% 6.97/1.58 % git: date: 2026-07-19 20:42:38 +0200
% 6.97/1.58 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 6.97/1.58 % git: non_committed_changes: false
% 6.97/1.58
% 6.97/1.58 % ------ Parsing...
% 6.97/1.58 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 6.97/1.58
% 6.97/1.58 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 6.97/1.58
% 6.97/1.58 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 6.97/1.58
% 6.97/1.58 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 6.97/1.58 % ------ Proving...
% 6.97/1.58 % ------ Problem Properties
% 6.97/1.58
% 6.97/1.58 %
% 6.97/1.58 % clauses 100
% 6.97/1.58 % conjectures 5
% 6.97/1.58 % EPR 33
% 6.97/1.58 % Horn 68
% 6.97/1.58 % unary 14
% 6.97/1.58 % binary 10
% 6.97/1.58 % lits 353
% 6.97/1.58 % lits eq 64
% 6.97/1.58 % fd_pure 0
% 6.97/1.58 % fd_pseudo 0
% 6.97/1.58 % fd_cond 21
% 6.97/1.58 % fd_pseudo_cond 10
% 6.97/1.58 % AC symbols 0
% 6.97/1.58
% 6.97/1.58 % ------ Schedule dynamic 5 is on
% 6.97/1.58
% 6.97/1.58 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 6.97/1.58
% 6.97/1.58
% 6.97/1.58 % ------
% 6.97/1.58 % Current options:
% 6.97/1.58 % ------
% 6.97/1.58
% 6.97/1.58
% 6.97/1.58 %
% 6.97/1.58
% 6.97/1.58 % ------ Proving...
% 6.97/1.58 %
% 6.97/1.58
% 6.97/1.58 % SZS status Theorem for theBenchmark.p
% 6.97/1.58
% 6.97/1.58 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 6.97/1.58
% 6.97/1.58
%------------------------------------------------------------------------------