TSTP Solution File: SWC324+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC324+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri May 3 03:12:00 EDT 2024
% Result : Theorem 53.89s 8.29s
% Output : CNFRefutation 53.89s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f588)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f22,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssItem(hd(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax22) ).
fof(f24,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssList(tl(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax24) ).
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax58) ).
fof(f78,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> cons(hd(X0),tl(X0)) = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax78) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax81) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( nil = X3
& nil != X2 )
| ? [X6] :
( ? [X7] :
( app(cons(X6,nil),X7) = X3
& app(X7,cons(X6,nil)) != X2
& ssList(X7) )
& ssItem(X6) )
| ? [X4] :
( ? [X5] :
( app(X5,X4) = X0
& app(X4,X5) = X1
& ssList(X5) )
& ssList(X4) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( nil = X3
& nil != X2 )
| ? [X6] :
( ? [X7] :
( app(cons(X6,nil),X7) = X3
& app(X7,cons(X6,nil)) != X2
& ssList(X7) )
& ssItem(X6) )
| ? [X4] :
( ? [X5] :
( app(X5,X4) = X0
& app(X4,X5) = X1
& ssList(X5) )
& ssList(X4) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( nil = X3
& nil != X2 )
| ? [X4] :
( ? [X5] :
( app(cons(X4,nil),X5) = X3
& app(X5,cons(X4,nil)) != X2
& ssList(X5) )
& ssItem(X4) )
| ? [X6] :
( ? [X7] :
( app(X7,X6) = X0
& app(X6,X7) = X1
& ssList(X7) )
& ssList(X6) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f119,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f120,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f127,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f128,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f127]) ).
fof(f130,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f131,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f130]) ).
fof(f177,plain,
! [X0] :
( ( segmentP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f58]) ).
fof(f193,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f78]) ).
fof(f194,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f193]) ).
fof(f199,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f202,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X3
| nil = X2 )
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = X2
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X6] :
( ! [X7] :
( app(X7,X6) != X0
| app(X6,X7) != X1
| ~ ssList(X7) )
| ~ ssList(X6) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f316,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f119]) ).
fof(f330,plain,
! [X0] :
( ( ( segmentP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ segmentP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f177]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X3
| nil = X2 )
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = X2
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X6] :
( ! [X7] :
( app(X7,X6) != X0
| app(X6,X7) != X1
| ~ ssList(X7) )
| ~ ssList(X6) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X3
| nil = X2 )
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = X2
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X6] :
( ! [X7] :
( app(X7,X6) != sK53
| app(X6,X7) != X1
| ~ ssList(X7) )
| ~ ssList(X6) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X3
| nil = X2 )
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = X2
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X6] :
( ! [X7] :
( app(X7,X6) != sK53
| app(X6,X7) != X1
| ~ ssList(X7) )
| ~ ssList(X6) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( nil != X3
| nil = X2 )
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = X2
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X6] :
( ! [X7] :
( app(X7,X6) != sK53
| app(X6,X7) != sK54
| ~ ssList(X7) )
| ~ ssList(X6) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ( nil != X3
| nil = X2 )
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = X2
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X6] :
( ! [X7] :
( app(X7,X6) != sK53
| app(X6,X7) != sK54
| ~ ssList(X7) )
| ~ ssList(X6) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( nil != X3
| nil = sK55 )
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = sK55
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X6] :
( ! [X7] :
( app(X7,X6) != sK53
| app(X6,X7) != sK54
| ~ ssList(X7) )
| ~ ssList(X6) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ( nil != X3
| nil = sK55 )
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = sK55
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X6] :
( ! [X7] :
( app(X7,X6) != sK53
| app(X6,X7) != sK54
| ~ ssList(X7) )
| ~ ssList(X6) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( nil != sK56
| nil = sK55 )
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != sK56
| app(X5,cons(X4,nil)) = sK55
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X6] :
( ! [X7] :
( app(X7,X6) != sK53
| app(X6,X7) != sK54
| ~ ssList(X7) )
| ~ ssList(X6) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ( nil != sK56
| nil = sK55 )
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != sK56
| app(X5,cons(X4,nil)) = sK55
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X6] :
( ! [X7] :
( app(X7,X6) != sK53
| app(X6,X7) != sK54
| ~ ssList(X7) )
| ~ ssList(X6) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56])],[f222,f346,f345,f344,f343]) ).
fof(f438,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f316]) ).
fof(f439,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f440,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f448,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f128]) ).
fof(f450,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f131]) ).
fof(f494,plain,
! [X0] :
( nil = X0
| ~ segmentP(nil,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f330]) ).
fof(f495,plain,
! [X0] :
( segmentP(nil,X0)
| nil != X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f330]) ).
fof(f525,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f194]) ).
fof(f528,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f199]) ).
fof(f533,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f202]) ).
fof(f548,plain,
ssList(sK54),
inference(cnf_transformation,[],[f347]) ).
fof(f551,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f347]) ).
fof(f552,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f347]) ).
fof(f553,plain,
! [X6,X7] :
( app(X7,X6) != sK53
| app(X6,X7) != sK54
| ~ ssList(X7)
| ~ ssList(X6) ),
inference(cnf_transformation,[],[f347]) ).
fof(f554,plain,
! [X4,X5] :
( app(cons(X4,nil),X5) != sK56
| app(X5,cons(X4,nil)) = sK55
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f347]) ).
fof(f555,plain,
( nil != sK56
| nil = sK55 ),
inference(cnf_transformation,[],[f347]) ).
fof(f556,plain,
! [X6,X7] :
( app(X7,X6) != sK55
| app(X6,X7) != sK56
| ~ ssList(X7)
| ~ ssList(X6) ),
inference(definition_unfolding,[],[f553,f552,f551]) ).
fof(f557,plain,
ssList(sK56),
inference(definition_unfolding,[],[f548,f551]) ).
fof(f578,plain,
( segmentP(nil,nil)
| ~ ssList(nil) ),
inference(equality_resolution,[],[f495]) ).
cnf(c_138,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f438]) ).
cnf(c_139,plain,
( ~ neq(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f588]) ).
cnf(c_140,plain,
( ~ ssItem(X0)
| ~ ssList(X1)
| ssList(cons(X0,X1)) ),
inference(cnf_transformation,[],[f439]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f440]) ).
cnf(c_149,plain,
( ~ ssList(X0)
| X0 = nil
| ssItem(hd(X0)) ),
inference(cnf_transformation,[],[f448]) ).
cnf(c_151,plain,
( ~ ssList(X0)
| X0 = nil
| ssList(tl(X0)) ),
inference(cnf_transformation,[],[f450]) ).
cnf(c_195,plain,
( ~ ssList(nil)
| segmentP(nil,nil) ),
inference(cnf_transformation,[],[f578]) ).
cnf(c_196,plain,
( ~ segmentP(nil,X0)
| ~ ssList(X0)
| X0 = nil ),
inference(cnf_transformation,[],[f494]) ).
cnf(c_224,plain,
( ~ ssList(X0)
| cons(hd(X0),tl(X0)) = X0
| X0 = nil ),
inference(cnf_transformation,[],[f525]) ).
cnf(c_227,plain,
( ~ ssItem(X0)
| ~ ssList(X1)
| app(cons(X0,nil),X1) = cons(X0,X1) ),
inference(cnf_transformation,[],[f528]) ).
cnf(c_229,plain,
( ~ ssList(nil)
| app(nil,nil) = nil ),
inference(cnf_transformation,[],[f591]) ).
cnf(c_232,plain,
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f533]) ).
cnf(c_246,negated_conjecture,
( nil != sK56
| nil = sK55 ),
inference(cnf_transformation,[],[f555]) ).
cnf(c_247,negated_conjecture,
( app(cons(X0,nil),X1) != sK56
| ~ ssItem(X0)
| ~ ssList(X1)
| app(X1,cons(X0,nil)) = sK55 ),
inference(cnf_transformation,[],[f554]) ).
cnf(c_248,negated_conjecture,
( app(X0,X1) != sK55
| app(X1,X0) != sK56
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f556]) ).
cnf(c_251,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f557]) ).
cnf(c_293,plain,
( ~ ssList(nil)
| app(nil,nil) = nil ),
inference(instantiation,[status(thm)],[c_232]) ).
cnf(c_302,plain,
( ~ segmentP(nil,nil)
| ~ ssList(nil)
| nil = nil ),
inference(instantiation,[status(thm)],[c_196]) ).
cnf(c_367,plain,
app(nil,nil) = nil,
inference(global_subsumption_just,[status(thm)],[c_229,c_141,c_293]) ).
cnf(c_433,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_533,plain,
( nil != X0
| sK56 != X0
| nil = sK56 ),
inference(instantiation,[status(thm)],[c_433]) ).
cnf(c_534,plain,
( nil != nil
| sK56 != nil
| nil = sK56 ),
inference(instantiation,[status(thm)],[c_533]) ).
cnf(c_535,plain,
( app(X0,X1) != X2
| sK56 != X2
| app(X0,X1) = sK56 ),
inference(instantiation,[status(thm)],[c_433]) ).
cnf(c_1649,plain,
( ~ ssList(X0)
| ~ ssList(sK56)
| sK56 = X0
| neq(sK56,X0) ),
inference(instantiation,[status(thm)],[c_138]) ).
cnf(c_1660,plain,
( ~ ssList(sK56)
| cons(hd(sK56),tl(sK56)) = sK56
| sK56 = nil ),
inference(instantiation,[status(thm)],[c_224]) ).
cnf(c_1669,plain,
( ~ ssList(sK56)
| sK56 = nil
| ssList(tl(sK56)) ),
inference(instantiation,[status(thm)],[c_151]) ).
cnf(c_1670,plain,
( ~ ssList(sK56)
| sK56 = nil
| ssItem(hd(sK56)) ),
inference(instantiation,[status(thm)],[c_149]) ).
cnf(c_1678,plain,
( X0 != X1
| sK56 != X1
| sK56 = X0 ),
inference(instantiation,[status(thm)],[c_433]) ).
cnf(c_1834,plain,
( app(nil,nil) != sK56
| nil != sK55
| ~ ssList(nil) ),
inference(superposition,[status(thm)],[c_367,c_248]) ).
cnf(c_1835,plain,
( nil != sK55
| app(nil,nil) != sK56 ),
inference(global_subsumption_just,[status(thm)],[c_1834,c_141,c_1834]) ).
cnf(c_1836,plain,
( app(nil,nil) != sK56
| nil != sK55 ),
inference(renaming,[status(thm)],[c_1835]) ).
cnf(c_1839,plain,
( nil != sK56
| nil != sK55 ),
inference(light_normalisation,[status(thm)],[c_1836,c_367]) ).
cnf(c_1842,plain,
nil != sK56,
inference(forward_subsumption_resolution,[status(thm)],[c_1839,c_246]) ).
cnf(c_6189,plain,
( ~ ssList(sK56)
| sK56 = sK56
| neq(sK56,sK56) ),
inference(instantiation,[status(thm)],[c_1649]) ).
cnf(c_6190,plain,
( ~ neq(sK56,sK56)
| ~ ssList(sK56) ),
inference(instantiation,[status(thm)],[c_139]) ).
cnf(c_6524,plain,
( X0 != sK56
| sK56 != sK56
| sK56 = X0 ),
inference(instantiation,[status(thm)],[c_1678]) ).
cnf(c_10426,plain,
( ~ ssItem(hd(sK56))
| ~ ssList(X0)
| ssList(cons(hd(sK56),X0)) ),
inference(instantiation,[status(thm)],[c_140]) ).
cnf(c_10427,plain,
( ~ ssItem(hd(sK56))
| ~ ssList(nil)
| ssList(cons(hd(sK56),nil)) ),
inference(instantiation,[status(thm)],[c_10426]) ).
cnf(c_12454,plain,
( cons(hd(sK56),tl(sK56)) != sK56
| sK56 != sK56
| sK56 = cons(hd(sK56),tl(sK56)) ),
inference(instantiation,[status(thm)],[c_6524]) ).
cnf(c_18255,plain,
( app(X0,X1) != cons(hd(sK56),tl(sK56))
| sK56 != cons(hd(sK56),tl(sK56))
| app(X0,X1) = sK56 ),
inference(instantiation,[status(thm)],[c_535]) ).
cnf(c_20531,plain,
( app(cons(hd(sK56),nil),tl(sK56)) != cons(hd(sK56),tl(sK56))
| sK56 != cons(hd(sK56),tl(sK56))
| app(cons(hd(sK56),nil),tl(sK56)) = sK56 ),
inference(instantiation,[status(thm)],[c_18255]) ).
cnf(c_20532,plain,
( ~ ssItem(hd(sK56))
| ~ ssList(tl(sK56))
| app(cons(hd(sK56),nil),tl(sK56)) = cons(hd(sK56),tl(sK56)) ),
inference(instantiation,[status(thm)],[c_227]) ).
cnf(c_27431,plain,
( app(cons(hd(sK56),nil),tl(sK56)) != sK56
| ~ ssItem(hd(sK56))
| ~ ssList(tl(sK56))
| app(tl(sK56),cons(hd(sK56),nil)) = sK55 ),
inference(instantiation,[status(thm)],[c_247]) ).
cnf(c_27432,plain,
( app(cons(hd(sK56),nil),tl(sK56)) != sK56
| app(tl(sK56),cons(hd(sK56),nil)) != sK55
| ~ ssList(cons(hd(sK56),nil))
| ~ ssList(tl(sK56)) ),
inference(instantiation,[status(thm)],[c_248]) ).
cnf(c_27433,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_27432,c_27431,c_20532,c_20531,c_12454,c_10427,c_6190,c_6189,c_1842,c_1660,c_1669,c_1670,c_534,c_302,c_195,c_141,c_251]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWC324+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.14 % Command : run_iprover %s %d THM
% 0.15/0.35 % Computer : n029.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu May 2 23:57:22 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.22/0.48 Running first-order theorem proving
% 0.22/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 53.89/8.29 % SZS status Started for theBenchmark.p
% 53.89/8.29 % SZS status Theorem for theBenchmark.p
% 53.89/8.29
% 53.89/8.29 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 53.89/8.29
% 53.89/8.29 ------ iProver source info
% 53.89/8.29
% 53.89/8.29 git: date: 2024-05-02 19:28:25 +0000
% 53.89/8.29 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 53.89/8.29 git: non_committed_changes: false
% 53.89/8.29
% 53.89/8.29 ------ Parsing...
% 53.89/8.29 ------ Clausification by vclausify_rel & Parsing by iProver...
% 53.89/8.29
% 53.89/8.29 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 1 0s sf_e
% 53.89/8.29
% 53.89/8.29 ------ Preprocessing...
% 53.89/8.29
% 53.89/8.29 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 53.89/8.29 ------ Proving...
% 53.89/8.29 ------ Problem Properties
% 53.89/8.29
% 53.89/8.29
% 53.89/8.29 clauses 198
% 53.89/8.29 conjectures 5
% 53.89/8.29 EPR 65
% 53.89/8.29 Horn 128
% 53.89/8.29 unary 18
% 53.89/8.29 binary 49
% 53.89/8.29 lits 663
% 53.89/8.29 lits eq 86
% 53.89/8.29 fd_pure 0
% 53.89/8.29 fd_pseudo 0
% 53.89/8.29 fd_cond 21
% 53.89/8.29 fd_pseudo_cond 16
% 53.89/8.29 AC symbols 0
% 53.89/8.29
% 53.89/8.29 ------ Input Options Time Limit: Unbounded
% 53.89/8.29
% 53.89/8.29
% 53.89/8.29 ------
% 53.89/8.29 Current options:
% 53.89/8.29 ------
% 53.89/8.29
% 53.89/8.29
% 53.89/8.29
% 53.89/8.29
% 53.89/8.29 ------ Proving...
% 53.89/8.29
% 53.89/8.29
% 53.89/8.29 % SZS status Theorem for theBenchmark.p
% 53.89/8.29
% 53.89/8.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 53.89/8.29
% 53.89/8.30
%------------------------------------------------------------------------------