TSTP Solution File: SWC075+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC075+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n007.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 : Thu Aug 31 20:40:47 EDT 2023
% Result : Theorem 9.90s 2.14s
% Output : CNFRefutation 9.90s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f597)
% 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/sandbox/benchmark/theBenchmark.p',ax7) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax28) ).
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 = X0
& nil = X1 )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( app(X6,X5) != X2
| app(X5,X6) != X3
| ~ ssList(X6) ) )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& 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 = X0
& nil = X1 )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( app(X6,X5) != X2
| app(X5,X6) != X3
| ~ ssList(X6) ) )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& 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 = X0
& nil = X1 )
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( app(X5,X4) != X2
| app(X4,X5) != X3
| ~ ssList(X5) ) )
| ? [X6] :
( segmentP(X0,X6)
& segmentP(X1,X6)
& neq(X6,nil)
& ssList(X6) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f104,plain,
! [X0] :
( ! [X1] :
( ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f119,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f135,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f202,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X0
| nil != X1 )
& ? [X4] :
( ? [X5] :
( app(X5,X4) = X2
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X6] :
( ~ segmentP(X0,X6)
| ~ segmentP(X1,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f253,plain,
! [X0] :
( ! [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) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f104]) ).
fof(f254,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f253]) ).
fof(f255,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( app(app(sK13(X0,X1),X1),X5) = X0
& ssList(X5) )
& ssList(sK13(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f256,plain,
! [X0,X1] :
( ? [X5] :
( app(app(sK13(X0,X1),X1),X5) = X0
& ssList(X5) )
=> ( app(app(sK13(X0,X1),X1),sK14(X0,X1)) = X0
& ssList(sK14(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f257,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ( app(app(sK13(X0,X1),X1),sK14(X0,X1)) = X0
& ssList(sK14(X0,X1))
& ssList(sK13(X0,X1)) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13,sK14])],[f254,f256,f255]) ).
fof(f316,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f119]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X0
| nil != X1 )
& ? [X4] :
( ? [X5] :
( app(X5,X4) = X2
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X6] :
( ~ segmentP(X0,X6)
| ~ segmentP(X1,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != sK53
| nil != X1 )
& ? [X4] :
( ? [X5] :
( app(X5,X4) = X2
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X6] :
( ~ segmentP(sK53,X6)
| ~ segmentP(X1,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != sK53
| nil != X1 )
& ? [X4] :
( ? [X5] :
( app(X5,X4) = X2
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X6] :
( ~ segmentP(sK53,X6)
| ~ segmentP(X1,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( nil != sK53
| nil != sK54 )
& ? [X4] :
( ? [X5] :
( app(X5,X4) = X2
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X6] :
( ~ segmentP(sK53,X6)
| ~ segmentP(sK54,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ( nil != sK53
| nil != sK54 )
& ? [X4] :
( ? [X5] :
( app(X5,X4) = X2
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X6] :
( ~ segmentP(sK53,X6)
| ~ segmentP(sK54,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( nil != sK53
| nil != sK54 )
& ? [X4] :
( ? [X5] :
( app(X5,X4) = sK55
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X6] :
( ~ segmentP(sK53,X6)
| ~ segmentP(sK54,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ( nil != sK53
| nil != sK54 )
& ? [X4] :
( ? [X5] :
( app(X5,X4) = sK55
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X6] :
( ~ segmentP(sK53,X6)
| ~ segmentP(sK54,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( nil != sK53
| nil != sK54 )
& ? [X4] :
( ? [X5] :
( app(X5,X4) = sK55
& app(X4,X5) = sK56
& ssList(X5) )
& ssList(X4) )
& ! [X6] :
( ~ segmentP(sK53,X6)
| ~ segmentP(sK54,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X4] :
( ? [X5] :
( app(X5,X4) = sK55
& app(X4,X5) = sK56
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( sK55 = app(X5,sK57)
& sK56 = app(sK57,X5)
& ssList(X5) )
& ssList(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ? [X5] :
( sK55 = app(X5,sK57)
& sK56 = app(sK57,X5)
& ssList(X5) )
=> ( sK55 = app(sK58,sK57)
& sK56 = app(sK57,sK58)
& ssList(sK58) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
( ( nil != sK53
| nil != sK54 )
& sK55 = app(sK58,sK57)
& sK56 = app(sK57,sK58)
& ssList(sK58)
& ssList(sK57)
& ! [X6] :
( ~ segmentP(sK53,X6)
| ~ segmentP(sK54,X6)
| ~ neq(X6,nil)
| ~ 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,sK57,sK58])],[f222,f348,f347,f346,f345,f344,f343]) ).
fof(f371,plain,
! [X2,X3,X0,X1] :
( segmentP(X0,X1)
| app(app(X2,X1),X3) != X0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f257]) ).
fof(f440,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f316]) ).
fof(f442,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f456,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f135]) ).
fof(f535,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f202]) ).
fof(f549,plain,
ssList(sK53),
inference(cnf_transformation,[],[f349]) ).
fof(f550,plain,
ssList(sK54),
inference(cnf_transformation,[],[f349]) ).
fof(f553,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f349]) ).
fof(f554,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f349]) ).
fof(f555,plain,
! [X6] :
( ~ segmentP(sK53,X6)
| ~ segmentP(sK54,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) ),
inference(cnf_transformation,[],[f349]) ).
fof(f556,plain,
ssList(sK57),
inference(cnf_transformation,[],[f349]) ).
fof(f557,plain,
ssList(sK58),
inference(cnf_transformation,[],[f349]) ).
fof(f558,plain,
sK56 = app(sK57,sK58),
inference(cnf_transformation,[],[f349]) ).
fof(f559,plain,
sK55 = app(sK58,sK57),
inference(cnf_transformation,[],[f349]) ).
fof(f560,plain,
( nil != sK53
| nil != sK54 ),
inference(cnf_transformation,[],[f349]) ).
fof(f561,plain,
( nil != sK55
| nil != sK56 ),
inference(definition_unfolding,[],[f560,f554,f553]) ).
fof(f562,plain,
! [X6] :
( ~ segmentP(sK55,X6)
| ~ segmentP(sK56,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) ),
inference(definition_unfolding,[],[f555,f554,f553]) ).
fof(f563,plain,
ssList(sK56),
inference(definition_unfolding,[],[f550,f553]) ).
fof(f564,plain,
ssList(sK55),
inference(definition_unfolding,[],[f549,f554]) ).
fof(f570,plain,
! [X2,X3,X1] :
( segmentP(app(app(X2,X1),X3),X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(app(X2,X1),X3)) ),
inference(equality_resolution,[],[f371]) ).
cnf(c_67,plain,
( ~ ssList(app(app(X0,X1),X2))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| segmentP(app(app(X0,X1),X2),X1) ),
inference(cnf_transformation,[],[f570]) ).
cnf(c_138,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f440]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f442]) ).
cnf(c_155,plain,
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f456]) ).
cnf(c_229,plain,
( ~ ssList(nil)
| app(nil,nil) = nil ),
inference(cnf_transformation,[],[f597]) ).
cnf(c_232,plain,
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f535]) ).
cnf(c_246,negated_conjecture,
( nil != sK55
| nil != sK56 ),
inference(cnf_transformation,[],[f561]) ).
cnf(c_247,negated_conjecture,
app(sK58,sK57) = sK55,
inference(cnf_transformation,[],[f559]) ).
cnf(c_248,negated_conjecture,
app(sK57,sK58) = sK56,
inference(cnf_transformation,[],[f558]) ).
cnf(c_249,negated_conjecture,
ssList(sK58),
inference(cnf_transformation,[],[f557]) ).
cnf(c_250,negated_conjecture,
ssList(sK57),
inference(cnf_transformation,[],[f556]) ).
cnf(c_251,negated_conjecture,
( ~ neq(X0,nil)
| ~ segmentP(sK55,X0)
| ~ segmentP(sK56,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f562]) ).
cnf(c_254,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f563]) ).
cnf(c_255,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f564]) ).
cnf(c_296,plain,
( ~ ssList(nil)
| app(nil,nil) = nil ),
inference(instantiation,[status(thm)],[c_232]) ).
cnf(c_368,plain,
app(nil,nil) = nil,
inference(global_subsumption_just,[status(thm)],[c_229,c_141,c_296]) ).
cnf(c_3227,plain,
( X0 != X1
| X2 != nil
| ~ segmentP(sK55,X1)
| ~ segmentP(sK56,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| X0 = X2 ),
inference(resolution_lifted,[status(thm)],[c_138,c_251]) ).
cnf(c_3228,plain,
( ~ segmentP(sK55,X0)
| ~ segmentP(sK56,X0)
| ~ ssList(X0)
| ~ ssList(nil)
| X0 = nil ),
inference(unflattening,[status(thm)],[c_3227]) ).
cnf(c_3230,plain,
( ~ ssList(X0)
| ~ segmentP(sK56,X0)
| ~ segmentP(sK55,X0)
| X0 = nil ),
inference(global_subsumption_just,[status(thm)],[c_3228,c_141,c_3228]) ).
cnf(c_3231,plain,
( ~ segmentP(sK55,X0)
| ~ segmentP(sK56,X0)
| ~ ssList(X0)
| X0 = nil ),
inference(renaming,[status(thm)],[c_3230]) ).
cnf(c_12023,plain,
app(nil,sK58) = sK58,
inference(superposition,[status(thm)],[c_249,c_155]) ).
cnf(c_12024,plain,
app(nil,sK57) = sK57,
inference(superposition,[status(thm)],[c_250,c_155]) ).
cnf(c_12026,plain,
app(nil,sK55) = sK55,
inference(superposition,[status(thm)],[c_255,c_155]) ).
cnf(c_12110,plain,
app(sK56,nil) = sK56,
inference(superposition,[status(thm)],[c_254,c_232]) ).
cnf(c_12111,plain,
app(sK55,nil) = sK55,
inference(superposition,[status(thm)],[c_255,c_232]) ).
cnf(c_27281,plain,
( ~ ssList(app(app(sK57,sK58),X0))
| ~ ssList(X0)
| ~ ssList(sK58)
| ~ ssList(sK57)
| segmentP(app(sK56,X0),sK58) ),
inference(superposition,[status(thm)],[c_248,c_67]) ).
cnf(c_27284,plain,
( ~ ssList(app(app(nil,sK58),X0))
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(sK58)
| segmentP(app(sK58,X0),sK58) ),
inference(superposition,[status(thm)],[c_12023,c_67]) ).
cnf(c_27285,plain,
( ~ ssList(app(app(nil,sK57),X0))
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(sK57)
| segmentP(app(sK57,X0),sK57) ),
inference(superposition,[status(thm)],[c_12024,c_67]) ).
cnf(c_27287,plain,
( ~ ssList(app(app(nil,sK55),X0))
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(sK55)
| segmentP(app(sK55,X0),sK55) ),
inference(superposition,[status(thm)],[c_12026,c_67]) ).
cnf(c_27361,plain,
( ~ ssList(app(sK55,X0))
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(sK55)
| segmentP(app(sK55,X0),sK55) ),
inference(light_normalisation,[status(thm)],[c_27287,c_12026]) ).
cnf(c_27362,plain,
( ~ ssList(app(sK55,X0))
| ~ ssList(X0)
| segmentP(app(sK55,X0),sK55) ),
inference(forward_subsumption_resolution,[status(thm)],[c_27361,c_255,c_141]) ).
cnf(c_27371,plain,
( ~ ssList(app(sK57,X0))
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(sK57)
| segmentP(app(sK57,X0),sK57) ),
inference(light_normalisation,[status(thm)],[c_27285,c_12024]) ).
cnf(c_27372,plain,
( ~ ssList(app(sK57,X0))
| ~ ssList(X0)
| segmentP(app(sK57,X0),sK57) ),
inference(forward_subsumption_resolution,[status(thm)],[c_27371,c_250,c_141]) ).
cnf(c_27376,plain,
( ~ ssList(app(sK58,X0))
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(sK58)
| segmentP(app(sK58,X0),sK58) ),
inference(light_normalisation,[status(thm)],[c_27284,c_12023]) ).
cnf(c_27377,plain,
( ~ ssList(app(sK58,X0))
| ~ ssList(X0)
| segmentP(app(sK58,X0),sK58) ),
inference(forward_subsumption_resolution,[status(thm)],[c_27376,c_249,c_141]) ).
cnf(c_27381,plain,
( ~ ssList(app(sK56,X0))
| ~ ssList(X0)
| ~ ssList(sK58)
| ~ ssList(sK57)
| segmentP(app(sK56,X0),sK58) ),
inference(light_normalisation,[status(thm)],[c_27281,c_248]) ).
cnf(c_27382,plain,
( ~ ssList(app(sK56,X0))
| ~ ssList(X0)
| segmentP(app(sK56,X0),sK58) ),
inference(forward_subsumption_resolution,[status(thm)],[c_27381,c_250,c_249]) ).
cnf(c_28239,plain,
( ~ ssList(app(sK55,nil))
| ~ ssList(nil)
| segmentP(sK55,sK55) ),
inference(superposition,[status(thm)],[c_12111,c_27362]) ).
cnf(c_28244,plain,
( ~ ssList(nil)
| ~ ssList(sK55)
| segmentP(sK55,sK55) ),
inference(light_normalisation,[status(thm)],[c_28239,c_12111]) ).
cnf(c_28245,plain,
segmentP(sK55,sK55),
inference(forward_subsumption_resolution,[status(thm)],[c_28244,c_255,c_141]) ).
cnf(c_29652,plain,
( ~ ssList(app(sK57,sK58))
| ~ ssList(sK58)
| segmentP(sK56,sK57) ),
inference(superposition,[status(thm)],[c_248,c_27372]) ).
cnf(c_29661,plain,
( ~ ssList(sK56)
| ~ ssList(sK58)
| segmentP(sK56,sK57) ),
inference(light_normalisation,[status(thm)],[c_29652,c_248]) ).
cnf(c_29662,plain,
segmentP(sK56,sK57),
inference(forward_subsumption_resolution,[status(thm)],[c_29661,c_249,c_254]) ).
cnf(c_29686,plain,
( ~ segmentP(sK55,sK57)
| ~ ssList(sK57)
| nil = sK57 ),
inference(superposition,[status(thm)],[c_29662,c_3231]) ).
cnf(c_29687,plain,
( ~ segmentP(sK55,sK57)
| nil = sK57 ),
inference(forward_subsumption_resolution,[status(thm)],[c_29686,c_250]) ).
cnf(c_31726,plain,
( ~ ssList(app(sK58,sK57))
| ~ ssList(sK57)
| segmentP(sK55,sK58) ),
inference(superposition,[status(thm)],[c_247,c_27377]) ).
cnf(c_31735,plain,
( ~ ssList(sK55)
| ~ ssList(sK57)
| segmentP(sK55,sK58) ),
inference(light_normalisation,[status(thm)],[c_31726,c_247]) ).
cnf(c_31736,plain,
segmentP(sK55,sK58),
inference(forward_subsumption_resolution,[status(thm)],[c_31735,c_250,c_255]) ).
cnf(c_33319,plain,
( ~ ssList(app(sK56,nil))
| ~ ssList(nil)
| segmentP(sK56,sK58) ),
inference(superposition,[status(thm)],[c_12110,c_27382]) ).
cnf(c_33324,plain,
( ~ ssList(nil)
| ~ ssList(sK56)
| segmentP(sK56,sK58) ),
inference(light_normalisation,[status(thm)],[c_33319,c_12110]) ).
cnf(c_33325,plain,
segmentP(sK56,sK58),
inference(forward_subsumption_resolution,[status(thm)],[c_33324,c_254,c_141]) ).
cnf(c_33498,plain,
( ~ segmentP(sK55,sK58)
| ~ ssList(sK58)
| nil = sK58 ),
inference(superposition,[status(thm)],[c_33325,c_3231]) ).
cnf(c_33499,plain,
nil = sK58,
inference(forward_subsumption_resolution,[status(thm)],[c_33498,c_249,c_31736]) ).
cnf(c_33560,plain,
app(sK57,nil) = sK56,
inference(demodulation,[status(thm)],[c_248,c_33499]) ).
cnf(c_33561,plain,
app(nil,sK57) = sK55,
inference(demodulation,[status(thm)],[c_247,c_33499]) ).
cnf(c_33565,plain,
sK55 = sK57,
inference(light_normalisation,[status(thm)],[c_33561,c_12024]) ).
cnf(c_33574,plain,
( ~ segmentP(sK55,sK55)
| nil = sK55 ),
inference(demodulation,[status(thm)],[c_29687,c_33565]) ).
cnf(c_33662,plain,
nil = sK55,
inference(forward_subsumption_resolution,[status(thm)],[c_33574,c_28245]) ).
cnf(c_33664,plain,
nil != sK56,
inference(backward_subsumption_resolution,[status(thm)],[c_246,c_33662]) ).
cnf(c_33805,plain,
nil = sK56,
inference(light_normalisation,[status(thm)],[c_33560,c_368,c_33565,c_33662]) ).
cnf(c_33806,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_33805,c_33664]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC075+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n007.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Aug 28 14:52:13 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 9.90/2.14 % SZS status Started for theBenchmark.p
% 9.90/2.14 % SZS status Theorem for theBenchmark.p
% 9.90/2.14
% 9.90/2.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 9.90/2.14
% 9.90/2.14 ------ iProver source info
% 9.90/2.14
% 9.90/2.14 git: date: 2023-05-31 18:12:56 +0000
% 9.90/2.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 9.90/2.14 git: non_committed_changes: false
% 9.90/2.14 git: last_make_outside_of_git: false
% 9.90/2.14
% 9.90/2.14 ------ Parsing...
% 9.90/2.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 9.90/2.14
% 9.90/2.14 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe_e
% 9.90/2.14
% 9.90/2.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 9.90/2.14
% 9.90/2.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 9.90/2.14 ------ Proving...
% 9.90/2.14 ------ Problem Properties
% 9.90/2.14
% 9.90/2.14
% 9.90/2.14 clauses 188
% 9.90/2.14 conjectures 7
% 9.90/2.14 EPR 55
% 9.90/2.14 Horn 120
% 9.90/2.14 unary 22
% 9.90/2.14 binary 41
% 9.90/2.14 lits 630
% 9.90/2.14 lits eq 83
% 9.90/2.14 fd_pure 0
% 9.90/2.14 fd_pseudo 0
% 9.90/2.14 fd_cond 22
% 9.90/2.14 fd_pseudo_cond 14
% 9.90/2.14 AC symbols 0
% 9.90/2.14
% 9.90/2.14 ------ Schedule dynamic 5 is on
% 9.90/2.14
% 9.90/2.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 9.90/2.14
% 9.90/2.14
% 9.90/2.14 ------
% 9.90/2.14 Current options:
% 9.90/2.14 ------
% 9.90/2.14
% 9.90/2.14
% 9.90/2.14
% 9.90/2.14
% 9.90/2.14 ------ Proving...
% 9.90/2.14
% 9.90/2.14
% 9.90/2.14 % SZS status Theorem for theBenchmark.p
% 9.90/2.14
% 9.90/2.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 9.90/2.14
% 9.90/2.14
%------------------------------------------------------------------------------