TSTP Solution File: SWC046+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC046+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:11:01 EDT 2024
% Result : Theorem 7.80s 1.71s
% Output : CNFRefutation 7.80s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f657)
% Comments :
%------------------------------------------------------------------------------
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax38) ).
fof(f75,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ? [X1] :
( hd(X0) = X1
& ssItem(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax75) ).
fof(f76,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ? [X1] :
( tl(X0) = X1
& ssList(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax76) ).
fof(f78,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> cons(hd(X0),tl(X0)) = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax78) ).
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] :
( ssList(X3)
=> ( ? [X4] :
( ( ( ( ? [X5] :
( segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
& ssList(X5) )
| ~ memberP(X3,X4) )
& memberP(X2,X4) )
| ( memberP(X3,X4)
& ! [X5] :
( ssList(X5)
=> ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil))) )
& ~ memberP(X2,X4) ) )
& ssItem(X4) )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ( ( ( ? [X5] :
( segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
& ssList(X5) )
| ~ memberP(X3,X4) )
& memberP(X2,X4) )
| ( memberP(X3,X4)
& ! [X5] :
( ssList(X5)
=> ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil))) )
& ~ memberP(X2,X4) ) )
& ssItem(X4) )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ( ( ( ? [X5] :
( segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
& ssList(X5) )
| ~ memberP(X3,X4) )
& memberP(X2,X4) )
| ( memberP(X3,X4)
& ! [X6] :
( ssList(X6)
=> ~ segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil))) )
& ~ memberP(X2,X4) ) )
& ssItem(X4) )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f149,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f187,plain,
! [X0] :
( ? [X1] :
( hd(X0) = X1
& ssItem(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f75]) ).
fof(f188,plain,
! [X0] :
( ? [X1] :
( hd(X0) = X1
& ssItem(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f187]) ).
fof(f189,plain,
! [X0] :
( ? [X1] :
( tl(X0) = X1
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f76]) ).
fof(f190,plain,
! [X0] :
( ? [X1] :
( tl(X0) = X1
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f189]) ).
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(f202,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ( ( ( ! [X5] :
( ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
| ~ ssList(X5) )
& memberP(X3,X4) )
| ~ memberP(X2,X4) )
& ( ~ memberP(X3,X4)
| ? [X6] :
( segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f223,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ( ( ( ! [X5] :
( ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
| ~ ssList(X5) )
& memberP(X3,X4) )
| ~ memberP(X2,X4) )
& ( ~ memberP(X3,X4)
| ? [X6] :
( segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f222]) ).
fof(f336,plain,
! [X0] :
( ? [X1] :
( hd(X0) = X1
& ssItem(X1) )
=> ( hd(X0) = sK51(X0)
& ssItem(sK51(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f337,plain,
! [X0] :
( ( hd(X0) = sK51(X0)
& ssItem(sK51(X0)) )
| nil = X0
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK51])],[f188,f336]) ).
fof(f338,plain,
! [X0] :
( ? [X1] :
( tl(X0) = X1
& ssList(X1) )
=> ( tl(X0) = sK52(X0)
& ssList(sK52(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f339,plain,
! [X0] :
( ( tl(X0) = sK52(X0)
& ssList(sK52(X0)) )
| nil = X0
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK52])],[f190,f338]) ).
fof(f344,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ( ( ( ! [X5] :
( ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
| ~ ssList(X5) )
& memberP(X3,X4) )
| ~ memberP(X2,X4) )
& ( ~ memberP(X3,X4)
| ? [X6] :
( segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ( ( ( ! [X5] :
( ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
| ~ ssList(X5) )
& memberP(X3,X4) )
| ~ memberP(X2,X4) )
& ( ~ memberP(X3,X4)
| ? [X6] :
( segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& nil != sK53
& sK53 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ( ( ( ! [X5] :
( ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
| ~ ssList(X5) )
& memberP(X3,X4) )
| ~ memberP(X2,X4) )
& ( ~ memberP(X3,X4)
| ? [X6] :
( segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& nil != sK53
& sK53 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ! [X4] :
( ( ( ( ! [X5] :
( ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
| ~ ssList(X5) )
& memberP(X3,X4) )
| ~ memberP(X2,X4) )
& ( ~ memberP(X3,X4)
| ? [X6] :
( segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& nil != sK53
& sK53 = X2
& sK54 = X3
& nil = sK54
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ( ( ( ! [X5] :
( ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
| ~ ssList(X5) )
& memberP(X3,X4) )
| ~ memberP(X2,X4) )
& ( ~ memberP(X3,X4)
| ? [X6] :
( segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& nil != sK53
& sK53 = X2
& sK54 = X3
& nil = sK54
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ! [X4] :
( ( ( ( ! [X5] :
( ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
| ~ ssList(X5) )
& memberP(X3,X4) )
| ~ memberP(sK55,X4) )
& ( ~ memberP(X3,X4)
| ? [X6] :
( segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
| memberP(sK55,X4) ) )
| ~ ssItem(X4) )
& nil != sK53
& sK53 = sK55
& sK54 = X3
& nil = sK54
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X3] :
( ! [X4] :
( ( ( ( ! [X5] :
( ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
| ~ ssList(X5) )
& memberP(X3,X4) )
| ~ memberP(sK55,X4) )
& ( ~ memberP(X3,X4)
| ? [X6] :
( segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
| memberP(sK55,X4) ) )
| ~ ssItem(X4) )
& nil != sK53
& sK53 = sK55
& sK54 = X3
& nil = sK54
& ssList(X3) )
=> ( ! [X4] :
( ( ( ( ! [X5] :
( ~ segmentP(sK56,app(app(cons(X4,nil),X5),cons(X4,nil)))
| ~ ssList(X5) )
& memberP(sK56,X4) )
| ~ memberP(sK55,X4) )
& ( ~ memberP(sK56,X4)
| ? [X6] :
( segmentP(sK56,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
| memberP(sK55,X4) ) )
| ~ ssItem(X4) )
& nil != sK53
& sK53 = sK55
& sK54 = sK56
& nil = sK54
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
! [X4] :
( ? [X6] :
( segmentP(sK56,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
=> ( segmentP(sK56,app(app(cons(X4,nil),sK57(X4)),cons(X4,nil)))
& ssList(sK57(X4)) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
( ! [X4] :
( ( ( ( ! [X5] :
( ~ segmentP(sK56,app(app(cons(X4,nil),X5),cons(X4,nil)))
| ~ ssList(X5) )
& memberP(sK56,X4) )
| ~ memberP(sK55,X4) )
& ( ~ memberP(sK56,X4)
| ( segmentP(sK56,app(app(cons(X4,nil),sK57(X4)),cons(X4,nil)))
& ssList(sK57(X4)) )
| memberP(sK55,X4) ) )
| ~ ssItem(X4) )
& nil != sK53
& sK53 = sK55
& sK54 = sK56
& nil = sK54
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57])],[f223,f348,f347,f346,f345,f344]) ).
fof(f472,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f149]) ).
fof(f522,plain,
! [X0] :
( ssItem(sK51(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f337]) ).
fof(f523,plain,
! [X0] :
( hd(X0) = sK51(X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f337]) ).
fof(f524,plain,
! [X0] :
( ssList(sK52(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f339]) ).
fof(f525,plain,
! [X0] :
( tl(X0) = sK52(X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f339]) ).
fof(f527,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f194]) ).
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,
nil = sK54,
inference(cnf_transformation,[],[f349]) ).
fof(f554,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f349]) ).
fof(f555,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f349]) ).
fof(f556,plain,
nil != sK53,
inference(cnf_transformation,[],[f349]) ).
fof(f559,plain,
! [X4] :
( memberP(sK56,X4)
| ~ memberP(sK55,X4)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f349]) ).
fof(f560,plain,
! [X4,X5] :
( ~ segmentP(sK56,app(app(cons(X4,nil),X5),cons(X4,nil)))
| ~ ssList(X5)
| ~ memberP(sK55,X4)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f349]) ).
fof(f561,plain,
nil = sK56,
inference(definition_unfolding,[],[f553,f554]) ).
fof(f572,plain,
! [X0] :
( ~ memberP(sK56,X0)
| ~ ssItem(X0) ),
inference(definition_unfolding,[],[f472,f561]) ).
fof(f607,plain,
! [X0] :
( hd(X0) = sK51(X0)
| sK56 = X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f523,f561]) ).
fof(f608,plain,
! [X0] :
( ssItem(sK51(X0))
| sK56 = X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f522,f561]) ).
fof(f609,plain,
! [X0] :
( tl(X0) = sK52(X0)
| sK56 = X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f525,f561]) ).
fof(f610,plain,
! [X0] :
( ssList(sK52(X0))
| sK56 = X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f524,f561]) ).
fof(f612,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| sK56 = X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f527,f561]) ).
fof(f617,plain,
! [X0] :
( app(X0,sK56) = X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f535,f561]) ).
fof(f620,plain,
! [X4,X5] :
( ~ segmentP(sK56,app(app(cons(X4,sK56),X5),cons(X4,sK56)))
| ~ ssList(X5)
| ~ memberP(sK55,X4)
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f560,f561,f561]) ).
fof(f622,plain,
sK55 != sK56,
inference(definition_unfolding,[],[f556,f561,f555]) ).
fof(f623,plain,
ssList(sK56),
inference(definition_unfolding,[],[f550,f554]) ).
fof(f624,plain,
ssList(sK55),
inference(definition_unfolding,[],[f549,f555]) ).
cnf(c_169,plain,
( ~ ssItem(X0)
| ~ ssList(X1)
| memberP(cons(X0,X1),X0) ),
inference(cnf_transformation,[],[f655]) ).
cnf(c_171,negated_conjecture,
( ~ memberP(sK56,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f572]) ).
cnf(c_219,negated_conjecture,
( ~ ssList(X0)
| hd(X0) = sK51(X0)
| X0 = sK56 ),
inference(cnf_transformation,[],[f607]) ).
cnf(c_220,negated_conjecture,
( ~ ssList(X0)
| X0 = sK56
| ssItem(sK51(X0)) ),
inference(cnf_transformation,[],[f608]) ).
cnf(c_221,negated_conjecture,
( ~ ssList(X0)
| tl(X0) = sK52(X0)
| X0 = sK56 ),
inference(cnf_transformation,[],[f609]) ).
cnf(c_222,negated_conjecture,
( ~ ssList(X0)
| X0 = sK56
| ssList(sK52(X0)) ),
inference(cnf_transformation,[],[f610]) ).
cnf(c_224,negated_conjecture,
( ~ ssList(X0)
| cons(hd(X0),tl(X0)) = X0
| X0 = sK56 ),
inference(cnf_transformation,[],[f612]) ).
cnf(c_229,negated_conjecture,
( ~ ssList(sK56)
| app(sK56,sK56) = sK56 ),
inference(cnf_transformation,[],[f657]) ).
cnf(c_232,negated_conjecture,
( ~ ssList(X0)
| app(X0,sK56) = X0 ),
inference(cnf_transformation,[],[f617]) ).
cnf(c_246,negated_conjecture,
( ~ segmentP(sK56,app(app(cons(X0,sK56),X1),cons(X0,sK56)))
| ~ memberP(sK55,X0)
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f620]) ).
cnf(c_247,negated_conjecture,
( ~ memberP(sK55,X0)
| ~ ssItem(X0)
| memberP(sK56,X0) ),
inference(cnf_transformation,[],[f559]) ).
cnf(c_250,negated_conjecture,
sK56 != sK55,
inference(cnf_transformation,[],[f622]) ).
cnf(c_253,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f623]) ).
cnf(c_254,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f624]) ).
cnf(c_295,plain,
( ~ ssList(sK56)
| app(sK56,sK56) = sK56 ),
inference(instantiation,[status(thm)],[c_232]) ).
cnf(c_369,negated_conjecture,
app(sK56,sK56) = sK56,
inference(global_subsumption_just,[status(thm)],[c_229,c_253,c_295]) ).
cnf(c_371,plain,
( ~ ssItem(X0)
| ~ memberP(sK55,X0) ),
inference(global_subsumption_just,[status(thm)],[c_247,c_171,c_247]) ).
cnf(c_372,negated_conjecture,
( ~ memberP(sK55,X0)
| ~ ssItem(X0) ),
inference(renaming,[status(thm)],[c_371]) ).
cnf(c_388,plain,
( ~ ssItem(X0)
| ~ memberP(sK55,X0) ),
inference(global_subsumption_just,[status(thm)],[c_246,c_372]) ).
cnf(c_389,negated_conjecture,
( ~ memberP(sK55,X0)
| ~ ssItem(X0) ),
inference(renaming,[status(thm)],[c_388]) ).
cnf(c_8795,plain,
app(sK56,sK56) = sP0_iProver_def,
definition ).
cnf(c_8796,negated_conjecture,
( ~ memberP(sK55,X0)
| ~ ssItem(X0) ),
inference(demodulation,[status(thm)],[c_389]) ).
cnf(c_8797,negated_conjecture,
sP0_iProver_def = sK56,
inference(demodulation,[status(thm)],[c_369,c_8795]) ).
cnf(c_8801,negated_conjecture,
ssList(sK55),
inference(demodulation,[status(thm)],[c_254]) ).
cnf(c_8802,negated_conjecture,
sK56 != sK55,
inference(demodulation,[status(thm)],[c_250]) ).
cnf(c_8809,negated_conjecture,
( ~ ssList(X0)
| cons(hd(X0),tl(X0)) = X0
| X0 = sK56 ),
inference(demodulation,[status(thm)],[c_224]) ).
cnf(c_8811,negated_conjecture,
( ~ ssList(X0)
| X0 = sK56
| ssList(sK52(X0)) ),
inference(demodulation,[status(thm)],[c_222]) ).
cnf(c_8812,negated_conjecture,
( ~ ssList(X0)
| tl(X0) = sK52(X0)
| X0 = sK56 ),
inference(demodulation,[status(thm)],[c_221]) ).
cnf(c_8813,negated_conjecture,
( ~ ssList(X0)
| X0 = sK56
| ssItem(sK51(X0)) ),
inference(demodulation,[status(thm)],[c_220]) ).
cnf(c_8814,negated_conjecture,
( ~ ssList(X0)
| hd(X0) = sK51(X0)
| X0 = sK56 ),
inference(demodulation,[status(thm)],[c_219]) ).
cnf(c_11651,plain,
sK55 != sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_8802,c_8797]) ).
cnf(c_11773,plain,
( ~ ssList(X0)
| X0 = sP0_iProver_def
| ssList(sK52(X0)) ),
inference(light_normalisation,[status(thm)],[c_8811,c_8797]) ).
cnf(c_11790,plain,
( ~ ssList(X0)
| X0 = sP0_iProver_def
| ssItem(sK51(X0)) ),
inference(light_normalisation,[status(thm)],[c_8813,c_8797]) ).
cnf(c_11933,plain,
( ~ ssList(X0)
| tl(X0) = sK52(X0)
| X0 = sP0_iProver_def ),
inference(light_normalisation,[status(thm)],[c_8812,c_8797]) ).
cnf(c_11952,plain,
( tl(sK55) = sK52(sK55)
| sK55 = sP0_iProver_def ),
inference(superposition,[status(thm)],[c_8801,c_11933]) ).
cnf(c_11954,plain,
tl(sK55) = sK52(sK55),
inference(forward_subsumption_resolution,[status(thm)],[c_11952,c_11651]) ).
cnf(c_11997,plain,
( ~ ssList(X0)
| hd(X0) = sK51(X0)
| X0 = sP0_iProver_def ),
inference(light_normalisation,[status(thm)],[c_8814,c_8797]) ).
cnf(c_12016,plain,
( hd(sK55) = sK51(sK55)
| sK55 = sP0_iProver_def ),
inference(superposition,[status(thm)],[c_8801,c_11997]) ).
cnf(c_12018,plain,
hd(sK55) = sK51(sK55),
inference(forward_subsumption_resolution,[status(thm)],[c_12016,c_11651]) ).
cnf(c_12090,plain,
( ~ ssList(sK55)
| sK55 = sP0_iProver_def
| ssList(tl(sK55)) ),
inference(superposition,[status(thm)],[c_11954,c_11773]) ).
cnf(c_12091,plain,
ssList(tl(sK55)),
inference(forward_subsumption_resolution,[status(thm)],[c_12090,c_11651,c_8801]) ).
cnf(c_12106,plain,
( ~ ssList(X0)
| cons(hd(X0),tl(X0)) = X0
| X0 = sP0_iProver_def ),
inference(light_normalisation,[status(thm)],[c_8809,c_8797]) ).
cnf(c_12125,plain,
( cons(hd(sK55),tl(sK55)) = sK55
| sK55 = sP0_iProver_def ),
inference(superposition,[status(thm)],[c_8801,c_12106]) ).
cnf(c_12127,plain,
cons(hd(sK55),tl(sK55)) = sK55,
inference(forward_subsumption_resolution,[status(thm)],[c_12125,c_11651]) ).
cnf(c_12327,plain,
( ~ ssList(sK55)
| sK55 = sP0_iProver_def
| ssItem(hd(sK55)) ),
inference(superposition,[status(thm)],[c_12018,c_11790]) ).
cnf(c_12328,plain,
ssItem(hd(sK55)),
inference(forward_subsumption_resolution,[status(thm)],[c_12327,c_11651,c_8801]) ).
cnf(c_14156,plain,
( ~ ssItem(hd(sK55))
| ~ ssList(tl(sK55))
| memberP(sK55,hd(sK55)) ),
inference(superposition,[status(thm)],[c_12127,c_169]) ).
cnf(c_14163,plain,
memberP(sK55,hd(sK55)),
inference(forward_subsumption_resolution,[status(thm)],[c_14156,c_12091,c_12328]) ).
cnf(c_14288,plain,
~ ssItem(hd(sK55)),
inference(superposition,[status(thm)],[c_14163,c_8796]) ).
cnf(c_14289,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_14288,c_12328]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC046+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n029.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu May 2 23:43:37 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/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
% 7.80/1.71 % SZS status Started for theBenchmark.p
% 7.80/1.71 % SZS status Theorem for theBenchmark.p
% 7.80/1.71
% 7.80/1.71 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.80/1.71
% 7.80/1.71 ------ iProver source info
% 7.80/1.71
% 7.80/1.71 git: date: 2024-05-02 19:28:25 +0000
% 7.80/1.71 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 7.80/1.71 git: non_committed_changes: false
% 7.80/1.71
% 7.80/1.71 ------ Parsing...
% 7.80/1.71 ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.80/1.71
% 7.80/1.71 ------ 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: 4 0s sf_e pe_s pe_e
% 7.80/1.71
% 7.80/1.71 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.80/1.71
% 7.80/1.71 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.80/1.71 ------ Proving...
% 7.80/1.71 ------ Problem Properties
% 7.80/1.71
% 7.80/1.71
% 7.80/1.71 clauses 184
% 7.80/1.71 conjectures 51
% 7.80/1.71 EPR 53
% 7.80/1.71 Horn 116
% 7.80/1.71 unary 19
% 7.80/1.71 binary 41
% 7.80/1.71 lits 623
% 7.80/1.71 lits eq 80
% 7.80/1.71 fd_pure 0
% 7.80/1.71 fd_pseudo 0
% 7.80/1.71 fd_cond 21
% 7.80/1.71 fd_pseudo_cond 14
% 7.80/1.71 AC symbols 0
% 7.80/1.71
% 7.80/1.71 ------ Schedule dynamic 5 is on
% 7.80/1.71
% 7.80/1.71 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 7.80/1.71
% 7.80/1.71
% 7.80/1.71 ------
% 7.80/1.71 Current options:
% 7.80/1.71 ------
% 7.80/1.71
% 7.80/1.71
% 7.80/1.71
% 7.80/1.71
% 7.80/1.71 ------ Proving...
% 7.80/1.71
% 7.80/1.71
% 7.80/1.71 % SZS status Theorem for theBenchmark.p
% 7.80/1.71
% 7.80/1.71 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.80/1.71
% 7.80/1.71
%------------------------------------------------------------------------------