%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC336+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 : n013.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:21 PM UTC 2026
% Result : Theorem 14.70s 2.80s
% Output : CNFRefutation 14.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 17
% Syntax : Number of formulae : 165 ( 27 unt; 1 def)
% Number of atoms : 680 ( 160 equ)
% Maximal formula atoms : 21 ( 4 avg)
% Number of connectives : 859 ( 344 ~; 359 |; 111 &)
% ( 7 <=>; 38 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 6 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 : 19 ( 19 usr; 5 con; 0-2 aty)
% Number of variables : 281 ( 0 sgn 233 !; 48 ?; 68 :)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).
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(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f20,axiom,
! [X0] :
( ssList(X0)
=> ( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax20) ).
fof(f21,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> nil != cons(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(f53,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( ( segmentP(X1,X2)
& segmentP(X0,X1) )
=> segmentP(X0,X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax53) ).
fof(f54,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( ( segmentP(X1,X0)
& segmentP(X0,X1) )
=> X0 = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax54) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(f56,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( segmentP(X0,X1)
=> segmentP(app(app(X2,X0),X3),X1) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax56) ).
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax58) ).
fof(f65,axiom,
! [X0] :
( ssItem(X0)
=> totalorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax65) ).
fof(f66,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax66) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( totalorderedP(X0)
& segmentP(X1,X0) )
| ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ? [X8] :
( lt(X8,X4)
& memberP(X6,X8)
& ssItem(X8) )
| ? [X7] :
( lt(X4,X7)
& memberP(X5,X7)
& ssItem(X7) )
| app(app(X5,X2),X6) != X3
| cons(X4,nil) != X2
| ~ ssList(X6) ) ) ) )
| 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)
& segmentP(X1,X0) )
| ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ? [X8] :
( lt(X8,X4)
& memberP(X6,X8)
& ssItem(X8) )
| ? [X7] :
( lt(X4,X7)
& memberP(X5,X7)
& ssItem(X7) )
| app(app(X5,X2),X6) != X3
| cons(X4,nil) != X2
| ~ ssList(X6) ) ) ) )
| 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)
| ~ segmentP(X1,X0) )
& ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ! [X8] :
( ~ lt(X8,X4)
| ~ memberP(X6,X8)
| ~ ssItem(X8) )
& ! [X7] :
( ~ lt(X4,X7)
| ~ memberP(X5,X7)
| ~ ssItem(X7) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ssList(X6) ) ) ) )
& X0 = X2
& X1 = X3
& ssList(X3) ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f101,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssItem(X1)
| nil != cons(X1,X0) ) ),
inference(ennf_transformation,[],[f21]) ).
fof(f102,plain,
! [X0] :
( ~ ssList(X0)
| ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0 ),
inference(ennf_transformation,[],[f20]) ).
fof(f103,plain,
! [X0] :
( ~ ssList(X0)
| ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0 ),
inference(flattening,[],[f102]) ).
fof(f108,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(ennf_transformation,[],[f84]) ).
fof(f121,plain,
! [X0] :
( ~ ssList(X0)
| ( segmentP(nil,X0)
<=> nil = X0 ) ),
inference(ennf_transformation,[],[f58]) ).
fof(f123,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| ~ segmentP(X0,X1)
| segmentP(app(app(X2,X0),X3),X1) ) ) ) ),
inference(ennf_transformation,[],[f56]) ).
fof(f124,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| ~ segmentP(X0,X1)
| segmentP(app(app(X2,X0),X3),X1) ) ) ) ),
inference(flattening,[],[f123]) ).
fof(f125,plain,
! [X0] :
( ~ ssList(X0)
| segmentP(X0,X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f126,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ~ segmentP(X1,X0)
| ~ segmentP(X0,X1)
| X0 = X1 ) ),
inference(ennf_transformation,[],[f54]) ).
fof(f127,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ~ segmentP(X1,X0)
| ~ segmentP(X0,X1)
| X0 = X1 ) ),
inference(flattening,[],[f126]) ).
fof(f128,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ~ segmentP(X1,X2)
| ~ segmentP(X0,X1)
| segmentP(X0,X2) ) ) ),
inference(ennf_transformation,[],[f53]) ).
fof(f129,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ~ segmentP(X1,X2)
| ~ segmentP(X0,X1)
| segmentP(X0,X2) ) ) ),
inference(flattening,[],[f128]) ).
fof(f130,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) ) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f142,plain,
! [X0] :
( ~ ssItem(X0)
| totalorderedP(cons(X0,nil)) ),
inference(ennf_transformation,[],[f65]) ).
fof(f143,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(f144,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,[],[f143]) ).
fof(f173,plain,
( ssList(sK4)
& ssList(sK5)
& ssList(sK6)
& ( ~ totalorderedP(sK4)
| ~ segmentP(sK5,sK4) )
& ( ( nil = sK6
& nil = sK7 )
| sP0(sK6,sK7) )
& sK4 = sK6
& sK5 = sK7
& ssList(sK7) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7]),skolemize(X0,sK4),skolemize(X1,sK5),skolemize(X2,sK6),skolemize(X3,sK7)],[f169]) ).
fof(f175,plain,
! [X0] :
( ~ ssList(X0)
| ( cons(sK11(X0),sK10(X0)) = X0
& ssItem(sK11(X0))
& ssList(sK10(X0)) )
| nil = X0 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10,sK11]),skolemize(X1,sK10(X0)),skolemize(X2,sK11(X0))],[f103]) ).
fof(f185,plain,
! [X0] :
( ~ ssList(X0)
| ( ( ~ segmentP(nil,X0)
| nil = X0 )
& ( nil != X0
| segmentP(nil,X0) ) ) ),
inference(nnf_transformation,[],[f121]) ).
fof(f186,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ segmentP(X0,X1)
| ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) )
& ( ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) )
| segmentP(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f130]) ).
fof(f187,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ segmentP(X0,X1)
| ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) ) )
& ( ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) )
| segmentP(X0,X1) ) ) ) ),
inference(rectify,[],[f186]) ).
fof(f188,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ segmentP(X0,X1)
| ( app(app(sK14(X0,X1),X1),sK15(X0,X1)) = X0
& ssList(sK15(X0,X1))
& ssList(sK14(X0,X1)) ) )
& ( ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) )
| segmentP(X0,X1) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK14,sK15]),skolemize(X4,sK14(X0,X1)),skolemize(X5,sK15(X0,X1))],[f187]) ).
fof(f193,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,[],[f144]) ).
fof(f194,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,[],[f193]) ).
fof(f195,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(sK16(X0))
& ssItem(sK17(X0))
& ssList(sK18(X0))
& ssList(sK19(X0))
& ssList(sK20(X0))
& app(app(sK18(X0),cons(sK16(X0),sK19(X0))),cons(sK17(X0),sK20(X0))) = X0
& ~ leq(sK16(X0),sK17(X0)) )
| totalorderedP(X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK16,sK17,sK18,sK19,sK20]),skolemize(X1,sK16(X0)),skolemize(X2,sK17(X0)),skolemize(X3,sK18(X0)),skolemize(X4,sK19(X0)),skolemize(X5,sK20(X0))],[f194]) ).
fof(f205,plain,
ssList(sK4),
inference(cnf_transformation,[],[f173]) ).
fof(f206,plain,
ssList(sK5),
inference(cnf_transformation,[],[f173]) ).
fof(f208,plain,
( ~ totalorderedP(sK4)
| ~ segmentP(sK5,sK4) ),
inference(cnf_transformation,[],[f173]) ).
fof(f209,plain,
( nil = sK6
| sP0(sK6,sK7) ),
inference(cnf_transformation,[],[f173]) ).
fof(f210,plain,
( nil = sK7
| sP0(sK6,sK7) ),
inference(cnf_transformation,[],[f173]) ).
fof(f211,plain,
sK4 = sK6,
inference(cnf_transformation,[],[f173]) ).
fof(f212,plain,
sK5 = sK7,
inference(cnf_transformation,[],[f173]) ).
fof(f219,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| nil != cons(X1,X0) ),
inference(cnf_transformation,[],[f101]) ).
fof(f220,plain,
! [X0] :
( ~ ssList(X0)
| cons(sK11(X0),sK10(X0)) = X0
| nil = X0 ),
inference(cnf_transformation,[],[f175]) ).
fof(f221,plain,
! [X0] :
( ~ ssList(X0)
| ssItem(sK11(X0))
| nil = X0 ),
inference(cnf_transformation,[],[f175]) ).
fof(f222,plain,
! [X0] :
( ~ ssList(X0)
| ssList(sK10(X0))
| nil = X0 ),
inference(cnf_transformation,[],[f175]) ).
fof(f227,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f108]) ).
fof(f236,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f248,plain,
! [X0] :
( ~ ssList(X0)
| ~ segmentP(nil,X0)
| nil = X0 ),
inference(cnf_transformation,[],[f185]) ).
fof(f249,plain,
! [X0] :
( ~ ssList(X0)
| nil != X0
| segmentP(nil,X0) ),
inference(cnf_transformation,[],[f185]) ).
fof(f251,plain,
! [X2,X3,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ segmentP(X0,X1)
| segmentP(app(app(X2,X0),X3),X1) ),
inference(cnf_transformation,[],[f124]) ).
fof(f252,plain,
! [X0] :
( ~ ssList(X0)
| segmentP(X0,X0) ),
inference(cnf_transformation,[],[f125]) ).
fof(f253,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ~ segmentP(X1,X0)
| ~ segmentP(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f127]) ).
fof(f254,plain,
! [X2,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2)
| ~ segmentP(X0,X1)
| segmentP(X0,X2) ),
inference(cnf_transformation,[],[f129]) ).
fof(f258,plain,
! [X2,X3,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| app(app(X2,X1),X3) != X0
| ~ ssList(X3)
| ~ ssList(X2)
| segmentP(X0,X1) ),
inference(cnf_transformation,[],[f188]) ).
fof(f272,plain,
totalorderedP(nil),
inference(cnf_transformation,[],[f66]) ).
fof(f273,plain,
! [X0] :
( ~ ssItem(X0)
| totalorderedP(cons(X0,nil)) ),
inference(cnf_transformation,[],[f142]) ).
fof(f277,plain,
! [X0] :
( ~ ssList(X0)
| ssList(sK18(X0))
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f195]) ).
fof(f297,plain,
( ~ totalorderedP(sK6)
| ~ segmentP(sK7,sK6) ),
inference(definition_unfolding,[],[f208,f212,f211,f211]) ).
fof(f298,plain,
ssList(sK7),
inference(definition_unfolding,[],[f206,f212]) ).
fof(f299,plain,
ssList(sK6),
inference(definition_unfolding,[],[f205,f211]) ).
fof(f304,plain,
( ~ ssList(nil)
| segmentP(nil,nil) ),
inference(equality_resolution,[],[f249]) ).
fof(f305,plain,
! [X2,X3,X1] :
( ~ ssList(app(app(X2,X1),X3))
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| segmentP(app(app(X2,X1),X3),X1) ),
inference(equality_resolution,[],[f258]) ).
tcf(c_57,negated_conjecture,
( sP0(sK6,sK7)
| ( nil = sK7 ) ),
inference(cnf_transformation,[],[f210]) ).
tcf(c_58,negated_conjecture,
( sP0(sK6,sK7)
| ( nil = sK6 ) ),
inference(cnf_transformation,[],[f209]) ).
tcf(c_59,negated_conjecture,
( ~ totalorderedP(sK6)
| ~ segmentP(sK7,sK6) ),
inference(cnf_transformation,[],[f297]) ).
tcf(c_61,negated_conjecture,
ssList(sK7),
inference(cnf_transformation,[],[f298]) ).
tcf(c_62,negated_conjecture,
ssList(sK6),
inference(cnf_transformation,[],[f299]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ( cons(X0,X1) != nil ) ),
inference(cnf_transformation,[],[f219]) ).
tcf(c_69,plain,
! [X0: $i] :
( ssList(sK10(X0))
| ( X0 = nil )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f222]) ).
tcf(c_70,plain,
! [X0: $i] :
( ssItem(sK11(X0))
| ( X0 = nil )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f221]) ).
tcf(c_71,plain,
! [X0: $i] :
( ( X0 = nil )
| ( cons(sK11(X0),sK10(X0)) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f220]) ).
tcf(c_76,plain,
! [X0: $i] :
( ( app(X0,nil) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f227]) ).
tcf(c_85,plain,
ssList(nil),
inference(cnf_transformation,[],[f236]) ).
tcf(c_97,plain,
( segmentP(nil,nil)
| ~ ssList(nil) ),
inference(cnf_transformation,[],[f304]) ).
tcf(c_98,plain,
! [X0: $i] :
( ( X0 = nil )
| ~ ssList(X0)
| ~ segmentP(nil,X0) ),
inference(cnf_transformation,[],[f248]) ).
tcf(c_100,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( segmentP(app(app(X2,X0),X3),X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ segmentP(X0,X1) ),
inference(cnf_transformation,[],[f251]) ).
tcf(c_101,plain,
! [X0: $i] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f252]) ).
tcf(c_102,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0)
| ~ segmentP(X1,X0)
| ~ segmentP(X0,X1) ),
inference(cnf_transformation,[],[f253]) ).
tcf(c_103,plain,
! [X0: $i,X1: $i,X2: $i] :
( segmentP(X0,X2)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ segmentP(X1,X2)
| ~ segmentP(X0,X1) ),
inference(cnf_transformation,[],[f254]) ).
tcf(c_104,plain,
! [X0: $i,X1: $i,X2: $i] :
( segmentP(app(app(X0,X1),X2),X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(app(app(X0,X1),X2)) ),
inference(cnf_transformation,[],[f305]) ).
tcf(c_120,plain,
totalorderedP(nil),
inference(cnf_transformation,[],[f272]) ).
tcf(c_121,plain,
! [X0: $i] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f273]) ).
tcf(c_126,plain,
! [X0: $i] :
( totalorderedP(X0)
| ssList(sK18(X0))
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f277]) ).
tcf(c_146,plain,
( segmentP(nil,nil)
| ~ ssList(nil) ),
inference(instantiation,[status(thm)],[c_101]) ).
tcf(c_162,plain,
( ( nil = nil )
| ~ ssList(nil)
| ~ segmentP(nil,nil) ),
inference(instantiation,[status(thm)],[c_98]) ).
tcf(c_195,plain,
segmentP(nil,nil),
inference(global_subsumption_just,[status(thm)],[c_97,c_85,c_146]) ).
tcf(c_1656,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( segmentP(X0,X2)
| ~ segmentP(X1,X3)
| ( X2 != X3 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_1657,plain,
! [X0: $i,X1: $i] :
( totalorderedP(X0)
| ~ totalorderedP(X1)
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_3444,plain,
app(sK7,nil) = sK7,
inference(superposition,[status(thm)],[c_61,c_76]) ).
tcf(c_3445,plain,
app(sK6,nil) = sK6,
inference(superposition,[status(thm)],[c_62,c_76]) ).
tcf(c_3449,plain,
! [X0: $i] :
( totalorderedP(X0)
| ( app(sK18(X0),nil) = sK18(X0) )
| ~ ssList(X0) ),
inference(superposition,[status(thm)],[c_126,c_76]) ).
tcf(c_4172,plain,
! [X0: $i] :
( totalorderedP(sK6)
| ~ totalorderedP(X0)
| ( sK6 != X0 ) ),
inference(instantiation,[status(thm)],[c_1657]) ).
tcf(c_4173,plain,
( totalorderedP(sK6)
| ~ totalorderedP(nil)
| ( sK6 != nil ) ),
inference(instantiation,[status(thm)],[c_4172]) ).
tcf(c_5232,plain,
! [X0: $i] :
( segmentP(sK7,sK6)
| ~ ssList(sK6)
| ~ ssList(sK7)
| ~ ssList(X0)
| ~ segmentP(sK7,X0)
| ~ segmentP(X0,sK6) ),
inference(instantiation,[status(thm)],[c_103]) ).
tcf(c_5235,plain,
( segmentP(sK7,sK6)
| ~ ssList(sK6)
| ~ ssList(sK7)
| ~ ssList(nil)
| ~ segmentP(sK7,nil)
| ~ segmentP(nil,sK6) ),
inference(instantiation,[status(thm)],[c_5232]) ).
tcf(c_8156,plain,
( ( sK6 = nil )
| ( cons(sK11(sK6),sK10(sK6)) = sK6 )
| ~ ssList(sK6) ),
inference(instantiation,[status(thm)],[c_71]) ).
tcf(c_8163,plain,
( ( sK6 = nil )
| ~ ssList(sK6)
| ~ segmentP(nil,sK6) ),
inference(instantiation,[status(thm)],[c_98]) ).
tcf(c_8164,plain,
( ssItem(sK11(sK6))
| ( sK6 = nil )
| ~ ssList(sK6) ),
inference(instantiation,[status(thm)],[c_70]) ).
tcf(c_8165,plain,
( ssList(sK10(sK6))
| ( sK6 = nil )
| ~ ssList(sK6) ),
inference(instantiation,[status(thm)],[c_69]) ).
tcf(c_8537,plain,
! [X0: $i,X1: $i,X2: $i] :
( segmentP(X0,sK6)
| ~ segmentP(X1,X2)
| ( sK6 != X2 )
| ( X0 != X1 ) ),
inference(instantiation,[status(thm)],[c_1656]) ).
tcf(c_8538,plain,
( segmentP(nil,sK6)
| ~ segmentP(nil,nil)
| ( sK6 != nil )
| ( nil != nil ) ),
inference(instantiation,[status(thm)],[c_8537]) ).
tcf(c_12689,plain,
! [X0: $i,X1: $i] :
( segmentP(app(sK6,X1),X0)
| ~ ssList(sK6)
| ~ ssList(nil)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ segmentP(nil,X0) ),
inference(superposition,[status(thm)],[c_3445,c_100]) ).
tcf(c_12690,plain,
! [X0: $i,X1: $i] :
( segmentP(app(sK7,X1),X0)
| ~ ssList(sK7)
| ~ ssList(nil)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ segmentP(nil,X0) ),
inference(superposition,[status(thm)],[c_3444,c_100]) ).
tcf(c_12764,plain,
! [X0: $i,X1: $i] :
( segmentP(app(sK7,X1),X0)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ segmentP(nil,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_12690,c_61,c_85]) ).
tcf(c_12769,plain,
! [X0: $i,X1: $i] :
( segmentP(app(sK6,X1),X0)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ segmentP(nil,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_12689,c_62,c_85]) ).
tcf(c_15233,plain,
( ( nil = sK6 )
| ( cons(sK11(sK6),sK10(sK6)) = sK6 ) ),
inference(superposition,[status(thm)],[c_62,c_71]) ).
tcf(c_17040,plain,
! [X0: $i] :
( segmentP(sK7,X0)
| ~ ssList(nil)
| ~ ssList(X0)
| ~ segmentP(nil,X0) ),
inference(superposition,[status(thm)],[c_3444,c_12764]) ).
tcf(c_17044,plain,
! [X0: $i] :
( segmentP(sK7,X0)
| ~ ssList(X0)
| ~ segmentP(nil,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_17040,c_85]) ).
tcf(c_17066,plain,
( segmentP(sK7,nil)
| ~ ssList(nil)
| ~ segmentP(nil,nil) ),
inference(instantiation,[status(thm)],[c_17044]) ).
tcf(c_17144,plain,
! [X0: $i] :
( segmentP(sK6,X0)
| ~ ssList(nil)
| ~ ssList(X0)
| ~ segmentP(nil,X0) ),
inference(superposition,[status(thm)],[c_3445,c_12769]) ).
tcf(c_17148,plain,
! [X0: $i] :
( segmentP(sK6,X0)
| ~ ssList(X0)
| ~ segmentP(nil,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_17144,c_85]) ).
tcf(c_17677,plain,
( segmentP(sK6,nil)
| ~ ssList(nil) ),
inference(superposition,[status(thm)],[c_195,c_17148]) ).
tcf(c_17680,plain,
segmentP(sK6,nil),
inference(forward_subsumption_resolution,[status(thm)],[c_17677,c_85]) ).
tcf(c_17880,plain,
( ( nil = sK6 )
| ~ ssList(sK6)
| ~ ssList(nil)
| ~ segmentP(nil,sK6) ),
inference(superposition,[status(thm)],[c_17680,c_102]) ).
tcf(c_17881,plain,
( ( nil = sK6 )
| ~ segmentP(nil,sK6) ),
inference(forward_subsumption_resolution,[status(thm)],[c_17880,c_62,c_85]) ).
tcf(c_17886,plain,
~ segmentP(nil,sK6),
inference(global_subsumption_just,[status(thm)],[c_17881,c_62,c_61,c_120,c_85,c_146,c_59,c_4173,c_5235,c_8163,c_17066]) ).
tcf(c_18552,plain,
cons(sK11(sK6),sK10(sK6)) = sK6,
inference(global_subsumption_just,[status(thm)],[c_15233,c_62,c_61,c_120,c_85,c_146,c_59,c_162,c_4173,c_5235,c_8163,c_8156,c_8538,c_17066]) ).
tcf(c_18557,plain,
( ~ ssItem(sK11(sK6))
| ~ ssList(sK10(sK6))
| ( nil != sK6 ) ),
inference(superposition,[status(thm)],[c_18552,c_68]) ).
tcf(c_19658,plain,
( totalorderedP(sK6)
| ( app(sK18(sK6),nil) = sK18(sK6) ) ),
inference(superposition,[status(thm)],[c_62,c_3449]) ).
fof(f168,definition,
! [X2,X3] :
( ~ sP0(X2,X3)
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ! [X8] :
( ~ lt(X8,X4)
| ~ memberP(X6,X8)
| ~ ssItem(X8) )
& ! [X7] :
( ~ lt(X4,X7)
| ~ memberP(X5,X7)
| ~ ssItem(X7) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ssList(X6) ) ) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f169,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ totalorderedP(X0)
| ~ segmentP(X1,X0) )
& ( ( nil = X2
& nil = X3 )
| sP0(X2,X3) )
& X0 = X2
& X1 = X3
& ssList(X3) ) ) ) ),
inference(definition_folding,[],[f98,f168]) ).
fof(f170,plain,
! [X2,X3] :
( ~ sP0(X2,X3)
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ! [X8] :
( ~ lt(X8,X4)
| ~ memberP(X6,X8)
| ~ ssItem(X8) )
& ! [X7] :
( ~ lt(X4,X7)
| ~ memberP(X5,X7)
| ~ ssItem(X7) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ssList(X6) ) ) ) ),
inference(nnf_transformation,[],[f168]) ).
fof(f171,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| ? [X2] :
( ssItem(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ! [X6] :
( ~ lt(X6,X2)
| ~ memberP(X4,X6)
| ~ ssItem(X6) )
& ! [X5] :
( ~ lt(X2,X5)
| ~ memberP(X3,X5)
| ~ ssItem(X5) )
& app(app(X3,X0),X4) = X1
& cons(X2,nil) = X0
& ssList(X4) ) ) ) ),
inference(rectify,[],[f170]) ).
fof(f172,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| ( ssItem(sK1(X0,X1))
& ssList(sK2(X0,X1))
& ! [X6] :
( ~ lt(X6,sK1(X0,X1))
| ~ memberP(sK3(X0,X1),X6)
| ~ ssItem(X6) )
& ! [X5] :
( ~ lt(sK1(X0,X1),X5)
| ~ memberP(sK2(X0,X1),X5)
| ~ ssItem(X5) )
& app(app(sK2(X0,X1),X0),sK3(X0,X1)) = X1
& cons(sK1(X0,X1),nil) = X0
& ssList(sK3(X0,X1)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(X2,sK1(X0,X1)),skolemize(X3,sK2(X0,X1)),skolemize(X4,sK3(X0,X1))],[f171]) ).
fof(f198,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| ssItem(sK1(X0,X1)) ),
inference(cnf_transformation,[],[f172]) ).
fof(f199,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| ssList(sK2(X0,X1)) ),
inference(cnf_transformation,[],[f172]) ).
fof(f202,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| app(app(sK2(X0,X1),X0),sK3(X0,X1)) = X1 ),
inference(cnf_transformation,[],[f172]) ).
fof(f203,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| cons(sK1(X0,X1),nil) = X0 ),
inference(cnf_transformation,[],[f172]) ).
fof(f204,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| ssList(sK3(X0,X1)) ),
inference(cnf_transformation,[],[f172]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] :
( ssList(sK3(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f204]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i] :
( ( cons(sK1(X0,X1),nil) = X0 )
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f203]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] :
( ( app(app(sK2(X0,X1),X0),sK3(X0,X1)) = X1 )
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f202]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i] :
( ssList(sK2(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f199]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] :
( ssItem(sK1(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f198]) ).
tcf(c_1468,plain,
! [X0: $i,X1: $i] :
( ssItem(sK1(X0,X1))
| ( nil = sK6 )
| ( X1 != sK7 )
| ( X0 != sK6 ) ),
inference(resolution_lifted,[status(thm)],[c_55,c_58]) ).
tcf(c_1469,plain,
( ssItem(sK1(sK6,sK7))
| ( nil = sK6 ) ),
inference(unflattening,[status(thm)],[c_1468]) ).
tcf(c_1484,plain,
! [X0: $i,X1: $i] :
( ssList(sK2(X0,X1))
| ( nil = sK6 )
| ( X1 != sK7 )
| ( X0 != sK6 ) ),
inference(resolution_lifted,[status(thm)],[c_54,c_58]) ).
tcf(c_1485,plain,
( ssList(sK2(sK6,sK7))
| ( nil = sK6 ) ),
inference(unflattening,[status(thm)],[c_1484]) ).
tcf(c_1560,plain,
! [X0: $i,X1: $i] :
( ( nil = sK6 )
| ( app(app(sK2(X0,X1),X0),sK3(X0,X1)) = X1 )
| ( X1 != sK7 )
| ( X0 != sK6 ) ),
inference(resolution_lifted,[status(thm)],[c_51,c_58]) ).
tcf(c_1561,plain,
( ( nil = sK6 )
| ( app(app(sK2(sK6,sK7),sK6),sK3(sK6,sK7)) = sK7 ) ),
inference(unflattening,[status(thm)],[c_1560]) ).
tcf(c_1576,plain,
! [X0: $i,X1: $i] :
( ( nil = sK6 )
| ( cons(sK1(X0,X1),nil) = X0 )
| ( X1 != sK7 )
| ( X0 != sK6 ) ),
inference(resolution_lifted,[status(thm)],[c_50,c_58]) ).
tcf(c_1577,plain,
( ( nil = sK6 )
| ( cons(sK1(sK6,sK7),nil) = sK6 ) ),
inference(unflattening,[status(thm)],[c_1576]) ).
tcf(c_1584,plain,
! [X0: $i,X1: $i] :
( ( nil = sK7 )
| ( cons(sK1(X0,X1),nil) = X0 )
| ( X1 != sK7 )
| ( X0 != sK6 ) ),
inference(resolution_lifted,[status(thm)],[c_50,c_57]) ).
tcf(c_1585,plain,
( ( nil = sK7 )
| ( cons(sK1(sK6,sK7),nil) = sK6 ) ),
inference(unflattening,[status(thm)],[c_1584]) ).
tcf(c_1592,plain,
! [X0: $i,X1: $i] :
( ssList(sK3(X0,X1))
| ( nil = sK6 )
| ( X1 != sK7 )
| ( X0 != sK6 ) ),
inference(resolution_lifted,[status(thm)],[c_49,c_58]) ).
tcf(c_1593,plain,
( ssList(sK3(sK6,sK7))
| ( nil = sK6 ) ),
inference(unflattening,[status(thm)],[c_1592]) ).
tcf(c_3303,plain,
( totalorderedP(sK6)
| ( nil = sK6 )
| ~ ssItem(sK1(sK6,sK7)) ),
inference(superposition,[status(thm)],[c_1577,c_121]) ).
tcf(c_3871,plain,
( ( nil = sK7 )
| ~ ssList(nil)
| ~ ssItem(sK1(sK6,sK7))
| ( nil != sK6 ) ),
inference(superposition,[status(thm)],[c_1585,c_68]) ).
tcf(c_3875,plain,
( ( nil = sK7 )
| ~ ssItem(sK1(sK6,sK7))
| ( nil != sK6 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3871,c_85]) ).
tcf(c_19962,plain,
totalorderedP(sK6),
inference(global_subsumption_just,[status(thm)],[c_19658,c_62,c_61,c_120,c_85,c_146,c_59,c_162,c_1469,c_3303,c_4173,c_5235,c_8165,c_8164,c_8163,c_8538,c_17066,c_18557]) ).
tcf(c_19964,plain,
~ segmentP(sK7,sK6),
inference(backward_subsumption_resolution,[status(thm)],[c_59,c_19962]) ).
tcf(c_25331,plain,
nil != sK6,
inference(global_subsumption_just,[status(thm)],[c_3875,c_62,c_85,c_146,c_162,c_8165,c_8164,c_8538,c_17886,c_18557]) ).
tcf(c_25355,plain,
ssList(sK3(sK6,sK7)),
inference(backward_subsumption_resolution,[status(thm)],[c_1593,c_25331]) ).
tcf(c_25357,plain,
app(app(sK2(sK6,sK7),sK6),sK3(sK6,sK7)) = sK7,
inference(backward_subsumption_resolution,[status(thm)],[c_1561,c_25331]) ).
tcf(c_25360,plain,
ssList(sK2(sK6,sK7)),
inference(backward_subsumption_resolution,[status(thm)],[c_1485,c_25331]) ).
tcf(c_28645,plain,
( segmentP(sK7,sK6)
| ~ ssList(sK6)
| ~ ssList(sK2(sK6,sK7))
| ~ ssList(sK3(sK6,sK7))
| ~ ssList(app(app(sK2(sK6,sK7),sK6),sK3(sK6,sK7))) ),
inference(superposition,[status(thm)],[c_25357,c_104]) ).
tcf(c_28674,plain,
( segmentP(sK7,sK6)
| ~ ssList(sK6)
| ~ ssList(sK7)
| ~ ssList(sK2(sK6,sK7))
| ~ ssList(sK3(sK6,sK7)) ),
inference(light_normalisation,[status(thm)],[c_28645,c_25357]) ).
tcf(c_28675,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_28674,c_19964,c_62,c_61,c_25360,c_25355]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC336+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.35 % Computer : n013.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Thu Sep 24 17:41:06 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 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.12/0.40
% 0.12/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.40
% 0.12/0.41 % Detected problem language: tptp
% 0.12/0.42 % Proving...
% 14.70/2.80 % SZS status Started for theBenchmark.p
% 14.70/2.80 % SZS status Theorem for theBenchmark.p
% 14.70/2.80
% 14.70/2.80 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 14.70/2.80
% 14.70/2.80 % ------ iProver source info
% 14.70/2.80
% 14.70/2.80 % git: date: 2026-07-19 20:42:38 +0200
% 14.70/2.80 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 14.70/2.80 % git: non_committed_changes: false
% 14.70/2.80
% 14.70/2.80 % ------ Parsing...
% 14.70/2.80 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 14.70/2.80
% 14.70/2.80 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e %
% 14.70/2.80
% 14.70/2.80 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 14.70/2.80
% 14.70/2.80 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 14.70/2.80 % ------ Proving...
% 14.70/2.80 % ------ Problem Properties
% 14.70/2.80
% 14.70/2.80 %
% 14.70/2.80 % clauses 96
% 14.70/2.80 % conjectures 3
% 14.70/2.80 % EPR 24
% 14.70/2.80 % Horn 61
% 14.70/2.80 % unary 9
% 14.70/2.80 % binary 19
% 14.70/2.80 % lits 332
% 14.70/2.80 % lits eq 75
% 14.70/2.80 % fd_pure 0
% 14.70/2.80 % fd_pseudo 0
% 14.70/2.80 % fd_cond 16
% 14.70/2.80 % fd_pseudo_cond 9
% 14.70/2.80 % AC symbols 0
% 14.70/2.80
% 14.70/2.80 % ------ Schedule dynamic 5 is on
% 14.70/2.80
% 14.70/2.80 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 14.70/2.80
% 14.70/2.80
% 14.70/2.80 % ------
% 14.70/2.80 % Current options:
% 14.70/2.80 % ------
% 14.70/2.80
% 14.70/2.80
% 14.70/2.80 %
% 14.70/2.80
% 14.70/2.80 % ------ Proving...
% 14.70/2.80 %
% 14.70/2.80
% 14.70/2.80 % SZS status Theorem for theBenchmark.p
% 14.70/2.80
% 14.70/2.80 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 14.70/2.81
% 14.70/2.81
%------------------------------------------------------------------------------