%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC273+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p 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 : Fri Sep 25 03:09:06 PM UTC 2026
% Result : Theorem 8.46s 1.70s
% Output : CNFRefutation 8.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 62 ( 11 unt; 0 def)
% Number of atoms : 374 ( 38 equ)
% Maximal formula atoms : 17 ( 6 avg)
% Number of connectives : 510 ( 198 ~; 208 |; 74 &)
% ( 8 <=>; 22 =>; 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 : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 4 con; 0-2 aty)
% Number of variables : 151 ( 0 sgn 125 !; 26 ?; 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/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax93) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( totalorderedP(X0)
| ? [X4] :
( strictorderedP(X4)
& segmentP(X4,X2)
& segmentP(X3,X4)
& neq(X2,X4)
& ssList(X4) )
| ~ strictorderedP(X2)
| ~ segmentP(X3,X2)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( totalorderedP(X0)
| ? [X4] :
( strictorderedP(X4)
& segmentP(X4,X2)
& segmentP(X3,X4)
& neq(X2,X4)
& ssList(X4) )
| ~ strictorderedP(X2)
| ~ segmentP(X3,X2)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ~ totalorderedP(X0)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,X2)
| ~ segmentP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& strictorderedP(X2)
& segmentP(X3,X2)
& X0 = X2
& X1 = X3
& ssList(X3) ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f113,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(f114,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,[],[f113]) ).
fof(f117,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(f118,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,[],[f117]) ).
fof(f148,plain,
! [X0] :
( ~ ssItem(X0)
| ! [X1] :
( ~ ssItem(X1)
| ( lt(X0,X1)
<=> ( leq(X0,X1)
& X0 != X1 ) ) ) ),
inference(ennf_transformation,[],[f93]) ).
fof(f170,plain,
( ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ~ totalorderedP(sK0)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,sK2)
| ~ segmentP(sK3,X4)
| ~ neq(sK2,X4)
| ~ ssList(X4) )
& strictorderedP(sK2)
& segmentP(sK3,sK2)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f98]) ).
fof(f180,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,[],[f114]) ).
fof(f181,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,[],[f180]) ).
fof(f182,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(sK8(X0))
& ssItem(sK9(X0))
& ssList(sK10(X0))
& ssList(sK11(X0))
& ssList(sK12(X0))
& app(app(sK10(X0),cons(sK8(X0),sK11(X0))),cons(sK9(X0),sK12(X0))) = X0
& ~ leq(sK8(X0),sK9(X0)) )
| totalorderedP(X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8,sK9,sK10,sK11,sK12]),skolemize(X1,sK8(X0)),skolemize(X2,sK9(X0)),skolemize(X3,sK10(X0)),skolemize(X4,sK11(X0)),skolemize(X5,sK12(X0))],[f181]) ).
fof(f185,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,[],[f118]) ).
fof(f186,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,[],[f185]) ).
fof(f187,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(sK13(X0))
& ssItem(sK14(X0))
& ssList(sK15(X0))
& ssList(sK16(X0))
& ssList(sK17(X0))
& app(app(sK15(X0),cons(sK13(X0),sK16(X0))),cons(sK14(X0),sK17(X0))) = X0
& ~ lt(sK13(X0),sK14(X0)) )
| strictorderedP(X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK13,sK14,sK15,sK16,sK17]),skolemize(X1,sK13(X0)),skolemize(X2,sK14(X0)),skolemize(X3,sK15(X0)),skolemize(X4,sK16(X0)),skolemize(X5,sK17(X0))],[f186]) ).
fof(f192,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,[],[f148]) ).
fof(f193,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,[],[f192]) ).
fof(f195,plain,
ssList(sK0),
inference(cnf_transformation,[],[f170]) ).
fof(f198,plain,
~ totalorderedP(sK0),
inference(cnf_transformation,[],[f170]) ).
fof(f200,plain,
strictorderedP(sK2),
inference(cnf_transformation,[],[f170]) ).
fof(f202,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f170]) ).
fof(f231,plain,
! [X0] :
( ~ ssList(X0)
| ssItem(sK8(X0))
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f182]) ).
fof(f232,plain,
! [X0] :
( ~ ssList(X0)
| ssItem(sK9(X0))
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f182]) ).
fof(f233,plain,
! [X0] :
( ~ ssList(X0)
| ssList(sK10(X0))
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f182]) ).
fof(f234,plain,
! [X0] :
( ~ ssList(X0)
| ssList(sK11(X0))
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f182]) ).
fof(f235,plain,
! [X0] :
( ~ ssList(X0)
| ssList(sK12(X0))
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f182]) ).
fof(f236,plain,
! [X0] :
( ~ ssList(X0)
| app(app(sK10(X0),cons(sK8(X0),sK11(X0))),cons(sK9(X0),sK12(X0))) = X0
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f182]) ).
fof(f237,plain,
! [X0] :
( ~ ssList(X0)
| ~ leq(sK8(X0),sK9(X0))
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f182]) ).
fof(f245,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,[],[f187]) ).
fof(f280,plain,
! [X0,X1] :
( ~ ssItem(X0)
| ~ ssItem(X1)
| ~ lt(X0,X1)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f193]) ).
fof(f296,plain,
~ totalorderedP(sK2),
inference(definition_unfolding,[],[f198,f202]) ).
fof(f298,plain,
ssList(sK2),
inference(definition_unfolding,[],[f195,f202]) ).
fof(f308,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,[],[f245]) ).
tcf(c_51,negated_conjecture,
strictorderedP(sK2),
inference(cnf_transformation,[],[f200]) ).
tcf(c_53,negated_conjecture,
~ totalorderedP(sK2),
inference(cnf_transformation,[],[f296]) ).
tcf(c_56,negated_conjecture,
ssList(sK2),
inference(cnf_transformation,[],[f298]) ).
tcf(c_81,plain,
! [X0: $i] :
( totalorderedP(X0)
| ~ ssList(X0)
| ~ leq(sK8(X0),sK9(X0)) ),
inference(cnf_transformation,[],[f237]) ).
tcf(c_82,plain,
! [X0: $i] :
( totalorderedP(X0)
| ( app(app(sK10(X0),cons(sK8(X0),sK11(X0))),cons(sK9(X0),sK12(X0))) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f236]) ).
tcf(c_83,plain,
! [X0: $i] :
( totalorderedP(X0)
| ssList(sK12(X0))
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f235]) ).
tcf(c_84,plain,
! [X0: $i] :
( totalorderedP(X0)
| ssList(sK11(X0))
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f234]) ).
tcf(c_85,plain,
! [X0: $i] :
( totalorderedP(X0)
| ssList(sK10(X0))
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f233]) ).
tcf(c_86,plain,
! [X0: $i] :
( totalorderedP(X0)
| ssItem(sK9(X0))
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f232]) ).
tcf(c_87,plain,
! [X0: $i] :
( totalorderedP(X0)
| ssItem(sK8(X0))
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f231]) ).
tcf(c_102,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( lt(X1,X3)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ strictorderedP(app(app(X0,cons(X1,X2)),cons(X3,X4)))
| ~ ssList(app(app(X0,cons(X1,X2)),cons(X3,X4))) ),
inference(cnf_transformation,[],[f308]) ).
tcf(c_132,plain,
! [X0: $i,X1: $i] :
( leq(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X0)
| ~ lt(X0,X1) ),
inference(cnf_transformation,[],[f280]) ).
tcf(c_4837,plain,
( totalorderedP(sK2)
| ssList(sK12(sK2))
| ~ ssList(sK2) ),
inference(instantiation,[status(thm)],[c_83]) ).
tcf(c_4838,plain,
( totalorderedP(sK2)
| ssList(sK11(sK2))
| ~ ssList(sK2) ),
inference(instantiation,[status(thm)],[c_84]) ).
tcf(c_4839,plain,
( totalorderedP(sK2)
| ssList(sK10(sK2))
| ~ ssList(sK2) ),
inference(instantiation,[status(thm)],[c_85]) ).
tcf(c_4840,plain,
( totalorderedP(sK2)
| ssItem(sK9(sK2))
| ~ ssList(sK2) ),
inference(instantiation,[status(thm)],[c_86]) ).
tcf(c_4841,plain,
( totalorderedP(sK2)
| ssItem(sK8(sK2))
| ~ ssList(sK2) ),
inference(instantiation,[status(thm)],[c_87]) ).
tcf(c_4921,plain,
( totalorderedP(sK2)
| ~ ssList(sK2)
| ~ leq(sK8(sK2),sK9(sK2)) ),
inference(instantiation,[status(thm)],[c_81]) ).
tcf(c_5639,plain,
! [X0: $i] :
( leq(sK8(sK2),X0)
| ~ ssItem(X0)
| ~ ssItem(sK8(sK2))
| ~ lt(sK8(sK2),X0) ),
inference(instantiation,[status(thm)],[c_132]) ).
tcf(c_9614,plain,
( totalorderedP(sK2)
| ( app(app(sK10(sK2),cons(sK8(sK2),sK11(sK2))),cons(sK9(sK2),sK12(sK2))) = sK2 ) ),
inference(superposition,[status(thm)],[c_56,c_82]) ).
tcf(c_9636,plain,
app(app(sK10(sK2),cons(sK8(sK2),sK11(sK2))),cons(sK9(sK2),sK12(sK2))) = sK2,
inference(forward_subsumption_resolution,[status(thm)],[c_9614,c_53]) ).
tcf(c_14499,plain,
( leq(sK8(sK2),sK9(sK2))
| ~ ssItem(sK9(sK2))
| ~ ssItem(sK8(sK2))
| ~ lt(sK8(sK2),sK9(sK2)) ),
inference(instantiation,[status(thm)],[c_5639]) ).
tcf(c_14933,plain,
( lt(sK8(sK2),sK9(sK2))
| ~ ssList(sK2)
| ~ ssItem(sK9(sK2))
| ~ ssItem(sK8(sK2))
| ~ ssList(sK12(sK2))
| ~ ssList(sK11(sK2))
| ~ ssList(sK10(sK2))
| ~ strictorderedP(app(app(sK10(sK2),cons(sK8(sK2),sK11(sK2))),cons(sK9(sK2),sK12(sK2)))) ),
inference(superposition,[status(thm)],[c_9636,c_102]) ).
tcf(c_14970,plain,
( lt(sK8(sK2),sK9(sK2))
| ~ strictorderedP(sK2)
| ~ ssList(sK2)
| ~ ssItem(sK9(sK2))
| ~ ssItem(sK8(sK2))
| ~ ssList(sK12(sK2))
| ~ ssList(sK11(sK2))
| ~ ssList(sK10(sK2)) ),
inference(light_normalisation,[status(thm)],[c_14933,c_9636]) ).
tcf(c_14971,plain,
( lt(sK8(sK2),sK9(sK2))
| ~ ssItem(sK9(sK2))
| ~ ssItem(sK8(sK2))
| ~ ssList(sK12(sK2))
| ~ ssList(sK11(sK2))
| ~ ssList(sK10(sK2)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_14970,c_51,c_56]) ).
tcf(c_15016,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_14971,c_14499,c_4921,c_4841,c_4840,c_4839,c_4838,c_4837,c_53,c_56]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC273+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.35 % Computer : n004.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Thu Sep 24 17:20:51 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.41
% 0.13/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.41
% 0.13/0.41 % Detected problem language: tptp
% 0.13/0.42 % Proving...
% 8.46/1.70 % SZS status Started for theBenchmark.p
% 8.46/1.70 % SZS status Theorem for theBenchmark.p
% 8.46/1.70
% 8.46/1.70 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 8.46/1.70
% 8.46/1.70 % ------ iProver source info
% 8.46/1.70
% 8.46/1.70 % git: date: 2026-07-19 20:42:38 +0200
% 8.46/1.70 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 8.46/1.70 % git: non_committed_changes: false
% 8.46/1.70
% 8.46/1.70 % ------ Parsing...
% 8.46/1.70 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 8.46/1.70
% 8.46/1.70 % ------ 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 %
% 8.46/1.70
% 8.46/1.70 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 8.46/1.70
% 8.46/1.70 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 8.46/1.70 % ------ Proving...
% 8.46/1.70 % ------ Problem Properties
% 8.46/1.70
% 8.46/1.70 %
% 8.46/1.70 % clauses 87
% 8.46/1.70 % conjectures 5
% 8.46/1.70 % EPR 27
% 8.46/1.70 % Horn 55
% 8.46/1.70 % unary 13
% 8.46/1.70 % binary 8
% 8.46/1.70 % lits 301
% 8.46/1.70 % lits eq 60
% 8.46/1.70 % fd_pure 0
% 8.46/1.70 % fd_pseudo 0
% 8.46/1.70 % fd_cond 20
% 8.46/1.70 % fd_pseudo_cond 8
% 8.46/1.70 % AC symbols 0
% 8.46/1.70
% 8.46/1.70 % ------ Schedule dynamic 5 is on
% 8.46/1.70
% 8.46/1.70 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 8.46/1.70
% 8.46/1.70
% 8.46/1.70 % ------
% 8.46/1.70 % Current options:
% 8.46/1.70 % ------
% 8.46/1.70
% 8.46/1.70
% 8.46/1.70 %
% 8.46/1.70
% 8.46/1.70 % ------ Proving...
% 8.46/1.70 %
% 8.46/1.70
% 8.46/1.70 % SZS status Theorem for theBenchmark.p
% 8.46/1.70
% 8.46/1.70 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 8.46/1.71
% 8.46/1.71
%------------------------------------------------------------------------------