TSTP Solution File: SWC057+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC057+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n024.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:39 EDT 2023
% Result : Theorem 9.78s 2.15s
% Output : CNFRefutation 9.78s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f595)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax5) ).
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/theBenchmark.p',ax7) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax26) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax28) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax83) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( ~ frontsegP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| ( ( ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| 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] :
( ( ( ~ frontsegP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| ( ( ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f101,plain,
! [X0] :
( ! [X1] :
( ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f103,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(f132,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f134,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f200,plain,
! [X0] :
( ! [X1] :
( ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f201,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f244,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f101]) ).
fof(f245,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f244]) ).
fof(f246,plain,
! [X0,X1] :
( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
=> ( app(X1,sK11(X0,X1)) = X0
& ssList(sK11(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f247,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ( app(X1,sK11(X0,X1)) = X0
& ssList(sK11(X0,X1)) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11])],[f245,f246]) ).
fof(f252,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,[],[f103]) ).
fof(f253,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,[],[f252]) ).
fof(f254,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(f255,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(f256,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])],[f253,f255,f254]) ).
fof(f338,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X0
| nil != X1 )
& ( ( nil = X0
& nil = X1 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f200]) ).
fof(f339,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X0
| nil != X1 )
& ( ( nil = X0
& nil = X1 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f338]) ).
fof(f342,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != sK53
& nil = X1 ) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f343,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != sK53
& nil = X1 ) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( frontsegP(X3,sK55)
& neq(sK55,nil) )
| ( nil = sK55
& nil = X3 ) )
& ( ( ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X3] :
( ( ( frontsegP(X3,sK55)
& neq(sK55,nil) )
| ( nil = sK55
& nil = X3 ) )
& ( ( ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ( frontsegP(sK56,sK55)
& neq(sK55,nil) )
| ( nil = sK55
& nil = sK56 ) )
& ( ( ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ( ( frontsegP(sK56,sK55)
& neq(sK55,nil) )
| ( nil = sK55
& nil = sK56 ) )
& ( ( ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56])],[f221,f345,f344,f343,f342]) ).
fof(f359,plain,
! [X0,X1] :
( ssList(sK11(X0,X1))
| ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f247]) ).
fof(f360,plain,
! [X0,X1] :
( app(X1,sK11(X0,X1)) = X0
| ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f247]) ).
fof(f368,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,[],[f256]) ).
fof(f439,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f451,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f453,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f134]) ).
fof(f530,plain,
! [X0,X1] :
( nil = X0
| nil != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f339]) ).
fof(f532,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f201]) ).
fof(f546,plain,
ssList(sK53),
inference(cnf_transformation,[],[f346]) ).
fof(f547,plain,
ssList(sK54),
inference(cnf_transformation,[],[f346]) ).
fof(f550,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f346]) ).
fof(f551,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f346]) ).
fof(f553,plain,
( neq(sK54,nil)
| nil != sK53 ),
inference(cnf_transformation,[],[f346]) ).
fof(f554,plain,
! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sK54 ),
inference(cnf_transformation,[],[f346]) ).
fof(f556,plain,
( neq(sK55,nil)
| nil = sK56 ),
inference(cnf_transformation,[],[f346]) ).
fof(f558,plain,
( frontsegP(sK56,sK55)
| nil = sK56 ),
inference(cnf_transformation,[],[f346]) ).
fof(f559,plain,
( frontsegP(sK56,sK55)
| nil = sK55 ),
inference(cnf_transformation,[],[f346]) ).
fof(f561,plain,
! [X4] :
( ~ segmentP(sK55,X4)
| ~ segmentP(sK56,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sK56 ),
inference(definition_unfolding,[],[f554,f551,f550,f550]) ).
fof(f562,plain,
( neq(sK56,nil)
| nil != sK55 ),
inference(definition_unfolding,[],[f553,f550,f551]) ).
fof(f564,plain,
ssList(sK56),
inference(definition_unfolding,[],[f547,f550]) ).
fof(f565,plain,
ssList(sK55),
inference(definition_unfolding,[],[f546,f551]) ).
fof(f571,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,[],[f368]) ).
cnf(c_62,plain,
( ~ frontsegP(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| app(X1,sK11(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f360]) ).
cnf(c_63,plain,
( ~ frontsegP(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ssList(sK11(X0,X1)) ),
inference(cnf_transformation,[],[f359]) ).
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,[],[f571]) ).
cnf(c_139,plain,
( ~ neq(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f595]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f439]) ).
cnf(c_153,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f451]) ).
cnf(c_155,plain,
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f453]) ).
cnf(c_230,plain,
( app(X0,X1) != nil
| ~ ssList(X0)
| ~ ssList(X1)
| X0 = nil ),
inference(cnf_transformation,[],[f530]) ).
cnf(c_232,plain,
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f532]) ).
cnf(c_246,negated_conjecture,
( nil = sK55
| frontsegP(sK56,sK55) ),
inference(cnf_transformation,[],[f559]) ).
cnf(c_247,negated_conjecture,
( nil = sK56
| frontsegP(sK56,sK55) ),
inference(cnf_transformation,[],[f558]) ).
cnf(c_249,negated_conjecture,
( nil = sK56
| neq(sK55,nil) ),
inference(cnf_transformation,[],[f556]) ).
cnf(c_251,negated_conjecture,
( ~ neq(X0,nil)
| ~ segmentP(sK56,X0)
| ~ segmentP(sK55,X0)
| ~ ssList(X0)
| nil = sK56 ),
inference(cnf_transformation,[],[f561]) ).
cnf(c_252,negated_conjecture,
( nil != sK55
| neq(sK56,nil) ),
inference(cnf_transformation,[],[f562]) ).
cnf(c_256,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f564]) ).
cnf(c_257,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f565]) ).
cnf(c_4890,plain,
( X0 != nil
| X0 != sK55
| ~ ssList(X0)
| nil = sK56 ),
inference(resolution_lifted,[status(thm)],[c_139,c_249]) ).
cnf(c_4891,plain,
( nil != sK55
| ~ ssList(nil)
| nil = sK56 ),
inference(unflattening,[status(thm)],[c_4890]) ).
cnf(c_4892,plain,
( nil != sK55
| nil = sK56 ),
inference(global_subsumption_just,[status(thm)],[c_4891,c_141,c_4891]) ).
cnf(c_4910,plain,
( X0 != nil
| X0 != sK56
| nil != sK55
| ~ ssList(X0) ),
inference(resolution_lifted,[status(thm)],[c_139,c_252]) ).
cnf(c_4911,plain,
( nil != sK56
| nil != sK55
| ~ ssList(nil) ),
inference(unflattening,[status(thm)],[c_4910]) ).
cnf(c_4912,plain,
nil != sK55,
inference(global_subsumption_just,[status(thm)],[c_4911,c_141,c_4892,c_4911]) ).
cnf(c_4921,plain,
( X0 != sK55
| nil != nil
| ~ segmentP(sK56,X0)
| ~ segmentP(sK55,X0)
| ~ ssList(X0)
| nil = sK56 ),
inference(resolution_lifted,[status(thm)],[c_249,c_251]) ).
cnf(c_4922,plain,
( ~ segmentP(sK56,sK55)
| ~ segmentP(sK55,sK55)
| ~ ssList(sK55)
| nil = sK56 ),
inference(unflattening,[status(thm)],[c_4921]) ).
cnf(c_4974,negated_conjecture,
frontsegP(sK56,sK55),
inference(global_subsumption_just,[status(thm)],[c_247,c_246,c_4912]) ).
cnf(c_16301,plain,
app(nil,sK55) = sK55,
inference(superposition,[status(thm)],[c_257,c_155]) ).
cnf(c_16383,plain,
app(sK55,nil) = sK55,
inference(superposition,[status(thm)],[c_257,c_232]) ).
cnf(c_21708,plain,
( ~ ssList(sK56)
| ~ ssList(sK55)
| app(sK55,sK11(sK56,sK55)) = sK56 ),
inference(superposition,[status(thm)],[c_4974,c_62]) ).
cnf(c_21720,plain,
app(sK55,sK11(sK56,sK55)) = sK56,
inference(forward_subsumption_resolution,[status(thm)],[c_21708,c_257,c_256]) ).
cnf(c_22054,plain,
( nil != sK56
| ~ ssList(sK11(sK56,sK55))
| ~ ssList(sK55)
| nil = sK55 ),
inference(superposition,[status(thm)],[c_21720,c_230]) ).
cnf(c_22062,plain,
( nil != sK56
| ~ ssList(sK11(sK56,sK55)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_22054,c_4912,c_257]) ).
cnf(c_29986,plain,
( ~ ssList(X0)
| ~ ssList(sK55)
| ssList(app(sK55,X0)) ),
inference(instantiation,[status(thm)],[c_153]) ).
cnf(c_31293,plain,
( ~ ssList(app(app(nil,sK55),X0))
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(sK55)
| segmentP(app(sK55,X0),sK55) ),
inference(superposition,[status(thm)],[c_16301,c_67]) ).
cnf(c_31295,plain,
( ~ ssList(app(app(sK55,nil),X0))
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(sK55)
| segmentP(app(sK55,X0),nil) ),
inference(superposition,[status(thm)],[c_16383,c_67]) ).
cnf(c_31360,plain,
( ~ ssList(app(sK55,X0))
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(sK55)
| segmentP(app(sK55,X0),nil) ),
inference(light_normalisation,[status(thm)],[c_31295,c_16383]) ).
cnf(c_31361,plain,
( ~ ssList(app(sK55,X0))
| ~ ssList(X0)
| segmentP(app(sK55,X0),nil) ),
inference(forward_subsumption_resolution,[status(thm)],[c_31360,c_257,c_141]) ).
cnf(c_31370,plain,
( ~ ssList(app(sK55,X0))
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(sK55)
| segmentP(app(sK55,X0),sK55) ),
inference(light_normalisation,[status(thm)],[c_31293,c_16301]) ).
cnf(c_31371,plain,
( ~ ssList(app(sK55,X0))
| ~ ssList(X0)
| segmentP(app(sK55,X0),sK55) ),
inference(forward_subsumption_resolution,[status(thm)],[c_31370,c_257,c_141]) ).
cnf(c_32992,plain,
( ~ ssList(X0)
| segmentP(app(sK55,X0),nil) ),
inference(global_subsumption_just,[status(thm)],[c_31361,c_257,c_29986,c_31361]) ).
cnf(c_33000,plain,
( ~ ssList(sK11(sK56,sK55))
| segmentP(sK56,nil) ),
inference(superposition,[status(thm)],[c_21720,c_32992]) ).
cnf(c_33025,plain,
( ~ ssList(X0)
| segmentP(app(sK55,X0),sK55) ),
inference(global_subsumption_just,[status(thm)],[c_31371,c_257,c_29986,c_31371]) ).
cnf(c_33032,plain,
( ~ ssList(nil)
| segmentP(sK55,sK55) ),
inference(superposition,[status(thm)],[c_16383,c_33025]) ).
cnf(c_33033,plain,
( ~ ssList(sK11(sK56,sK55))
| segmentP(sK56,sK55) ),
inference(superposition,[status(thm)],[c_21720,c_33025]) ).
cnf(c_33038,plain,
segmentP(sK55,sK55),
inference(forward_subsumption_resolution,[status(thm)],[c_33032,c_141]) ).
cnf(c_33711,plain,
~ ssList(sK11(sK56,sK55)),
inference(global_subsumption_just,[status(thm)],[c_33000,c_257,c_4922,c_22062,c_33038,c_33033]) ).
cnf(c_33713,plain,
( ~ frontsegP(sK56,sK55)
| ~ ssList(sK56)
| ~ ssList(sK55) ),
inference(superposition,[status(thm)],[c_63,c_33711]) ).
cnf(c_33714,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_33713,c_257,c_256,c_4974]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC057+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n024.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 : Mon Aug 28 17:18:23 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 9.78/2.15 % SZS status Started for theBenchmark.p
% 9.78/2.15 % SZS status Theorem for theBenchmark.p
% 9.78/2.15
% 9.78/2.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 9.78/2.15
% 9.78/2.15 ------ iProver source info
% 9.78/2.15
% 9.78/2.15 git: date: 2023-05-31 18:12:56 +0000
% 9.78/2.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 9.78/2.15 git: non_committed_changes: false
% 9.78/2.15 git: last_make_outside_of_git: false
% 9.78/2.15
% 9.78/2.15 ------ Parsing...
% 9.78/2.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 9.78/2.15
% 9.78/2.15 ------ 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 sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe_e
% 9.78/2.15
% 9.78/2.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 9.78/2.15
% 9.78/2.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 9.78/2.15 ------ Proving...
% 9.78/2.15 ------ Problem Properties
% 9.78/2.15
% 9.78/2.15
% 9.78/2.15 clauses 187
% 9.78/2.15 conjectures 3
% 9.78/2.15 EPR 56
% 9.78/2.15 Horn 118
% 9.78/2.15 unary 20
% 9.78/2.15 binary 40
% 9.78/2.15 lits 633
% 9.78/2.15 lits eq 83
% 9.78/2.15 fd_pure 0
% 9.78/2.15 fd_pseudo 0
% 9.78/2.15 fd_cond 22
% 9.78/2.15 fd_pseudo_cond 14
% 9.78/2.15 AC symbols 0
% 9.78/2.15
% 9.78/2.15 ------ Schedule dynamic 5 is on
% 9.78/2.15
% 9.78/2.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 9.78/2.15
% 9.78/2.15
% 9.78/2.15 ------
% 9.78/2.15 Current options:
% 9.78/2.15 ------
% 9.78/2.15
% 9.78/2.15
% 9.78/2.15
% 9.78/2.15
% 9.78/2.15 ------ Proving...
% 9.78/2.15
% 9.78/2.15
% 9.78/2.15 % SZS status Theorem for theBenchmark.p
% 9.78/2.15
% 9.78/2.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 9.78/2.15
% 9.78/2.15
%------------------------------------------------------------------------------