TSTP Solution File: SWC182+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC182+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n018.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:41:31 EDT 2023
% Result : Theorem 0.48s 1.17s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 16
% Syntax : Number of formulae : 72 ( 17 unt; 0 def)
% Number of atoms : 413 ( 76 equ)
% Maximal formula atoms : 26 ( 5 avg)
% Number of connectives : 485 ( 144 ~; 147 |; 152 &)
% ( 4 <=>; 38 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 188 ( 0 sgn; 91 !; 75 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ( memberP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(X2,cons(X1,X3)) = X0
& ssList(X3) )
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax16) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax26) ).
fof(f36,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( memberP(app(X1,X2),X0)
<=> ( memberP(X2,X0)
| memberP(X1,X0) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax36) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax38) ).
fof(f56,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( segmentP(X0,X1)
=> segmentP(app(app(X2,X0),X3),X1) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax56) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ( ~ memberP(X6,X4)
& ~ memberP(X5,X4) )
| app(app(X5,cons(X4,nil)),X6) != X0 ) ) ) )
| X0 != X2
| X1 != X3
| nil != X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ( ~ memberP(X6,X4)
& ~ memberP(X5,X4) )
| app(app(X5,cons(X4,nil)),X6) != X0 ) ) ) )
| X0 != X2
| X1 != X3
| nil != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f99,plain,
! [X0] :
( ! [X1] :
( ( memberP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(X2,cons(X1,X3)) = X0
& ssList(X3) )
& ssList(X2) ) )
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f119,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f132,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f146,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( memberP(app(X1,X2),X0)
<=> ( memberP(X2,X0)
| memberP(X1,X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f36]) ).
fof(f148,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f173,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( segmentP(app(app(X2,X0),X3),X1)
| ~ segmentP(X0,X1)
| ~ ssList(X3) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f56]) ).
fof(f174,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( segmentP(app(app(X2,X0),X3),X1)
| ~ segmentP(X0,X1)
| ~ ssList(X3) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f173]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ( memberP(X6,X4)
| memberP(X5,X4) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& X0 = X2
& X1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ( memberP(X6,X4)
| memberP(X5,X4) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& X0 = X2
& X1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f236,plain,
! [X0] :
( ! [X1] :
( ( ( memberP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(X2,cons(X1,X3)) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X2] :
( ? [X3] :
( app(X2,cons(X1,X3)) = X0
& ssList(X3) )
& ssList(X2) )
| ~ memberP(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f99]) ).
fof(f237,plain,
! [X0] :
( ! [X1] :
( ( ( memberP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(X2,cons(X1,X3)) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X4] :
( ? [X5] :
( app(X4,cons(X1,X5)) = X0
& ssList(X5) )
& ssList(X4) )
| ~ memberP(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f236]) ).
fof(f238,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(X4,cons(X1,X5)) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( app(sK8(X0,X1),cons(X1,X5)) = X0
& ssList(X5) )
& ssList(sK8(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f239,plain,
! [X0,X1] :
( ? [X5] :
( app(sK8(X0,X1),cons(X1,X5)) = X0
& ssList(X5) )
=> ( app(sK8(X0,X1),cons(X1,sK9(X0,X1))) = X0
& ssList(sK9(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f240,plain,
! [X0] :
( ! [X1] :
( ( ( memberP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(X2,cons(X1,X3)) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ( app(sK8(X0,X1),cons(X1,sK9(X0,X1))) = X0
& ssList(sK9(X0,X1))
& ssList(sK8(X0,X1)) )
| ~ memberP(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8,sK9])],[f237,f239,f238]) ).
fof(f322,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(app(X1,X2),X0)
| ( ~ memberP(X2,X0)
& ~ memberP(X1,X0) ) )
& ( memberP(X2,X0)
| memberP(X1,X0)
| ~ memberP(app(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f146]) ).
fof(f323,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(app(X1,X2),X0)
| ( ~ memberP(X2,X0)
& ~ memberP(X1,X0) ) )
& ( memberP(X2,X0)
| memberP(X1,X0)
| ~ memberP(app(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f322]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ( memberP(X6,X4)
| memberP(X5,X4) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& X0 = X2
& X1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ( memberP(X6,X4)
| memberP(X5,X4) )
& app(app(X5,cons(X4,nil)),X6) = sK53
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& sK53 = X2
& X1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ( memberP(X6,X4)
| memberP(X5,X4) )
& app(app(X5,cons(X4,nil)),X6) = sK53
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& sK53 = X2
& X1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ( memberP(X6,X4)
| memberP(X5,X4) )
& app(app(X5,cons(X4,nil)),X6) = sK53
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& sK53 = X2
& sK54 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ( memberP(X6,X4)
| memberP(X5,X4) )
& app(app(X5,cons(X4,nil)),X6) = sK53
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& sK53 = X2
& sK54 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ( memberP(X6,X4)
| memberP(X5,X4) )
& app(app(X5,cons(X4,nil)),X6) = sK53
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& sK53 = sK55
& sK54 = X3
& nil = sK55
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ( memberP(X6,X4)
| memberP(X5,X4) )
& app(app(X5,cons(X4,nil)),X6) = sK53
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& sK53 = sK55
& sK54 = X3
& nil = sK55
& ssList(X3) )
=> ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ( memberP(X6,X4)
| memberP(X5,X4) )
& app(app(X5,cons(X4,nil)),X6) = sK53
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& sK53 = sK55
& sK54 = sK56
& nil = sK55
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ( memberP(X6,X4)
| memberP(X5,X4) )
& app(app(X5,cons(X4,nil)),X6) = sK53
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
=> ( ? [X5] :
( ? [X6] :
( ( memberP(X6,sK57)
| memberP(X5,sK57) )
& sK53 = app(app(X5,cons(sK57,nil)),X6)
& ssList(X6) )
& ssList(X5) )
& ssItem(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ? [X5] :
( ? [X6] :
( ( memberP(X6,sK57)
| memberP(X5,sK57) )
& sK53 = app(app(X5,cons(sK57,nil)),X6)
& ssList(X6) )
& ssList(X5) )
=> ( ? [X6] :
( ( memberP(X6,sK57)
| memberP(sK58,sK57) )
& sK53 = app(app(sK58,cons(sK57,nil)),X6)
& ssList(X6) )
& ssList(sK58) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
( ? [X6] :
( ( memberP(X6,sK57)
| memberP(sK58,sK57) )
& sK53 = app(app(sK58,cons(sK57,nil)),X6)
& ssList(X6) )
=> ( ( memberP(sK59,sK57)
| memberP(sK58,sK57) )
& sK53 = app(app(sK58,cons(sK57,nil)),sK59)
& ssList(sK59) ) ),
introduced(choice_axiom,[]) ).
fof(f350,plain,
( ( memberP(sK59,sK57)
| memberP(sK58,sK57) )
& sK53 = app(app(sK58,cons(sK57,nil)),sK59)
& ssList(sK59)
& ssList(sK58)
& ssItem(sK57)
& sK53 = sK55
& sK54 = sK56
& nil = sK55
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57,sK58,sK59])],[f222,f349,f348,f347,f346,f345,f344,f343]) ).
fof(f359,plain,
! [X2,X3,X0,X1] :
( memberP(X0,X1)
| app(X2,cons(X1,X3)) != X0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f240]) ).
fof(f442,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f455,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f468,plain,
! [X2,X0,X1] :
( memberP(app(X1,X2),X0)
| ~ memberP(X1,X0)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f323]) ).
fof(f469,plain,
! [X2,X0,X1] :
( memberP(app(X1,X2),X0)
| ~ memberP(X2,X0)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f323]) ).
fof(f473,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f148]) ).
fof(f495,plain,
! [X2,X3,X0,X1] :
( segmentP(app(app(X2,X0),X3),X1)
| ~ segmentP(X0,X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f174]) ).
fof(f550,plain,
ssList(sK53),
inference(cnf_transformation,[],[f350]) ).
fof(f554,plain,
nil = sK55,
inference(cnf_transformation,[],[f350]) ).
fof(f556,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f350]) ).
fof(f557,plain,
ssItem(sK57),
inference(cnf_transformation,[],[f350]) ).
fof(f558,plain,
ssList(sK58),
inference(cnf_transformation,[],[f350]) ).
fof(f559,plain,
ssList(sK59),
inference(cnf_transformation,[],[f350]) ).
fof(f560,plain,
sK53 = app(app(sK58,cons(sK57,nil)),sK59),
inference(cnf_transformation,[],[f350]) ).
fof(f572,plain,
! [X0] :
( ~ memberP(sK55,X0)
| ~ ssItem(X0) ),
inference(definition_unfolding,[],[f473,f554]) ).
fof(f620,plain,
sK55 = app(app(sK58,cons(sK57,sK55)),sK59),
inference(definition_unfolding,[],[f560,f556,f554]) ).
fof(f622,plain,
ssList(sK55),
inference(definition_unfolding,[],[f550,f556]) ).
fof(f624,plain,
! [X2,X3,X1] :
( memberP(app(X2,cons(X1,X3)),X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssList(app(X2,cons(X1,X3))) ),
inference(equality_resolution,[],[f359]) ).
cnf(c_54,plain,
( ~ ssList(app(X0,cons(X1,X2)))
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| memberP(app(X0,cons(X1,X2)),X1) ),
inference(cnf_transformation,[],[f624]) ).
cnf(c_140,plain,
( ~ ssItem(X0)
| ~ ssList(X1)
| ssList(cons(X0,X1)) ),
inference(cnf_transformation,[],[f442]) ).
cnf(c_153,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f455]) ).
cnf(c_165,plain,
( ~ memberP(X0,X1)
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| memberP(app(X2,X0),X1) ),
inference(cnf_transformation,[],[f469]) ).
cnf(c_166,plain,
( ~ memberP(X0,X1)
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| memberP(app(X0,X2),X1) ),
inference(cnf_transformation,[],[f468]) ).
cnf(c_171,negated_conjecture,
( ~ memberP(sK55,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f572]) ).
cnf(c_193,plain,
( ~ segmentP(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| segmentP(app(app(X2,X0),X3),X1) ),
inference(cnf_transformation,[],[f495]) ).
cnf(c_247,negated_conjecture,
app(app(sK58,cons(sK57,sK55)),sK59) = sK55,
inference(cnf_transformation,[],[f620]) ).
cnf(c_248,negated_conjecture,
ssList(sK59),
inference(cnf_transformation,[],[f559]) ).
cnf(c_249,negated_conjecture,
ssList(sK58),
inference(cnf_transformation,[],[f558]) ).
cnf(c_250,negated_conjecture,
ssItem(sK57),
inference(cnf_transformation,[],[f557]) ).
cnf(c_254,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f622]) ).
cnf(c_12151,plain,
( ~ memberP(app(sK58,cons(sK57,sK55)),X0)
| ~ ssList(app(sK58,cons(sK57,sK55)))
| ~ ssItem(X0)
| ~ ssList(sK59)
| memberP(sK55,X0) ),
inference(superposition,[status(thm)],[c_247,c_166]) ).
cnf(c_12164,plain,
( ~ ssList(app(sK58,cons(sK57,sK55)))
| ~ memberP(sK59,X0)
| ~ ssItem(X0)
| ~ ssList(sK59)
| memberP(sK55,X0) ),
inference(superposition,[status(thm)],[c_247,c_165]) ).
cnf(c_12555,plain,
( ~ segmentP(cons(sK57,sK55),X0)
| ~ ssList(cons(sK57,sK55))
| ~ ssList(X0)
| ~ ssList(sK59)
| ~ ssList(sK58)
| segmentP(sK55,X0) ),
inference(superposition,[status(thm)],[c_247,c_193]) ).
cnf(c_15568,plain,
( ~ memberP(app(sK58,cons(sK57,sK55)),X0)
| ~ ssList(app(sK58,cons(sK57,sK55)))
| ~ ssItem(X0) ),
inference(global_subsumption_just,[status(thm)],[c_12151,c_248,c_171,c_12151]) ).
cnf(c_15577,plain,
( ~ ssList(app(sK58,cons(sK57,sK55)))
| ~ ssItem(sK57)
| ~ ssList(sK55)
| ~ ssList(sK58) ),
inference(superposition,[status(thm)],[c_54,c_15568]) ).
cnf(c_15582,plain,
~ ssList(app(sK58,cons(sK57,sK55))),
inference(global_subsumption_just,[status(thm)],[c_12164,c_254,c_250,c_249,c_15577]) ).
cnf(c_15584,plain,
( ~ ssList(cons(sK57,sK55))
| ~ ssList(sK58) ),
inference(superposition,[status(thm)],[c_153,c_15582]) ).
cnf(c_16489,plain,
~ ssList(cons(sK57,sK55)),
inference(global_subsumption_just,[status(thm)],[c_12555,c_249,c_15584]) ).
cnf(c_16491,plain,
( ~ ssItem(sK57)
| ~ ssList(sK55) ),
inference(superposition,[status(thm)],[c_140,c_16489]) ).
cnf(c_16492,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_16491,c_250,c_254]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC182+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n018.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:23:17 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.48/1.17 % SZS status Started for theBenchmark.p
% 0.48/1.17 % SZS status Theorem for theBenchmark.p
% 0.48/1.17
% 0.48/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.48/1.17
% 0.48/1.17 ------ iProver source info
% 0.48/1.17
% 0.48/1.17 git: date: 2023-05-31 18:12:56 +0000
% 0.48/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.48/1.17 git: non_committed_changes: false
% 0.48/1.17 git: last_make_outside_of_git: false
% 0.48/1.17
% 0.48/1.17 ------ Parsing...
% 0.48/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.48/1.17
% 0.48/1.17 ------ 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: 4 0s sf_e pe_s pe_e
% 0.48/1.17
% 0.48/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.48/1.17
% 0.48/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.48/1.17 ------ Proving...
% 0.48/1.17 ------ Problem Properties
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17 clauses 186
% 0.48/1.17 conjectures 54
% 0.48/1.17 EPR 54
% 0.48/1.17 Horn 117
% 0.48/1.17 unary 21
% 0.48/1.17 binary 41
% 0.48/1.17 lits 625
% 0.48/1.17 lits eq 79
% 0.48/1.17 fd_pure 0
% 0.48/1.17 fd_pseudo 0
% 0.48/1.17 fd_cond 21
% 0.48/1.17 fd_pseudo_cond 14
% 0.48/1.17 AC symbols 0
% 0.48/1.17
% 0.48/1.17 ------ Input Options Time Limit: Unbounded
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17 ------
% 0.48/1.17 Current options:
% 0.48/1.17 ------
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17 ------ Proving...
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17 % SZS status Theorem for theBenchmark.p
% 0.48/1.17
% 0.48/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.48/1.17
% 0.48/1.17
%------------------------------------------------------------------------------