TSTP Solution File: SWC081+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC081+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n021.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:50 EDT 2023
% Result : Theorem 8.05s 1.70s
% Output : CNFRefutation 8.05s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f598)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',ax7) ).
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(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X5] :
( ssList(X5)
=> ( ~ frontsegP(X2,X5)
| ~ frontsegP(X3,X5)
| ~ neq(X5,nil) ) ) )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil)
| 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)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X5] :
( ssList(X5)
=> ( ~ frontsegP(X2,X5)
| ~ frontsegP(X3,X5)
| ~ neq(X5,nil) ) ) )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssList(X4)
=> ( ~ frontsegP(X2,X4)
| ~ frontsegP(X3,X4)
| ~ neq(X4,nil) ) ) )
| ? [X5] :
( segmentP(X0,X5)
& segmentP(X1,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f102,plain,
! [X0] :
( ! [X1] :
( ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f5]) ).
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(f135,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( frontsegP(X2,X4)
& frontsegP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ! [X5] :
( ~ segmentP(X0,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f223,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( frontsegP(X2,X4)
& frontsegP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ! [X5] :
( ~ segmentP(X0,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f222]) ).
fof(f246,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,[],[f102]) ).
fof(f247,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,[],[f246]) ).
fof(f248,plain,
! [X0,X1] :
( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
=> ( app(X1,sK11(X0,X1)) = X0
& ssList(sK11(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f249,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])],[f247,f248]) ).
fof(f254,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(f255,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,[],[f254]) ).
fof(f256,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(f257,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(f258,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])],[f255,f257,f256]) ).
fof(f344,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( frontsegP(X2,X4)
& frontsegP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ! [X5] :
( ~ segmentP(X0,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( frontsegP(X2,X4)
& frontsegP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ! [X5] :
( ~ segmentP(sK53,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X1,nil)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( frontsegP(X2,X4)
& frontsegP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ! [X5] :
( ~ segmentP(sK53,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X1,nil)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( frontsegP(X2,X4)
& frontsegP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ! [X5] :
( ~ segmentP(sK53,X5)
| ~ segmentP(sK54,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(sK54,nil)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( frontsegP(X2,X4)
& frontsegP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ! [X5] :
( ~ segmentP(sK53,X5)
| ~ segmentP(sK54,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(sK54,nil)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil = sK55
& nil = X3 )
| ? [X4] :
( frontsegP(sK55,X4)
& frontsegP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ! [X5] :
( ~ segmentP(sK53,X5)
| ~ segmentP(sK54,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(sK54,nil)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X3] :
( ( ( nil = sK55
& nil = X3 )
| ? [X4] :
( frontsegP(sK55,X4)
& frontsegP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ! [X5] :
( ~ segmentP(sK53,X5)
| ~ segmentP(sK54,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(sK54,nil)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ( nil = sK55
& nil = sK56 )
| ? [X4] :
( frontsegP(sK55,X4)
& frontsegP(sK56,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ! [X5] :
( ~ segmentP(sK53,X5)
| ~ segmentP(sK54,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(sK54,nil)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ? [X4] :
( frontsegP(sK55,X4)
& frontsegP(sK56,X4)
& neq(X4,nil)
& ssList(X4) )
=> ( frontsegP(sK55,sK57)
& frontsegP(sK56,sK57)
& neq(sK57,nil)
& ssList(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
( ( ( nil = sK55
& nil = sK56 )
| ( frontsegP(sK55,sK57)
& frontsegP(sK56,sK57)
& neq(sK57,nil)
& ssList(sK57) ) )
& ! [X5] :
( ~ segmentP(sK53,X5)
| ~ segmentP(sK54,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(sK54,nil)
& sK53 = sK55
& sK54 = sK56
& 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(f362,plain,
! [X0,X1] :
( ssList(sK11(X0,X1))
| ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f249]) ).
fof(f363,plain,
! [X0,X1] :
( app(X1,sK11(X0,X1)) = X0
| ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f249]) ).
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,[],[f258]) ).
fof(f442,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f456,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f135]) ).
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,
neq(sK54,nil),
inference(cnf_transformation,[],[f349]) ).
fof(f556,plain,
! [X5] :
( ~ segmentP(sK53,X5)
| ~ segmentP(sK54,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) ),
inference(cnf_transformation,[],[f349]) ).
fof(f557,plain,
( nil = sK56
| ssList(sK57) ),
inference(cnf_transformation,[],[f349]) ).
fof(f558,plain,
( nil = sK56
| neq(sK57,nil) ),
inference(cnf_transformation,[],[f349]) ).
fof(f559,plain,
( nil = sK56
| frontsegP(sK56,sK57) ),
inference(cnf_transformation,[],[f349]) ).
fof(f560,plain,
( nil = sK56
| frontsegP(sK55,sK57) ),
inference(cnf_transformation,[],[f349]) ).
fof(f561,plain,
( nil = sK55
| ssList(sK57) ),
inference(cnf_transformation,[],[f349]) ).
fof(f563,plain,
( nil = sK55
| frontsegP(sK56,sK57) ),
inference(cnf_transformation,[],[f349]) ).
fof(f564,plain,
( nil = sK55
| frontsegP(sK55,sK57) ),
inference(cnf_transformation,[],[f349]) ).
fof(f565,plain,
! [X5] :
( ~ segmentP(sK55,X5)
| ~ segmentP(sK56,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) ),
inference(definition_unfolding,[],[f556,f554,f553]) ).
fof(f566,plain,
neq(sK56,nil),
inference(definition_unfolding,[],[f555,f553]) ).
fof(f567,plain,
ssList(sK56),
inference(definition_unfolding,[],[f550,f553]) ).
fof(f568,plain,
ssList(sK55),
inference(definition_unfolding,[],[f549,f554]) ).
fof(f574,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_62,plain,
( ~ frontsegP(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| app(X1,sK11(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f363]) ).
cnf(c_63,plain,
( ~ frontsegP(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ssList(sK11(X0,X1)) ),
inference(cnf_transformation,[],[f362]) ).
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,[],[f574]) ).
cnf(c_139,plain,
( ~ neq(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f598]) ).
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_246,negated_conjecture,
( nil = sK55
| frontsegP(sK55,sK57) ),
inference(cnf_transformation,[],[f564]) ).
cnf(c_247,negated_conjecture,
( nil = sK55
| frontsegP(sK56,sK57) ),
inference(cnf_transformation,[],[f563]) ).
cnf(c_249,negated_conjecture,
( nil = sK55
| ssList(sK57) ),
inference(cnf_transformation,[],[f561]) ).
cnf(c_250,negated_conjecture,
( nil = sK56
| frontsegP(sK55,sK57) ),
inference(cnf_transformation,[],[f560]) ).
cnf(c_251,negated_conjecture,
( nil = sK56
| frontsegP(sK56,sK57) ),
inference(cnf_transformation,[],[f559]) ).
cnf(c_252,negated_conjecture,
( nil = sK56
| neq(sK57,nil) ),
inference(cnf_transformation,[],[f558]) ).
cnf(c_253,negated_conjecture,
( nil = sK56
| ssList(sK57) ),
inference(cnf_transformation,[],[f557]) ).
cnf(c_254,negated_conjecture,
( ~ neq(X0,nil)
| ~ segmentP(sK55,X0)
| ~ segmentP(sK56,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f565]) ).
cnf(c_255,negated_conjecture,
neq(sK56,nil),
inference(cnf_transformation,[],[f566]) ).
cnf(c_258,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f567]) ).
cnf(c_259,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f568]) ).
cnf(c_3331,plain,
( X0 != nil
| X0 != sK56
| ~ ssList(X0) ),
inference(resolution_lifted,[status(thm)],[c_139,c_255]) ).
cnf(c_3332,plain,
( nil != sK56
| ~ ssList(nil) ),
inference(unflattening,[status(thm)],[c_3331]) ).
cnf(c_3341,plain,
( X0 != sK57
| nil != nil
| ~ segmentP(sK55,X0)
| ~ segmentP(sK56,X0)
| ~ ssList(X0)
| nil = sK56 ),
inference(resolution_lifted,[status(thm)],[c_252,c_254]) ).
cnf(c_3342,plain,
( ~ segmentP(sK55,sK57)
| ~ segmentP(sK56,sK57)
| ~ ssList(sK57)
| nil = sK56 ),
inference(unflattening,[status(thm)],[c_3341]) ).
cnf(c_3343,plain,
( ~ segmentP(sK55,sK57)
| ~ segmentP(sK56,sK57) ),
inference(global_subsumption_just,[status(thm)],[c_3342,c_141,c_253,c_3332,c_3342]) ).
cnf(c_4929,negated_conjecture,
ssList(sK57),
inference(global_subsumption_just,[status(thm)],[c_249,c_141,c_253,c_3332]) ).
cnf(c_4931,negated_conjecture,
frontsegP(sK56,sK57),
inference(global_subsumption_just,[status(thm)],[c_247,c_141,c_251,c_3332]) ).
cnf(c_4933,negated_conjecture,
frontsegP(sK55,sK57),
inference(global_subsumption_just,[status(thm)],[c_246,c_141,c_250,c_3332]) ).
cnf(c_16240,plain,
app(nil,sK57) = sK57,
inference(superposition,[status(thm)],[c_4929,c_155]) ).
cnf(c_21633,plain,
( ~ ssList(sK55)
| ~ ssList(sK57)
| app(sK57,sK11(sK55,sK57)) = sK55 ),
inference(superposition,[status(thm)],[c_4933,c_62]) ).
cnf(c_21634,plain,
( ~ ssList(sK57)
| ~ ssList(sK56)
| app(sK57,sK11(sK56,sK57)) = sK56 ),
inference(superposition,[status(thm)],[c_4931,c_62]) ).
cnf(c_21650,plain,
app(sK57,sK11(sK56,sK57)) = sK56,
inference(forward_subsumption_resolution,[status(thm)],[c_21634,c_258,c_4929]) ).
cnf(c_21651,plain,
app(sK57,sK11(sK55,sK57)) = sK55,
inference(forward_subsumption_resolution,[status(thm)],[c_21633,c_4929,c_259]) ).
cnf(c_31139,plain,
( ~ ssList(app(app(nil,sK57),X0))
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(sK57)
| segmentP(app(sK57,X0),sK57) ),
inference(superposition,[status(thm)],[c_16240,c_67]) ).
cnf(c_31242,plain,
( ~ ssList(app(sK57,X0))
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(sK57)
| segmentP(app(sK57,X0),sK57) ),
inference(light_normalisation,[status(thm)],[c_31139,c_16240]) ).
cnf(c_31243,plain,
( ~ ssList(app(sK57,X0))
| ~ ssList(X0)
| segmentP(app(sK57,X0),sK57) ),
inference(forward_subsumption_resolution,[status(thm)],[c_31242,c_4929,c_141]) ).
cnf(c_36474,plain,
( ~ ssList(app(sK57,sK11(sK55,sK57)))
| ~ ssList(sK11(sK55,sK57))
| segmentP(sK55,sK57) ),
inference(superposition,[status(thm)],[c_21651,c_31243]) ).
cnf(c_36475,plain,
( ~ ssList(app(sK57,sK11(sK56,sK57)))
| ~ ssList(sK11(sK56,sK57))
| segmentP(sK56,sK57) ),
inference(superposition,[status(thm)],[c_21650,c_31243]) ).
cnf(c_36482,plain,
( ~ ssList(sK11(sK56,sK57))
| ~ ssList(sK56)
| segmentP(sK56,sK57) ),
inference(light_normalisation,[status(thm)],[c_36475,c_21650]) ).
cnf(c_36483,plain,
( ~ ssList(sK11(sK56,sK57))
| segmentP(sK56,sK57) ),
inference(forward_subsumption_resolution,[status(thm)],[c_36482,c_258]) ).
cnf(c_36486,plain,
( ~ ssList(sK11(sK55,sK57))
| ~ ssList(sK55)
| segmentP(sK55,sK57) ),
inference(light_normalisation,[status(thm)],[c_36474,c_21651]) ).
cnf(c_36487,plain,
( ~ ssList(sK11(sK55,sK57))
| segmentP(sK55,sK57) ),
inference(forward_subsumption_resolution,[status(thm)],[c_36486,c_259]) ).
cnf(c_36515,plain,
( ~ frontsegP(sK56,sK57)
| ~ ssList(sK57)
| ~ ssList(sK56)
| segmentP(sK56,sK57) ),
inference(superposition,[status(thm)],[c_63,c_36483]) ).
cnf(c_36516,plain,
segmentP(sK56,sK57),
inference(forward_subsumption_resolution,[status(thm)],[c_36515,c_258,c_4929,c_4931]) ).
cnf(c_36529,plain,
~ ssList(sK11(sK55,sK57)),
inference(global_subsumption_just,[status(thm)],[c_36487,c_3343,c_36487,c_36516]) ).
cnf(c_36531,plain,
( ~ frontsegP(sK55,sK57)
| ~ ssList(sK55)
| ~ ssList(sK57) ),
inference(superposition,[status(thm)],[c_63,c_36529]) ).
cnf(c_36532,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_36531,c_4929,c_259,c_4933]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC081+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n021.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 15:25:13 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 8.05/1.70 % SZS status Started for theBenchmark.p
% 8.05/1.70 % SZS status Theorem for theBenchmark.p
% 8.05/1.70
% 8.05/1.70 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 8.05/1.70
% 8.05/1.70 ------ iProver source info
% 8.05/1.70
% 8.05/1.70 git: date: 2023-05-31 18:12:56 +0000
% 8.05/1.70 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 8.05/1.70 git: non_committed_changes: false
% 8.05/1.70 git: last_make_outside_of_git: false
% 8.05/1.70
% 8.05/1.70 ------ Parsing...
% 8.05/1.70 ------ Clausification by vclausify_rel & Parsing by iProver...
% 8.05/1.70
% 8.05/1.70 ------ 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
% 8.05/1.70
% 8.05/1.70 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 8.05/1.70
% 8.05/1.70 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 8.05/1.70 ------ Proving...
% 8.05/1.70 ------ Problem Properties
% 8.05/1.70
% 8.05/1.70
% 8.05/1.70 clauses 190
% 8.05/1.70 conjectures 5
% 8.05/1.70 EPR 59
% 8.05/1.70 Horn 122
% 8.05/1.70 unary 23
% 8.05/1.70 binary 42
% 8.05/1.70 lits 633
% 8.05/1.70 lits eq 81
% 8.05/1.70 fd_pure 0
% 8.05/1.70 fd_pseudo 0
% 8.05/1.70 fd_cond 22
% 8.05/1.70 fd_pseudo_cond 14
% 8.05/1.70 AC symbols 0
% 8.05/1.70
% 8.05/1.70 ------ Schedule dynamic 5 is on
% 8.05/1.70
% 8.05/1.70 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 8.05/1.70
% 8.05/1.70
% 8.05/1.70 ------
% 8.05/1.70 Current options:
% 8.05/1.70 ------
% 8.05/1.70
% 8.05/1.70
% 8.05/1.70
% 8.05/1.70
% 8.05/1.70 ------ Proving...
% 8.05/1.70
% 8.05/1.70
% 8.05/1.70 % SZS status Theorem for theBenchmark.p
% 8.05/1.70
% 8.05/1.70 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 8.05/1.70
% 8.05/1.70
%------------------------------------------------------------------------------