TSTP Solution File: SWC080+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC080+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n017.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:49 EDT 2023
% Result : Theorem 62.82s 9.24s
% Output : CNFRefutation 62.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 15
% Syntax : Number of formulae : 110 ( 27 unt; 0 def)
% Number of atoms : 494 ( 88 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 613 ( 229 ~; 219 |; 137 &)
% ( 4 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 238 ( 20 sgn; 114 !; 49 ?)
% 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(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ! [X5] :
( ~ frontsegP(X2,X5)
| ~ frontsegP(X3,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil) ) )
| 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] :
( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ! [X5] :
( ~ frontsegP(X2,X5)
| ~ frontsegP(X3,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ! [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) ) ) ) ),
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(f133,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f135,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ? [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(f232,plain,
! [X2,X3,X0,X1] :
( ( ? [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) )
| ~ sP6(X2,X3,X0,X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP6])]) ).
fof(f233,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP6(X2,X3,X0,X1) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f222,f232]) ).
fof(f247,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(f248,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,[],[f247]) ).
fof(f249,plain,
! [X0,X1] :
( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
=> ( app(X1,sK12(X0,X1)) = X0
& ssList(sK12(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f250,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ( app(X1,sK12(X0,X1)) = X0
& ssList(sK12(X0,X1)) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK12])],[f248,f249]) ).
fof(f255,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(f256,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,[],[f255]) ).
fof(f257,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( app(app(sK14(X0,X1),X1),X5) = X0
& ssList(X5) )
& ssList(sK14(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f258,plain,
! [X0,X1] :
( ? [X5] :
( app(app(sK14(X0,X1),X1),X5) = X0
& ssList(X5) )
=> ( app(app(sK14(X0,X1),X1),sK15(X0,X1)) = X0
& ssList(sK15(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f259,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ( app(app(sK14(X0,X1),X1),sK15(X0,X1)) = X0
& ssList(sK15(X0,X1))
& ssList(sK14(X0,X1)) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK14,sK15])],[f256,f258,f257]) ).
fof(f345,plain,
! [X2,X3,X0,X1] :
( ( ? [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) )
| ~ sP6(X2,X3,X0,X1) ),
inference(nnf_transformation,[],[f232]) ).
fof(f346,plain,
! [X0,X1,X2,X3] :
( ( ? [X4] :
( frontsegP(X0,X4)
& frontsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
& ! [X5] :
( ~ segmentP(X2,X5)
| ~ segmentP(X3,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X3,nil) )
| ~ sP6(X0,X1,X2,X3) ),
inference(rectify,[],[f345]) ).
fof(f347,plain,
! [X0,X1] :
( ? [X4] :
( frontsegP(X0,X4)
& frontsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
=> ( frontsegP(X0,sK54(X0,X1))
& frontsegP(X1,sK54(X0,X1))
& neq(sK54(X0,X1),nil)
& ssList(sK54(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
! [X0,X1,X2,X3] :
( ( frontsegP(X0,sK54(X0,X1))
& frontsegP(X1,sK54(X0,X1))
& neq(sK54(X0,X1),nil)
& ssList(sK54(X0,X1))
& ! [X5] :
( ~ segmentP(X2,X5)
| ~ segmentP(X3,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X3,nil) )
| ~ sP6(X0,X1,X2,X3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK54])],[f346,f347]) ).
fof(f349,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP6(X2,X3,X0,X1) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP6(X2,X3,sK55,X1) )
& sK55 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f350,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP6(X2,X3,sK55,X1) )
& sK55 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK56,nil) )
| sP6(X2,X3,sK55,sK56) )
& sK55 = X2
& sK56 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f351,plain,
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK56,nil) )
| sP6(X2,X3,sK55,sK56) )
& sK55 = X2
& sK56 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK56,nil) )
| sP6(sK57,X3,sK55,sK56) )
& sK55 = sK57
& sK56 = X3
& ssList(X3) )
& ssList(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f352,plain,
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK56,nil) )
| sP6(sK57,X3,sK55,sK56) )
& sK55 = sK57
& sK56 = X3
& ssList(X3) )
=> ( ( ( ~ neq(sK58,nil)
& neq(sK56,nil) )
| sP6(sK57,sK58,sK55,sK56) )
& sK55 = sK57
& sK56 = sK58
& ssList(sK58) ) ),
introduced(choice_axiom,[]) ).
fof(f353,plain,
( ( ( ~ neq(sK58,nil)
& neq(sK56,nil) )
| sP6(sK57,sK58,sK55,sK56) )
& sK55 = sK57
& sK56 = sK58
& ssList(sK58)
& ssList(sK57)
& ssList(sK56)
& ssList(sK55) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK55,sK56,sK57,sK58])],[f233,f352,f351,f350,f349]) ).
fof(f366,plain,
! [X0,X1] :
( ssList(sK12(X0,X1))
| ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f250]) ).
fof(f367,plain,
! [X0,X1] :
( app(X1,sK12(X0,X1)) = X0
| ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f250]) ).
fof(f375,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,[],[f259]) ).
fof(f446,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f458,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f133]) ).
fof(f460,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f135]) ).
fof(f554,plain,
! [X2,X3,X0,X1,X5] :
( ~ segmentP(X2,X5)
| ~ segmentP(X3,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f348]) ).
fof(f555,plain,
! [X2,X3,X0,X1] :
( ssList(sK54(X0,X1))
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f348]) ).
fof(f556,plain,
! [X2,X3,X0,X1] :
( neq(sK54(X0,X1),nil)
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f348]) ).
fof(f557,plain,
! [X2,X3,X0,X1] :
( frontsegP(X1,sK54(X0,X1))
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f348]) ).
fof(f558,plain,
! [X2,X3,X0,X1] :
( frontsegP(X0,sK54(X0,X1))
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f348]) ).
fof(f559,plain,
ssList(sK55),
inference(cnf_transformation,[],[f353]) ).
fof(f560,plain,
ssList(sK56),
inference(cnf_transformation,[],[f353]) ).
fof(f563,plain,
sK56 = sK58,
inference(cnf_transformation,[],[f353]) ).
fof(f564,plain,
sK55 = sK57,
inference(cnf_transformation,[],[f353]) ).
fof(f565,plain,
( neq(sK56,nil)
| sP6(sK57,sK58,sK55,sK56) ),
inference(cnf_transformation,[],[f353]) ).
fof(f566,plain,
( ~ neq(sK58,nil)
| sP6(sK57,sK58,sK55,sK56) ),
inference(cnf_transformation,[],[f353]) ).
fof(f567,plain,
( ~ neq(sK58,nil)
| sP6(sK57,sK58,sK57,sK58) ),
inference(definition_unfolding,[],[f566,f564,f563]) ).
fof(f568,plain,
( neq(sK58,nil)
| sP6(sK57,sK58,sK57,sK58) ),
inference(definition_unfolding,[],[f565,f563,f564,f563]) ).
fof(f569,plain,
ssList(sK58),
inference(definition_unfolding,[],[f560,f563]) ).
fof(f570,plain,
ssList(sK57),
inference(definition_unfolding,[],[f559,f564]) ).
fof(f576,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,[],[f375]) ).
cnf(c_62,plain,
( ~ frontsegP(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| app(X1,sK12(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f367]) ).
cnf(c_63,plain,
( ~ frontsegP(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ssList(sK12(X0,X1)) ),
inference(cnf_transformation,[],[f366]) ).
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,[],[f576]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f446]) ).
cnf(c_153,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f458]) ).
cnf(c_155,plain,
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f460]) ).
cnf(c_246,plain,
( ~ sP6(X0,X1,X2,X3)
| frontsegP(X0,sK54(X0,X1)) ),
inference(cnf_transformation,[],[f558]) ).
cnf(c_247,plain,
( ~ sP6(X0,X1,X2,X3)
| frontsegP(X1,sK54(X0,X1)) ),
inference(cnf_transformation,[],[f557]) ).
cnf(c_248,plain,
( ~ sP6(X0,X1,X2,X3)
| neq(sK54(X0,X1),nil) ),
inference(cnf_transformation,[],[f556]) ).
cnf(c_249,plain,
( ~ sP6(X0,X1,X2,X3)
| ssList(sK54(X0,X1)) ),
inference(cnf_transformation,[],[f555]) ).
cnf(c_250,plain,
( ~ sP6(X0,X1,X2,X3)
| ~ segmentP(X2,X4)
| ~ segmentP(X3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f554]) ).
cnf(c_252,negated_conjecture,
( ~ neq(sK58,nil)
| sP6(sK57,sK58,sK57,sK58) ),
inference(cnf_transformation,[],[f567]) ).
cnf(c_253,negated_conjecture,
( sP6(sK57,sK58,sK57,sK58)
| neq(sK58,nil) ),
inference(cnf_transformation,[],[f568]) ).
cnf(c_256,negated_conjecture,
ssList(sK58),
inference(cnf_transformation,[],[f569]) ).
cnf(c_257,negated_conjecture,
ssList(sK57),
inference(cnf_transformation,[],[f570]) ).
cnf(c_375,negated_conjecture,
sP6(sK57,sK58,sK57,sK58),
inference(global_subsumption_just,[status(thm)],[c_253,c_253,c_252]) ).
cnf(c_377,negated_conjecture,
sP6(sK57,sK58,sK57,sK58),
inference(global_subsumption_just,[status(thm)],[c_252,c_375]) ).
cnf(c_3222,plain,
( X0 != sK57
| X1 != sK58
| X2 != sK57
| X3 != sK58
| ~ segmentP(X2,X4)
| ~ segmentP(X3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(resolution_lifted,[status(thm)],[c_250,c_377]) ).
cnf(c_3223,plain,
( ~ neq(X0,nil)
| ~ segmentP(sK58,X0)
| ~ segmentP(sK57,X0)
| ~ ssList(X0) ),
inference(unflattening,[status(thm)],[c_3222]) ).
cnf(c_3236,plain,
( X0 != sK57
| X1 != sK58
| X2 != sK57
| X3 != sK58
| ssList(sK54(X0,X1)) ),
inference(resolution_lifted,[status(thm)],[c_249,c_377]) ).
cnf(c_3237,plain,
ssList(sK54(sK57,sK58)),
inference(unflattening,[status(thm)],[c_3236]) ).
cnf(c_3241,plain,
( X0 != sK57
| X1 != sK58
| X2 != sK57
| X3 != sK58
| neq(sK54(X0,X1),nil) ),
inference(resolution_lifted,[status(thm)],[c_248,c_377]) ).
cnf(c_3242,plain,
neq(sK54(sK57,sK58),nil),
inference(unflattening,[status(thm)],[c_3241]) ).
cnf(c_3246,plain,
( X0 != sK57
| X1 != sK58
| X2 != sK57
| X3 != sK58
| frontsegP(X1,sK54(X0,X1)) ),
inference(resolution_lifted,[status(thm)],[c_247,c_377]) ).
cnf(c_3247,plain,
frontsegP(sK58,sK54(sK57,sK58)),
inference(unflattening,[status(thm)],[c_3246]) ).
cnf(c_3251,plain,
( X0 != sK57
| X1 != sK58
| X2 != sK57
| X3 != sK58
| frontsegP(X0,sK54(X0,X1)) ),
inference(resolution_lifted,[status(thm)],[c_246,c_377]) ).
cnf(c_3252,plain,
frontsegP(sK57,sK54(sK57,sK58)),
inference(unflattening,[status(thm)],[c_3251]) ).
cnf(c_3367,plain,
( sK54(sK57,sK58) != X0
| nil != nil
| ~ segmentP(sK58,X0)
| ~ segmentP(sK57,X0)
| ~ ssList(X0) ),
inference(resolution_lifted,[status(thm)],[c_3223,c_3242]) ).
cnf(c_3368,plain,
( ~ segmentP(sK58,sK54(sK57,sK58))
| ~ segmentP(sK57,sK54(sK57,sK58))
| ~ ssList(sK54(sK57,sK58)) ),
inference(unflattening,[status(thm)],[c_3367]) ).
cnf(c_9010,plain,
frontsegP(sK57,sK54(sK57,sK58)),
inference(subtyping,[status(esa)],[c_3252]) ).
cnf(c_9011,plain,
frontsegP(sK58,sK54(sK57,sK58)),
inference(subtyping,[status(esa)],[c_3247]) ).
cnf(c_9012,plain,
ssList(sK54(sK57,sK58)),
inference(subtyping,[status(esa)],[c_3237]) ).
cnf(c_9025,negated_conjecture,
ssList(sK57),
inference(subtyping,[status(esa)],[c_257]) ).
cnf(c_9026,negated_conjecture,
ssList(sK58),
inference(subtyping,[status(esa)],[c_256]) ).
cnf(c_9103,plain,
( ~ ssList(X0_13)
| app(nil,X0_13) = X0_13 ),
inference(subtyping,[status(esa)],[c_155]) ).
cnf(c_9105,plain,
( ~ ssList(X0_13)
| ~ ssList(X1_13)
| ssList(app(X0_13,X1_13)) ),
inference(subtyping,[status(esa)],[c_153]) ).
cnf(c_9117,plain,
ssList(nil),
inference(subtyping,[status(esa)],[c_141]) ).
cnf(c_9180,plain,
( ~ ssList(app(app(X0_13,X1_13),X2_13))
| ~ ssList(X0_13)
| ~ ssList(X1_13)
| ~ ssList(X2_13)
| segmentP(app(app(X0_13,X1_13),X2_13),X1_13) ),
inference(subtyping,[status(esa)],[c_67]) ).
cnf(c_9183,plain,
( ~ frontsegP(X0_13,X1_13)
| ~ ssList(X0_13)
| ~ ssList(X1_13)
| ssList(sK12(X0_13,X1_13)) ),
inference(subtyping,[status(esa)],[c_63]) ).
cnf(c_9184,plain,
( ~ frontsegP(X0_13,X1_13)
| ~ ssList(X0_13)
| ~ ssList(X1_13)
| app(X1_13,sK12(X0_13,X1_13)) = X0_13 ),
inference(subtyping,[status(esa)],[c_62]) ).
cnf(c_21351,plain,
( ~ ssList(app(X0_13,X1_13))
| ~ ssList(X2_13)
| ssList(app(app(X0_13,X1_13),X2_13)) ),
inference(instantiation,[status(thm)],[c_9105]) ).
cnf(c_31583,plain,
( ~ ssList(X0_13)
| ~ ssList(X1_13)
| ~ ssList(X2_13)
| segmentP(app(app(X0_13,X1_13),X2_13),X1_13) ),
inference(global_subsumption_just,[status(thm)],[c_9180,c_9105,c_9180,c_21351]) ).
cnf(c_42337,plain,
app(nil,sK54(sK57,sK58)) = sK54(sK57,sK58),
inference(superposition,[status(thm)],[c_9012,c_9103]) ).
cnf(c_44470,plain,
( ~ ssList(sK54(sK57,sK58))
| ~ ssList(sK58)
| app(sK54(sK57,sK58),sK12(sK58,sK54(sK57,sK58))) = sK58 ),
inference(superposition,[status(thm)],[c_9011,c_9184]) ).
cnf(c_44471,plain,
( ~ ssList(sK54(sK57,sK58))
| ~ ssList(sK57)
| app(sK54(sK57,sK58),sK12(sK57,sK54(sK57,sK58))) = sK57 ),
inference(superposition,[status(thm)],[c_9010,c_9184]) ).
cnf(c_44504,plain,
app(sK54(sK57,sK58),sK12(sK57,sK54(sK57,sK58))) = sK57,
inference(forward_subsumption_resolution,[status(thm)],[c_44471,c_9025,c_9012]) ).
cnf(c_44505,plain,
app(sK54(sK57,sK58),sK12(sK58,sK54(sK57,sK58))) = sK58,
inference(forward_subsumption_resolution,[status(thm)],[c_44470,c_9026,c_9012]) ).
cnf(c_46538,plain,
( ~ ssList(X0_13)
| ~ ssList(X1_13)
| ~ ssList(X2_13)
| segmentP(app(app(X0_13,X1_13),X2_13),X1_13) ),
inference(global_subsumption_just,[status(thm)],[c_9180,c_31583]) ).
cnf(c_46548,plain,
( ~ ssList(sK54(sK57,sK58))
| ~ ssList(X0_13)
| ~ ssList(nil)
| segmentP(app(sK54(sK57,sK58),X0_13),sK54(sK57,sK58)) ),
inference(superposition,[status(thm)],[c_42337,c_46538]) ).
cnf(c_46611,plain,
( ~ ssList(X0_13)
| segmentP(app(sK54(sK57,sK58),X0_13),sK54(sK57,sK58)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_46548,c_9117,c_9012]) ).
cnf(c_47423,plain,
( ~ ssList(sK12(sK58,sK54(sK57,sK58)))
| segmentP(sK58,sK54(sK57,sK58)) ),
inference(superposition,[status(thm)],[c_44505,c_46611]) ).
cnf(c_47424,plain,
( ~ ssList(sK12(sK57,sK54(sK57,sK58)))
| segmentP(sK57,sK54(sK57,sK58)) ),
inference(superposition,[status(thm)],[c_44504,c_46611]) ).
cnf(c_59595,plain,
( ~ frontsegP(sK58,sK54(sK57,sK58))
| ~ ssList(sK54(sK57,sK58))
| ~ ssList(sK58)
| ssList(sK12(sK58,sK54(sK57,sK58))) ),
inference(instantiation,[status(thm)],[c_9183]) ).
cnf(c_59598,plain,
( ~ frontsegP(sK57,sK54(sK57,sK58))
| ~ ssList(sK54(sK57,sK58))
| ~ ssList(sK57)
| ssList(sK12(sK57,sK54(sK57,sK58))) ),
inference(instantiation,[status(thm)],[c_9183]) ).
cnf(c_59599,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_59598,c_59595,c_47423,c_47424,c_3368,c_3252,c_3247,c_3237,c_256,c_257]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC080+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Aug 28 16:11:43 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.18/0.47 Running first-order theorem proving
% 0.18/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 62.82/9.24 % SZS status Started for theBenchmark.p
% 62.82/9.24 % SZS status Theorem for theBenchmark.p
% 62.82/9.24
% 62.82/9.24 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 62.82/9.24
% 62.82/9.24 ------ iProver source info
% 62.82/9.24
% 62.82/9.24 git: date: 2023-05-31 18:12:56 +0000
% 62.82/9.24 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 62.82/9.24 git: non_committed_changes: false
% 62.82/9.24 git: last_make_outside_of_git: false
% 62.82/9.24
% 62.82/9.24 ------ Parsing...
% 62.82/9.24 ------ Clausification by vclausify_rel & Parsing by iProver...
% 62.82/9.24
% 62.82/9.24 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e sup_sim: 0 sf_s rm: 6 0s sf_e pe_s pe_e
% 62.82/9.24
% 62.82/9.24 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 62.82/9.24
% 62.82/9.24 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 62.82/9.24 ------ Proving...
% 62.82/9.24 ------ Problem Properties
% 62.82/9.24
% 62.82/9.24
% 62.82/9.24 clauses 190
% 62.82/9.24 conjectures 2
% 62.82/9.24 EPR 54
% 62.82/9.24 Horn 122
% 62.82/9.24 unary 23
% 62.82/9.24 binary 42
% 62.82/9.24 lits 633
% 62.82/9.24 lits eq 81
% 62.82/9.24 fd_pure 0
% 62.82/9.24 fd_pseudo 0
% 62.82/9.24 fd_cond 22
% 62.82/9.24 fd_pseudo_cond 14
% 62.82/9.24 AC symbols 0
% 62.82/9.24
% 62.82/9.24 ------ Input Options Time Limit: Unbounded
% 62.82/9.24
% 62.82/9.24
% 62.82/9.24 ------
% 62.82/9.24 Current options:
% 62.82/9.24 ------
% 62.82/9.24
% 62.82/9.24
% 62.82/9.24
% 62.82/9.24
% 62.82/9.24 ------ Proving...
% 62.82/9.24
% 62.82/9.24
% 62.82/9.24 % SZS status Theorem for theBenchmark.p
% 62.82/9.24
% 62.82/9.24 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 62.82/9.24
% 62.82/9.25
%------------------------------------------------------------------------------