TSTP Solution File: SWC108+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC108+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 : Fri May 3 03:11:15 EDT 2024
% Result : Theorem 17.98s 3.10s
% Output : CNFRefutation 17.98s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f596)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( rearsegP(X0,X1)
<=> ? [X2] :
( app(X2,X1) = X0
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax6) ).
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(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax83) ).
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)
=> ( ( ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| ( ( ( segmentP(X1,X0)
& neq(X0,nil) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| ( ( ( segmentP(X1,X0)
& neq(X0,nil) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f102,plain,
! [X0] :
( ! [X1] :
( ( rearsegP(X0,X1)
<=> ? [X2] :
( app(X2,X1) = X0
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f6]) ).
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(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] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f249,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( app(X2,X1) != X0
| ~ ssList(X2) ) )
& ( ? [X2] :
( app(X2,X1) = X0
& ssList(X2) )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f102]) ).
fof(f250,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( app(X2,X1) != X0
| ~ ssList(X2) ) )
& ( ? [X3] :
( app(X3,X1) = X0
& ssList(X3) )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f249]) ).
fof(f251,plain,
! [X0,X1] :
( ? [X3] :
( app(X3,X1) = X0
& ssList(X3) )
=> ( app(sK12(X0,X1),X1) = X0
& ssList(sK12(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f252,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( app(X2,X1) != X0
| ~ ssList(X2) ) )
& ( ( app(sK12(X0,X1),X1) = X0
& ssList(sK12(X0,X1)) )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK12])],[f250,f251]) ).
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,[],[f103]) ).
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(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(nnf_transformation,[],[f200]) ).
fof(f340,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,[],[f339]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ( ~ segmentP(X1,sK53)
| ~ neq(sK53,nil) )
& neq(X1,nil) )
| ( nil != sK53
& nil = X1 ) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ( ~ segmentP(X1,sK53)
| ~ neq(sK53,nil) )
& neq(X1,nil) )
| ( nil != sK53
& nil = X1 ) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ( ~ segmentP(sK54,sK53)
| ~ neq(sK53,nil) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ( ~ segmentP(sK54,sK53)
| ~ neq(sK53,nil) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( rearsegP(X3,sK55)
& neq(sK55,nil) )
| ( nil = sK55
& nil = X3 ) )
& ( ( ( ~ segmentP(sK54,sK53)
| ~ neq(sK53,nil) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ( ( rearsegP(X3,sK55)
& neq(sK55,nil) )
| ( nil = sK55
& nil = X3 ) )
& ( ( ( ~ segmentP(sK54,sK53)
| ~ neq(sK53,nil) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ( rearsegP(sK56,sK55)
& neq(sK55,nil) )
| ( nil = sK55
& nil = sK56 ) )
& ( ( ( ~ segmentP(sK54,sK53)
| ~ neq(sK53,nil) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ( ( rearsegP(sK56,sK55)
& neq(sK55,nil) )
| ( nil = sK55
& nil = sK56 ) )
& ( ( ( ~ segmentP(sK54,sK53)
| ~ neq(sK53,nil) )
& 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])],[f222,f346,f345,f344,f343]) ).
fof(f363,plain,
! [X0,X1] :
( ssList(sK12(X0,X1))
| ~ rearsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f252]) ).
fof(f364,plain,
! [X0,X1] :
( app(sK12(X0,X1),X1) = X0
| ~ rearsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f252]) ).
fof(f369,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,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f530,plain,
! [X0,X1] :
( nil = X1
| nil != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f340]) ).
fof(f533,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f201]) ).
fof(f547,plain,
ssList(sK53),
inference(cnf_transformation,[],[f347]) ).
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(f554,plain,
( neq(sK54,nil)
| nil != sK53 ),
inference(cnf_transformation,[],[f347]) ).
fof(f555,plain,
( ~ segmentP(sK54,sK53)
| ~ neq(sK53,nil)
| nil = sK54 ),
inference(cnf_transformation,[],[f347]) ).
fof(f557,plain,
( neq(sK55,nil)
| nil = sK56 ),
inference(cnf_transformation,[],[f347]) ).
fof(f558,plain,
( neq(sK55,nil)
| nil = sK55 ),
inference(cnf_transformation,[],[f347]) ).
fof(f559,plain,
( rearsegP(sK56,sK55)
| nil = sK56 ),
inference(cnf_transformation,[],[f347]) ).
fof(f560,plain,
( rearsegP(sK56,sK55)
| nil = sK55 ),
inference(cnf_transformation,[],[f347]) ).
fof(f562,plain,
( ~ segmentP(sK56,sK55)
| ~ neq(sK55,nil)
| nil = sK56 ),
inference(definition_unfolding,[],[f555,f551,f552,f552,f551]) ).
fof(f563,plain,
( neq(sK56,nil)
| nil != sK55 ),
inference(definition_unfolding,[],[f554,f551,f552]) ).
fof(f565,plain,
ssList(sK56),
inference(definition_unfolding,[],[f548,f551]) ).
fof(f566,plain,
ssList(sK55),
inference(definition_unfolding,[],[f547,f552]) ).
fof(f572,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,[],[f369]) ).
cnf(c_65,plain,
( ~ rearsegP(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| app(sK12(X0,X1),X1) = X0 ),
inference(cnf_transformation,[],[f364]) ).
cnf(c_66,plain,
( ~ rearsegP(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ssList(sK12(X0,X1)) ),
inference(cnf_transformation,[],[f363]) ).
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,[],[f572]) ).
cnf(c_139,plain,
( ~ neq(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f596]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f440]) ).
cnf(c_231,plain,
( app(X0,X1) != nil
| ~ ssList(X0)
| ~ ssList(X1)
| X1 = nil ),
inference(cnf_transformation,[],[f530]) ).
cnf(c_232,plain,
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f533]) ).
cnf(c_246,negated_conjecture,
( nil = sK55
| rearsegP(sK56,sK55) ),
inference(cnf_transformation,[],[f560]) ).
cnf(c_247,negated_conjecture,
( nil = sK56
| rearsegP(sK56,sK55) ),
inference(cnf_transformation,[],[f559]) ).
cnf(c_248,negated_conjecture,
( nil = sK55
| neq(sK55,nil) ),
inference(cnf_transformation,[],[f558]) ).
cnf(c_249,negated_conjecture,
( nil = sK56
| neq(sK55,nil) ),
inference(cnf_transformation,[],[f557]) ).
cnf(c_251,negated_conjecture,
( ~ neq(sK55,nil)
| ~ segmentP(sK56,sK55)
| nil = sK56 ),
inference(cnf_transformation,[],[f562]) ).
cnf(c_252,negated_conjecture,
( nil != sK55
| neq(sK56,nil) ),
inference(cnf_transformation,[],[f563]) ).
cnf(c_256,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f565]) ).
cnf(c_257,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f566]) ).
cnf(c_3286,plain,
( X0 != nil
| X0 != sK55
| ~ ssList(X0)
| nil = sK56 ),
inference(resolution_lifted,[status(thm)],[c_139,c_249]) ).
cnf(c_3287,plain,
( nil != sK55
| ~ ssList(nil)
| nil = sK56 ),
inference(unflattening,[status(thm)],[c_3286]) ).
cnf(c_3288,plain,
( nil != sK55
| nil = sK56 ),
inference(global_subsumption_just,[status(thm)],[c_3287,c_141,c_3287]) ).
cnf(c_3306,plain,
( X0 != nil
| X0 != sK56
| nil != sK55
| ~ ssList(X0) ),
inference(resolution_lifted,[status(thm)],[c_139,c_252]) ).
cnf(c_3307,plain,
( nil != sK56
| nil != sK55
| ~ ssList(nil) ),
inference(unflattening,[status(thm)],[c_3306]) ).
cnf(c_3308,plain,
nil != sK55,
inference(global_subsumption_just,[status(thm)],[c_3307,c_141,c_3288,c_3307]) ).
cnf(c_4874,negated_conjecture,
rearsegP(sK56,sK55),
inference(global_subsumption_just,[status(thm)],[c_247,c_246,c_3308]) ).
cnf(c_12944,negated_conjecture,
rearsegP(sK56,sK55),
inference(demodulation,[status(thm)],[c_4874]) ).
cnf(c_12946,negated_conjecture,
ssList(sK55),
inference(demodulation,[status(thm)],[c_257]) ).
cnf(c_12947,negated_conjecture,
ssList(sK56),
inference(demodulation,[status(thm)],[c_256]) ).
cnf(c_16150,plain,
app(sK56,nil) = sK56,
inference(superposition,[status(thm)],[c_12947,c_232]) ).
cnf(c_21826,plain,
( ~ ssList(sK56)
| ~ ssList(sK55)
| app(sK12(sK56,sK55),sK55) = sK56 ),
inference(superposition,[status(thm)],[c_12944,c_65]) ).
cnf(c_21838,plain,
app(sK12(sK56,sK55),sK55) = sK56,
inference(forward_subsumption_resolution,[status(thm)],[c_21826,c_12946,c_12947]) ).
cnf(c_22113,plain,
( nil != sK56
| ~ ssList(sK12(sK56,sK55))
| ~ ssList(sK55)
| nil = sK55 ),
inference(superposition,[status(thm)],[c_21838,c_231]) ).
cnf(c_22127,plain,
( nil != sK56
| ~ ssList(sK12(sK56,sK55)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_22113,c_3308,c_12946]) ).
cnf(c_30269,plain,
( ~ ssList(app(app(sK12(sK56,sK55),sK55),X0))
| ~ ssList(sK12(sK56,sK55))
| ~ ssList(X0)
| ~ ssList(sK55)
| segmentP(app(sK56,X0),sK55) ),
inference(superposition,[status(thm)],[c_21838,c_67]) ).
cnf(c_30346,plain,
( ~ ssList(app(sK56,X0))
| ~ ssList(sK12(sK56,sK55))
| ~ ssList(X0)
| ~ ssList(sK55)
| segmentP(app(sK56,X0),sK55) ),
inference(light_normalisation,[status(thm)],[c_30269,c_21838]) ).
cnf(c_30347,plain,
( ~ ssList(app(sK56,X0))
| ~ ssList(sK12(sK56,sK55))
| ~ ssList(X0)
| segmentP(app(sK56,X0),sK55) ),
inference(forward_subsumption_resolution,[status(thm)],[c_30346,c_12946]) ).
cnf(c_46782,plain,
( ~ ssList(app(sK56,nil))
| ~ ssList(sK12(sK56,sK55))
| ~ ssList(nil)
| segmentP(sK56,sK55) ),
inference(superposition,[status(thm)],[c_16150,c_30347]) ).
cnf(c_46786,plain,
( ~ ssList(sK12(sK56,sK55))
| ~ ssList(nil)
| ~ ssList(sK56)
| segmentP(sK56,sK55) ),
inference(light_normalisation,[status(thm)],[c_46782,c_16150]) ).
cnf(c_46787,plain,
( ~ ssList(sK12(sK56,sK55))
| segmentP(sK56,sK55) ),
inference(forward_subsumption_resolution,[status(thm)],[c_46786,c_12947,c_141]) ).
cnf(c_46811,plain,
~ ssList(sK12(sK56,sK55)),
inference(global_subsumption_just,[status(thm)],[c_46787,c_248,c_251,c_3308,c_22127,c_46787]) ).
cnf(c_46813,plain,
( ~ rearsegP(sK56,sK55)
| ~ ssList(sK56)
| ~ ssList(sK55) ),
inference(superposition,[status(thm)],[c_66,c_46811]) ).
cnf(c_46814,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_46813,c_12946,c_12947,c_12944]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SWC108+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.07 % Command : run_iprover %s %d THM
% 0.06/0.26 % Computer : n007.cluster.edu
% 0.06/0.26 % Model : x86_64 x86_64
% 0.06/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26 % Memory : 8042.1875MB
% 0.06/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26 % CPULimit : 300
% 0.06/0.26 % WCLimit : 300
% 0.06/0.26 % DateTime : Thu May 2 23:26:05 EDT 2024
% 0.06/0.26 % CPUTime :
% 0.11/0.38 Running first-order theorem proving
% 0.11/0.38 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
% 17.98/3.10 % SZS status Started for theBenchmark.p
% 17.98/3.10 % SZS status Theorem for theBenchmark.p
% 17.98/3.10
% 17.98/3.10 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 17.98/3.10
% 17.98/3.10 ------ iProver source info
% 17.98/3.10
% 17.98/3.10 git: date: 2024-05-02 19:28:25 +0000
% 17.98/3.10 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 17.98/3.10 git: non_committed_changes: false
% 17.98/3.10
% 17.98/3.10 ------ Parsing...
% 17.98/3.10 ------ Clausification by vclausify_rel & Parsing by iProver...
% 17.98/3.10
% 17.98/3.10 ------ 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
% 17.98/3.10
% 17.98/3.10 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 17.98/3.10
% 17.98/3.10 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 17.98/3.10 ------ Proving...
% 17.98/3.10 ------ Problem Properties
% 17.98/3.10
% 17.98/3.10
% 17.98/3.10 clauses 185
% 17.98/3.10 conjectures 4
% 17.98/3.10 EPR 54
% 17.98/3.10 Horn 117
% 17.98/3.10 unary 20
% 17.98/3.10 binary 41
% 17.98/3.10 lits 624
% 17.98/3.10 lits eq 80
% 17.98/3.10 fd_pure 0
% 17.98/3.10 fd_pseudo 0
% 17.98/3.10 fd_cond 21
% 17.98/3.10 fd_pseudo_cond 14
% 17.98/3.10 AC symbols 0
% 17.98/3.10
% 17.98/3.10 ------ Schedule dynamic 5 is on
% 17.98/3.10
% 17.98/3.10 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 17.98/3.10
% 17.98/3.10
% 17.98/3.10 ------
% 17.98/3.10 Current options:
% 17.98/3.10 ------
% 17.98/3.10
% 17.98/3.10
% 17.98/3.10
% 17.98/3.10
% 17.98/3.10 ------ Proving...
% 17.98/3.10
% 17.98/3.10
% 17.98/3.10 % SZS status Theorem for theBenchmark.p
% 17.98/3.10
% 17.98/3.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 17.98/3.11
% 17.98/3.11
%------------------------------------------------------------------------------