TSTP Solution File: SWC075+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC075+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n022.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:11:07 EDT 2024
% Result : Theorem 10.21s 2.12s
% Output : CNFRefutation 10.21s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% 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_8860,plain,
app(sK57,sK58) = sP0_iProver_def,
definition ).
cnf(c_8861,plain,
app(sK58,sK57) = sP1_iProver_def,
definition ).
cnf(c_8862,negated_conjecture,
ssList(sK55),
inference(demodulation,[status(thm)],[c_255]) ).
cnf(c_8863,negated_conjecture,
ssList(sK56),
inference(demodulation,[status(thm)],[c_254]) ).
cnf(c_8864,negated_conjecture,
ssList(sK57),
inference(demodulation,[status(thm)],[c_250]) ).
cnf(c_8865,negated_conjecture,
ssList(sK58),
inference(demodulation,[status(thm)],[c_249]) ).
cnf(c_8866,negated_conjecture,
sP0_iProver_def = sK56,
inference(demodulation,[status(thm)],[c_248,c_8860]) ).
cnf(c_8867,negated_conjecture,
sP1_iProver_def = sK55,
inference(demodulation,[status(thm)],[c_247,c_8861]) ).
cnf(c_8868,negated_conjecture,
( nil != sK55
| nil != sK56 ),
inference(demodulation,[status(thm)],[c_246]) ).
cnf(c_11696,plain,
ssList(sP1_iProver_def),
inference(light_normalisation,[status(thm)],[c_8862,c_8867]) ).
cnf(c_11697,plain,
ssList(sP0_iProver_def),
inference(light_normalisation,[status(thm)],[c_8863,c_8866]) ).
cnf(c_11698,plain,
( nil != sP0_iProver_def
| nil != sP1_iProver_def ),
inference(light_normalisation,[status(thm)],[c_8868,c_8866,c_8867]) ).
cnf(c_11701,plain,
( ~ segmentP(sP0_iProver_def,X0)
| ~ segmentP(sP1_iProver_def,X0)
| ~ ssList(X0)
| X0 = nil ),
inference(light_normalisation,[status(thm)],[c_3231,c_8866,c_8867]) ).
cnf(c_12029,plain,
app(nil,sK58) = sK58,
inference(superposition,[status(thm)],[c_8865,c_155]) ).
cnf(c_12030,plain,
app(nil,sK57) = sK57,
inference(superposition,[status(thm)],[c_8864,c_155]) ).
cnf(c_12110,plain,
app(sK57,nil) = sK57,
inference(superposition,[status(thm)],[c_8864,c_232]) ).
cnf(c_12111,plain,
app(sP1_iProver_def,nil) = sP1_iProver_def,
inference(superposition,[status(thm)],[c_11696,c_232]) ).
cnf(c_12112,plain,
app(sP0_iProver_def,nil) = sP0_iProver_def,
inference(superposition,[status(thm)],[c_11697,c_232]) ).
cnf(c_26847,plain,
( ~ ssList(app(app(sK58,sK57),X0))
| ~ ssList(X0)
| ~ ssList(sK58)
| ~ ssList(sK57)
| segmentP(app(sP1_iProver_def,X0),sK57) ),
inference(superposition,[status(thm)],[c_8861,c_67]) ).
cnf(c_26848,plain,
( ~ ssList(app(app(sK57,sK58),X0))
| ~ ssList(X0)
| ~ ssList(sK58)
| ~ ssList(sK57)
| segmentP(app(sP0_iProver_def,X0),sK58) ),
inference(superposition,[status(thm)],[c_8860,c_67]) ).
cnf(c_26851,plain,
( ~ ssList(app(app(nil,sK58),X0))
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(sK58)
| segmentP(app(sK58,X0),sK58) ),
inference(superposition,[status(thm)],[c_12029,c_67]) ).
cnf(c_26852,plain,
( ~ ssList(app(app(nil,sK57),X0))
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(sK57)
| segmentP(app(sK57,X0),sK57) ),
inference(superposition,[status(thm)],[c_12030,c_67]) ).
cnf(c_26943,plain,
( ~ ssList(app(sK57,X0))
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(sK57)
| segmentP(app(sK57,X0),sK57) ),
inference(light_normalisation,[status(thm)],[c_26852,c_12030]) ).
cnf(c_26944,plain,
( ~ ssList(app(sK57,X0))
| ~ ssList(X0)
| segmentP(app(sK57,X0),sK57) ),
inference(forward_subsumption_resolution,[status(thm)],[c_26943,c_8864,c_141]) ).
cnf(c_26948,plain,
( ~ ssList(app(sK58,X0))
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(sK58)
| segmentP(app(sK58,X0),sK58) ),
inference(light_normalisation,[status(thm)],[c_26851,c_12029]) ).
cnf(c_26949,plain,
( ~ ssList(app(sK58,X0))
| ~ ssList(X0)
| segmentP(app(sK58,X0),sK58) ),
inference(forward_subsumption_resolution,[status(thm)],[c_26948,c_8865,c_141]) ).
cnf(c_26953,plain,
( ~ ssList(app(sP0_iProver_def,X0))
| ~ ssList(X0)
| ~ ssList(sK58)
| ~ ssList(sK57)
| segmentP(app(sP0_iProver_def,X0),sK58) ),
inference(light_normalisation,[status(thm)],[c_26848,c_8860]) ).
cnf(c_26954,plain,
( ~ ssList(app(sP0_iProver_def,X0))
| ~ ssList(X0)
| segmentP(app(sP0_iProver_def,X0),sK58) ),
inference(forward_subsumption_resolution,[status(thm)],[c_26953,c_8864,c_8865]) ).
cnf(c_26958,plain,
( ~ ssList(app(sP1_iProver_def,X0))
| ~ ssList(X0)
| ~ ssList(sK58)
| ~ ssList(sK57)
| segmentP(app(sP1_iProver_def,X0),sK57) ),
inference(light_normalisation,[status(thm)],[c_26847,c_8861]) ).
cnf(c_26959,plain,
( ~ ssList(app(sP1_iProver_def,X0))
| ~ ssList(X0)
| segmentP(app(sP1_iProver_def,X0),sK57) ),
inference(forward_subsumption_resolution,[status(thm)],[c_26958,c_8864,c_8865]) ).
cnf(c_28581,plain,
( ~ ssList(app(sK57,nil))
| ~ ssList(nil)
| segmentP(sK57,sK57) ),
inference(superposition,[status(thm)],[c_12110,c_26944]) ).
cnf(c_28587,plain,
( ~ ssList(nil)
| ~ ssList(sK57)
| segmentP(sK57,sK57) ),
inference(light_normalisation,[status(thm)],[c_28581,c_12110]) ).
cnf(c_28588,plain,
segmentP(sK57,sK57),
inference(forward_subsumption_resolution,[status(thm)],[c_28587,c_8864,c_141]) ).
cnf(c_30019,plain,
( ~ ssList(app(sK58,sK57))
| ~ ssList(sK57)
| segmentP(sP1_iProver_def,sK58) ),
inference(superposition,[status(thm)],[c_8861,c_26949]) ).
cnf(c_30028,plain,
( ~ ssList(sK57)
| ~ ssList(sP1_iProver_def)
| segmentP(sP1_iProver_def,sK58) ),
inference(light_normalisation,[status(thm)],[c_30019,c_8861]) ).
cnf(c_30029,plain,
segmentP(sP1_iProver_def,sK58),
inference(forward_subsumption_resolution,[status(thm)],[c_30028,c_11696,c_8864]) ).
cnf(c_30063,plain,
( ~ segmentP(sP0_iProver_def,sK58)
| ~ ssList(sK58)
| nil = sK58 ),
inference(superposition,[status(thm)],[c_30029,c_11701]) ).
cnf(c_30064,plain,
( ~ segmentP(sP0_iProver_def,sK58)
| nil = sK58 ),
inference(forward_subsumption_resolution,[status(thm)],[c_30063,c_8865]) ).
cnf(c_31506,plain,
( ~ ssList(app(sP0_iProver_def,nil))
| ~ ssList(nil)
| segmentP(sP0_iProver_def,sK58) ),
inference(superposition,[status(thm)],[c_12112,c_26954]) ).
cnf(c_31511,plain,
( ~ ssList(nil)
| ~ ssList(sP0_iProver_def)
| segmentP(sP0_iProver_def,sK58) ),
inference(light_normalisation,[status(thm)],[c_31506,c_12112]) ).
cnf(c_31512,plain,
segmentP(sP0_iProver_def,sK58),
inference(forward_subsumption_resolution,[status(thm)],[c_31511,c_11697,c_141]) ).
cnf(c_31528,plain,
nil = sK58,
inference(backward_subsumption_resolution,[status(thm)],[c_30064,c_31512]) ).
cnf(c_31592,plain,
app(nil,sK57) = sP1_iProver_def,
inference(demodulation,[status(thm)],[c_8861,c_31528]) ).
cnf(c_31593,plain,
app(sK57,nil) = sP0_iProver_def,
inference(demodulation,[status(thm)],[c_8860,c_31528]) ).
cnf(c_31597,plain,
sK57 = sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_31593,c_12110]) ).
cnf(c_31605,plain,
segmentP(sP0_iProver_def,sP0_iProver_def),
inference(demodulation,[status(thm)],[c_28588,c_31597]) ).
cnf(c_31727,plain,
( ~ ssList(app(sP1_iProver_def,X0))
| ~ ssList(X0)
| segmentP(app(sP1_iProver_def,X0),sP0_iProver_def) ),
inference(light_normalisation,[status(thm)],[c_26959,c_31597]) ).
cnf(c_31734,plain,
( ~ ssList(app(sP1_iProver_def,nil))
| ~ ssList(nil)
| segmentP(sP1_iProver_def,sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_12111,c_31727]) ).
cnf(c_31739,plain,
( ~ ssList(nil)
| ~ ssList(sP1_iProver_def)
| segmentP(sP1_iProver_def,sP0_iProver_def) ),
inference(light_normalisation,[status(thm)],[c_31734,c_12111]) ).
cnf(c_31740,plain,
segmentP(sP1_iProver_def,sP0_iProver_def),
inference(forward_subsumption_resolution,[status(thm)],[c_31739,c_11696,c_141]) ).
cnf(c_32049,plain,
( ~ segmentP(sP0_iProver_def,sP0_iProver_def)
| ~ ssList(sP0_iProver_def)
| nil = sP0_iProver_def ),
inference(superposition,[status(thm)],[c_31740,c_11701]) ).
cnf(c_32050,plain,
nil = sP0_iProver_def,
inference(forward_subsumption_resolution,[status(thm)],[c_32049,c_11697,c_31605]) ).
cnf(c_32059,plain,
nil != sP1_iProver_def,
inference(backward_subsumption_resolution,[status(thm)],[c_11698,c_32050]) ).
cnf(c_32179,plain,
app(sP0_iProver_def,sP0_iProver_def) = sP0_iProver_def,
inference(demodulation,[status(thm)],[c_368,c_32050]) ).
cnf(c_32845,plain,
sP0_iProver_def != sP1_iProver_def,
inference(light_normalisation,[status(thm)],[c_32059,c_32050]) ).
cnf(c_32857,plain,
sP0_iProver_def = sP1_iProver_def,
inference(light_normalisation,[status(thm)],[c_31592,c_31597,c_32050,c_32179]) ).
cnf(c_32858,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_32857,c_32845]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SWC075+1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n022.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 23:17:57 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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
% 10.21/2.12 % SZS status Started for theBenchmark.p
% 10.21/2.12 % SZS status Theorem for theBenchmark.p
% 10.21/2.12
% 10.21/2.12 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 10.21/2.12
% 10.21/2.12 ------ iProver source info
% 10.21/2.12
% 10.21/2.12 git: date: 2024-05-02 19:28:25 +0000
% 10.21/2.12 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 10.21/2.12 git: non_committed_changes: false
% 10.21/2.12
% 10.21/2.12 ------ Parsing...
% 10.21/2.12 ------ Clausification by vclausify_rel & Parsing by iProver...
% 10.21/2.12
% 10.21/2.12 ------ 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
% 10.21/2.12
% 10.21/2.12 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 10.21/2.12
% 10.21/2.12 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 10.21/2.12 ------ Proving...
% 10.21/2.12 ------ Problem Properties
% 10.21/2.12
% 10.21/2.12
% 10.21/2.12 clauses 190
% 10.21/2.12 conjectures 7
% 10.21/2.12 EPR 57
% 10.21/2.12 Horn 122
% 10.21/2.12 unary 24
% 10.21/2.12 binary 41
% 10.21/2.12 lits 632
% 10.21/2.12 lits eq 85
% 10.21/2.12 fd_pure 0
% 10.21/2.12 fd_pseudo 0
% 10.21/2.12 fd_cond 22
% 10.21/2.12 fd_pseudo_cond 14
% 10.21/2.12 AC symbols 0
% 10.21/2.12
% 10.21/2.12 ------ Schedule dynamic 5 is on
% 10.21/2.12
% 10.21/2.12 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 10.21/2.12
% 10.21/2.12
% 10.21/2.12 ------
% 10.21/2.12 Current options:
% 10.21/2.12 ------
% 10.21/2.12
% 10.21/2.12
% 10.21/2.12
% 10.21/2.12
% 10.21/2.12 ------ Proving...
% 10.21/2.12
% 10.21/2.12
% 10.21/2.12 % SZS status Theorem for theBenchmark.p
% 10.21/2.12
% 10.21/2.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.21/2.12
% 10.21/2.13
%------------------------------------------------------------------------------