TSTP Solution File: SWC052+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC052+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:02 EDT 2024
% Result : Theorem 10.28s 2.21s
% Output : CNFRefutation 10.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 13
% Syntax : Number of formulae : 102 ( 26 unt; 0 def)
% Number of atoms : 540 ( 132 equ)
% Maximal formula atoms : 40 ( 5 avg)
% Number of connectives : 700 ( 262 ~; 241 |; 171 &)
% ( 4 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 145 ( 0 sgn 78 !; 50 ?)
% 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(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] :
( ( ( ? [X5] :
( segmentP(X0,X5)
& segmentP(X1,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ! [X4] :
( ~ frontsegP(X2,X4)
| ~ frontsegP(X3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ) )
| ( nil = X3
& nil != X2 )
| 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] :
( ( ( ? [X5] :
( segmentP(X0,X5)
& segmentP(X1,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ! [X4] :
( ~ frontsegP(X2,X4)
| ~ frontsegP(X3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ! [X5] :
( ~ frontsegP(X2,X5)
| ~ frontsegP(X3,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) ) )
| ( nil = X3
& nil != X2 )
| 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(f135,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( nil != X3
| nil = X2 )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f245,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(f246,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,[],[f245]) ).
fof(f247,plain,
! [X0,X1] :
( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
=> ( app(X1,sK11(X0,X1)) = X0
& ssList(sK11(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f248,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])],[f246,f247]) ).
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,[],[f104]) ).
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(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( nil != X3
| nil = X2 )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != sK53
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( nil != X3
| nil = X2 )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != sK53
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( nil != X3
| nil = X2 )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( nil != X3
| nil = X2 )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X2,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( nil != X3
| nil = X2 )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(sK55,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( nil != X3
| nil = sK55 )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(sK55,X5)
& frontsegP(X3,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( nil != X3
| nil = sK55 )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ( ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& ( ~ neq(sK56,nil)
| ? [X5] :
( frontsegP(sK55,X5)
& frontsegP(sK56,X5)
& neq(X5,nil)
& ssList(X5) ) )
& ( nil != sK56
| nil = sK55 )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X5] :
( frontsegP(sK55,X5)
& frontsegP(sK56,X5)
& neq(X5,nil)
& ssList(X5) )
=> ( frontsegP(sK55,sK57)
& frontsegP(sK56,sK57)
& neq(sK57,nil)
& ssList(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ( ( ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& ( ~ neq(sK56,nil)
| ( frontsegP(sK55,sK57)
& frontsegP(sK56,sK57)
& neq(sK57,nil)
& ssList(sK57) ) )
& ( nil != sK56
| nil = sK55 )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57])],[f222,f347,f346,f345,f344,f343]) ).
fof(f361,plain,
! [X0,X1] :
( ssList(sK11(X0,X1))
| ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f248]) ).
fof(f362,plain,
! [X0,X1] :
( app(X1,sK11(X0,X1)) = X0
| ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f248]) ).
fof(f370,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(f441,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f455,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f135]) ).
fof(f548,plain,
ssList(sK53),
inference(cnf_transformation,[],[f348]) ).
fof(f549,plain,
ssList(sK54),
inference(cnf_transformation,[],[f348]) ).
fof(f552,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f348]) ).
fof(f553,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f348]) ).
fof(f554,plain,
( nil != sK56
| nil = sK55 ),
inference(cnf_transformation,[],[f348]) ).
fof(f555,plain,
( ~ neq(sK56,nil)
| ssList(sK57) ),
inference(cnf_transformation,[],[f348]) ).
fof(f556,plain,
( ~ neq(sK56,nil)
| neq(sK57,nil) ),
inference(cnf_transformation,[],[f348]) ).
fof(f557,plain,
( ~ neq(sK56,nil)
| frontsegP(sK56,sK57) ),
inference(cnf_transformation,[],[f348]) ).
fof(f558,plain,
( ~ neq(sK56,nil)
| frontsegP(sK55,sK57) ),
inference(cnf_transformation,[],[f348]) ).
fof(f559,plain,
( neq(sK54,nil)
| nil = sK54 ),
inference(cnf_transformation,[],[f348]) ).
fof(f560,plain,
( neq(sK54,nil)
| nil != sK53 ),
inference(cnf_transformation,[],[f348]) ).
fof(f561,plain,
! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sK54 ),
inference(cnf_transformation,[],[f348]) ).
fof(f562,plain,
! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil != sK53 ),
inference(cnf_transformation,[],[f348]) ).
fof(f563,plain,
! [X4] :
( ~ segmentP(sK55,X4)
| ~ segmentP(sK56,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil != sK55 ),
inference(definition_unfolding,[],[f562,f553,f552,f553]) ).
fof(f564,plain,
! [X4] :
( ~ segmentP(sK55,X4)
| ~ segmentP(sK56,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sK56 ),
inference(definition_unfolding,[],[f561,f553,f552,f552]) ).
fof(f565,plain,
( neq(sK56,nil)
| nil != sK55 ),
inference(definition_unfolding,[],[f560,f552,f553]) ).
fof(f566,plain,
( neq(sK56,nil)
| nil = sK56 ),
inference(definition_unfolding,[],[f559,f552,f552]) ).
fof(f567,plain,
ssList(sK56),
inference(definition_unfolding,[],[f549,f552]) ).
fof(f568,plain,
ssList(sK55),
inference(definition_unfolding,[],[f548,f553]) ).
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,[],[f370]) ).
cnf(c_62,plain,
( ~ frontsegP(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| app(X1,sK11(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f362]) ).
cnf(c_63,plain,
( ~ frontsegP(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ssList(sK11(X0,X1)) ),
inference(cnf_transformation,[],[f361]) ).
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_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f441]) ).
cnf(c_155,plain,
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f455]) ).
cnf(c_246,negated_conjecture,
( nil != sK55
| ~ neq(X0,nil)
| ~ segmentP(sK55,X0)
| ~ segmentP(sK56,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f563]) ).
cnf(c_247,negated_conjecture,
( ~ neq(X0,nil)
| ~ segmentP(sK55,X0)
| ~ segmentP(sK56,X0)
| ~ ssList(X0)
| nil = sK56 ),
inference(cnf_transformation,[],[f564]) ).
cnf(c_248,negated_conjecture,
( nil != sK55
| neq(sK56,nil) ),
inference(cnf_transformation,[],[f565]) ).
cnf(c_249,negated_conjecture,
( nil = sK56
| neq(sK56,nil) ),
inference(cnf_transformation,[],[f566]) ).
cnf(c_250,negated_conjecture,
( ~ neq(sK56,nil)
| frontsegP(sK55,sK57) ),
inference(cnf_transformation,[],[f558]) ).
cnf(c_251,negated_conjecture,
( ~ neq(sK56,nil)
| frontsegP(sK56,sK57) ),
inference(cnf_transformation,[],[f557]) ).
cnf(c_252,negated_conjecture,
( ~ neq(sK56,nil)
| neq(sK57,nil) ),
inference(cnf_transformation,[],[f556]) ).
cnf(c_253,negated_conjecture,
( ~ neq(sK56,nil)
| ssList(sK57) ),
inference(cnf_transformation,[],[f555]) ).
cnf(c_254,negated_conjecture,
( nil != sK56
| nil = sK55 ),
inference(cnf_transformation,[],[f554]) ).
cnf(c_257,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f567]) ).
cnf(c_258,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f568]) ).
cnf(c_367,negated_conjecture,
ssList(sK57),
inference(global_subsumption_just,[status(thm)],[c_253,c_253,c_249,c_248,c_254]) ).
cnf(c_375,negated_conjecture,
neq(sK57,nil),
inference(global_subsumption_just,[status(thm)],[c_252,c_252,c_249,c_248,c_254]) ).
cnf(c_377,negated_conjecture,
frontsegP(sK56,sK57),
inference(global_subsumption_just,[status(thm)],[c_251,c_251,c_249,c_248,c_254]) ).
cnf(c_379,negated_conjecture,
frontsegP(sK55,sK57),
inference(global_subsumption_just,[status(thm)],[c_250,c_250,c_249,c_248,c_254]) ).
cnf(c_397,plain,
( ~ ssList(X0)
| ~ segmentP(sK56,X0)
| ~ segmentP(sK55,X0)
| ~ neq(X0,nil) ),
inference(global_subsumption_just,[status(thm)],[c_247,c_254,c_247,c_246]) ).
cnf(c_398,negated_conjecture,
( ~ neq(X0,nil)
| ~ segmentP(sK55,X0)
| ~ segmentP(sK56,X0)
| ~ ssList(X0) ),
inference(renaming,[status(thm)],[c_397]) ).
cnf(c_399,negated_conjecture,
( ~ neq(X0,nil)
| ~ segmentP(sK55,X0)
| ~ segmentP(sK56,X0)
| ~ ssList(X0) ),
inference(global_subsumption_just,[status(thm)],[c_246,c_398]) ).
cnf(c_3300,plain,
( X0 != sK57
| nil != nil
| ~ segmentP(sK55,X0)
| ~ segmentP(sK56,X0)
| ~ ssList(X0) ),
inference(resolution_lifted,[status(thm)],[c_399,c_375]) ).
cnf(c_3301,plain,
( ~ segmentP(sK55,sK57)
| ~ segmentP(sK56,sK57)
| ~ ssList(sK57) ),
inference(unflattening,[status(thm)],[c_3300]) ).
cnf(c_3302,plain,
( ~ segmentP(sK56,sK57)
| ~ segmentP(sK55,sK57) ),
inference(global_subsumption_just,[status(thm)],[c_3301,c_253,c_249,c_248,c_254,c_3301]) ).
cnf(c_3303,plain,
( ~ segmentP(sK55,sK57)
| ~ segmentP(sK56,sK57) ),
inference(renaming,[status(thm)],[c_3302]) ).
cnf(c_8937,negated_conjecture,
frontsegP(sK55,sK57),
inference(demodulation,[status(thm)],[c_379]) ).
cnf(c_8938,negated_conjecture,
frontsegP(sK56,sK57),
inference(demodulation,[status(thm)],[c_377]) ).
cnf(c_8939,negated_conjecture,
ssList(sK57),
inference(demodulation,[status(thm)],[c_367]) ).
cnf(c_8940,negated_conjecture,
ssList(sK55),
inference(demodulation,[status(thm)],[c_258]) ).
cnf(c_8941,negated_conjecture,
ssList(sK56),
inference(demodulation,[status(thm)],[c_257]) ).
cnf(c_12119,plain,
app(nil,sK57) = sK57,
inference(superposition,[status(thm)],[c_8939,c_155]) ).
cnf(c_17512,plain,
( ~ ssList(sK55)
| ~ ssList(sK57)
| app(sK57,sK11(sK55,sK57)) = sK55 ),
inference(superposition,[status(thm)],[c_8937,c_62]) ).
cnf(c_17513,plain,
( ~ ssList(sK56)
| ~ ssList(sK57)
| app(sK57,sK11(sK56,sK57)) = sK56 ),
inference(superposition,[status(thm)],[c_8938,c_62]) ).
cnf(c_17529,plain,
app(sK57,sK11(sK56,sK57)) = sK56,
inference(forward_subsumption_resolution,[status(thm)],[c_17513,c_8939,c_8941]) ).
cnf(c_17530,plain,
app(sK57,sK11(sK55,sK57)) = sK55,
inference(forward_subsumption_resolution,[status(thm)],[c_17512,c_8939,c_8940]) ).
cnf(c_26624,plain,
( ~ ssList(app(app(nil,sK57),X0))
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(sK57)
| segmentP(app(sK57,X0),sK57) ),
inference(superposition,[status(thm)],[c_12119,c_67]) ).
cnf(c_26727,plain,
( ~ ssList(app(sK57,X0))
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(sK57)
| segmentP(app(sK57,X0),sK57) ),
inference(light_normalisation,[status(thm)],[c_26624,c_12119]) ).
cnf(c_26728,plain,
( ~ ssList(app(sK57,X0))
| ~ ssList(X0)
| segmentP(app(sK57,X0),sK57) ),
inference(forward_subsumption_resolution,[status(thm)],[c_26727,c_8939,c_141]) ).
cnf(c_32383,plain,
( ~ ssList(app(sK57,sK11(sK55,sK57)))
| ~ ssList(sK11(sK55,sK57))
| segmentP(sK55,sK57) ),
inference(superposition,[status(thm)],[c_17530,c_26728]) ).
cnf(c_32384,plain,
( ~ ssList(app(sK57,sK11(sK56,sK57)))
| ~ ssList(sK11(sK56,sK57))
| segmentP(sK56,sK57) ),
inference(superposition,[status(thm)],[c_17529,c_26728]) ).
cnf(c_32391,plain,
( ~ ssList(sK11(sK56,sK57))
| ~ ssList(sK56)
| segmentP(sK56,sK57) ),
inference(light_normalisation,[status(thm)],[c_32384,c_17529]) ).
cnf(c_32392,plain,
( ~ ssList(sK11(sK56,sK57))
| segmentP(sK56,sK57) ),
inference(forward_subsumption_resolution,[status(thm)],[c_32391,c_8941]) ).
cnf(c_32395,plain,
( ~ ssList(sK11(sK55,sK57))
| ~ ssList(sK55)
| segmentP(sK55,sK57) ),
inference(light_normalisation,[status(thm)],[c_32383,c_17530]) ).
cnf(c_32396,plain,
( ~ ssList(sK11(sK55,sK57))
| segmentP(sK55,sK57) ),
inference(forward_subsumption_resolution,[status(thm)],[c_32395,c_8940]) ).
cnf(c_32470,plain,
( ~ frontsegP(sK56,sK57)
| ~ ssList(sK56)
| ~ ssList(sK57)
| segmentP(sK56,sK57) ),
inference(superposition,[status(thm)],[c_63,c_32392]) ).
cnf(c_32471,plain,
segmentP(sK56,sK57),
inference(forward_subsumption_resolution,[status(thm)],[c_32470,c_8939,c_8941,c_8938]) ).
cnf(c_32485,plain,
~ ssList(sK11(sK55,sK57)),
inference(global_subsumption_just,[status(thm)],[c_32396,c_3303,c_32396,c_32471]) ).
cnf(c_32487,plain,
( ~ frontsegP(sK55,sK57)
| ~ ssList(sK55)
| ~ ssList(sK57) ),
inference(superposition,[status(thm)],[c_63,c_32485]) ).
cnf(c_32488,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_32487,c_8939,c_8940,c_8937]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC052+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n007.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 : Thu May 2 23:14:05 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 10.28/2.21 % SZS status Started for theBenchmark.p
% 10.28/2.21 % SZS status Theorem for theBenchmark.p
% 10.28/2.21
% 10.28/2.21 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 10.28/2.21
% 10.28/2.21 ------ iProver source info
% 10.28/2.21
% 10.28/2.21 git: date: 2024-05-02 19:28:25 +0000
% 10.28/2.21 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 10.28/2.21 git: non_committed_changes: false
% 10.28/2.21
% 10.28/2.21 ------ Parsing...
% 10.28/2.21 ------ Clausification by vclausify_rel & Parsing by iProver...
% 10.28/2.21
% 10.28/2.21 ------ 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
% 10.28/2.21
% 10.28/2.21 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 10.28/2.21
% 10.28/2.21 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 10.28/2.21 ------ Proving...
% 10.28/2.21 ------ Problem Properties
% 10.28/2.21
% 10.28/2.21
% 10.28/2.21 clauses 190
% 10.28/2.21 conjectures 5
% 10.28/2.21 EPR 59
% 10.28/2.21 Horn 122
% 10.28/2.21 unary 23
% 10.28/2.21 binary 42
% 10.28/2.21 lits 633
% 10.28/2.21 lits eq 81
% 10.28/2.21 fd_pure 0
% 10.28/2.21 fd_pseudo 0
% 10.28/2.21 fd_cond 22
% 10.28/2.21 fd_pseudo_cond 14
% 10.28/2.21 AC symbols 0
% 10.28/2.21
% 10.28/2.21 ------ Schedule dynamic 5 is on
% 10.28/2.21
% 10.28/2.21 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 10.28/2.21
% 10.28/2.21
% 10.28/2.21 ------
% 10.28/2.21 Current options:
% 10.28/2.21 ------
% 10.28/2.21
% 10.28/2.21
% 10.28/2.21
% 10.28/2.21
% 10.28/2.21 ------ Proving...
% 10.28/2.21
% 10.28/2.21
% 10.28/2.21 % SZS status Theorem for theBenchmark.p
% 10.28/2.21
% 10.28/2.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.28/2.21
% 10.28/2.21
%------------------------------------------------------------------------------