TSTP Solution File: SWC279+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC279+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n012.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:42:13 EDT 2023
% Result : Theorem 3.95s 1.21s
% Output : CNFRefutation 3.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 9
% Syntax : Number of formulae : 51 ( 17 unt; 0 def)
% Number of atoms : 470 ( 70 equ)
% Maximal formula atoms : 48 ( 9 avg)
% Number of connectives : 606 ( 187 ~; 168 |; 219 &)
% ( 0 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 180 ( 0 sgn; 76 !; 92 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( ! [X11] :
( ssItem(X11)
=> ( ( leq(X8,X11)
| ~ memberP(X10,X11) )
& ( leq(X11,X8)
| ~ memberP(X9,X11) ) ) )
| app(app(X9,cons(X8,nil)),X10) != X0 ) ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ( ( memberP(X5,X7)
& ~ leq(X7,X4) )
| ( memberP(X6,X7)
& ~ leq(X4,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| 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)
=> ( ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( ! [X11] :
( ssItem(X11)
=> ( ( leq(X8,X11)
| ~ memberP(X10,X11) )
& ( leq(X11,X8)
| ~ memberP(X9,X11) ) ) )
| app(app(X9,cons(X8,nil)),X10) != X0 ) ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ( ( memberP(X5,X7)
& ~ leq(X7,X4) )
| ( memberP(X6,X7)
& ~ leq(X4,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ! [X7] :
( ssItem(X7)
=> ( ( leq(X4,X7)
| ~ memberP(X6,X7) )
& ( leq(X7,X4)
| ~ memberP(X5,X7) ) ) )
| app(app(X5,cons(X4,nil)),X6) != X0 ) ) ) )
| ? [X8] :
( ? [X9] :
( ? [X10] :
( ? [X11] :
( ( ( memberP(X9,X11)
& ~ leq(X11,X8) )
| ( memberP(X10,X11)
& ~ leq(X8,X11) ) )
& ssItem(X11) )
& app(app(X9,cons(X8,nil)),X10) = X2
& ssList(X10) )
& ssList(X9) )
& ssItem(X8) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ( ( ~ leq(X4,X7)
& memberP(X6,X7) )
| ( ~ leq(X7,X4)
& memberP(X5,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ! [X11] :
( ( ( ~ memberP(X9,X11)
| leq(X11,X8) )
& ( ~ memberP(X10,X11)
| leq(X8,X11) ) )
| ~ ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != X2
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f223,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ( ( ~ leq(X4,X7)
& memberP(X6,X7) )
| ( ~ leq(X7,X4)
& memberP(X5,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ! [X11] :
( ( ( ~ memberP(X9,X11)
| leq(X11,X8) )
& ( ~ memberP(X10,X11)
| leq(X8,X11) ) )
| ~ ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != X2
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f222]) ).
fof(f344,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ( ( ~ leq(X4,X7)
& memberP(X6,X7) )
| ( ~ leq(X7,X4)
& memberP(X5,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ! [X11] :
( ( ( ~ memberP(X9,X11)
| leq(X11,X8) )
& ( ~ memberP(X10,X11)
| leq(X8,X11) ) )
| ~ ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != X2
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ( ( ~ leq(X4,X7)
& memberP(X6,X7) )
| ( ~ leq(X7,X4)
& memberP(X5,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK53
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ! [X11] :
( ( ( ~ memberP(X9,X11)
| leq(X11,X8) )
& ( ~ memberP(X10,X11)
| leq(X8,X11) ) )
| ~ ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != X2
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ( ( ~ leq(X4,X7)
& memberP(X6,X7) )
| ( ~ leq(X7,X4)
& memberP(X5,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK53
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ! [X11] :
( ( ( ~ memberP(X9,X11)
| leq(X11,X8) )
& ( ~ memberP(X10,X11)
| leq(X8,X11) ) )
| ~ ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != X2
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ( ( ~ leq(X4,X7)
& memberP(X6,X7) )
| ( ~ leq(X7,X4)
& memberP(X5,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK53
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ! [X11] :
( ( ( ~ memberP(X9,X11)
| leq(X11,X8) )
& ( ~ memberP(X10,X11)
| leq(X8,X11) ) )
| ~ ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != X2
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ( ( ~ leq(X4,X7)
& memberP(X6,X7) )
| ( ~ leq(X7,X4)
& memberP(X5,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK53
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ! [X11] :
( ( ( ~ memberP(X9,X11)
| leq(X11,X8) )
& ( ~ memberP(X10,X11)
| leq(X8,X11) ) )
| ~ ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != X2
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ( ( ~ leq(X4,X7)
& memberP(X6,X7) )
| ( ~ leq(X7,X4)
& memberP(X5,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK53
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ! [X11] :
( ( ( ~ memberP(X9,X11)
| leq(X11,X8) )
& ( ~ memberP(X10,X11)
| leq(X8,X11) ) )
| ~ ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != sK55
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ( ( ~ leq(X4,X7)
& memberP(X6,X7) )
| ( ~ leq(X7,X4)
& memberP(X5,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK53
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ! [X11] :
( ( ( ~ memberP(X9,X11)
| leq(X11,X8) )
& ( ~ memberP(X10,X11)
| leq(X8,X11) ) )
| ~ ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != sK55
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ( ( ~ leq(X4,X7)
& memberP(X6,X7) )
| ( ~ leq(X7,X4)
& memberP(X5,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK53
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ! [X11] :
( ( ( ~ memberP(X9,X11)
| leq(X11,X8) )
& ( ~ memberP(X10,X11)
| leq(X8,X11) ) )
| ~ ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != sK55
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ( ( ~ leq(X4,X7)
& memberP(X6,X7) )
| ( ~ leq(X7,X4)
& memberP(X5,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK53
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( ( ( ~ leq(sK57,X7)
& memberP(X6,X7) )
| ( ~ leq(X7,sK57)
& memberP(X5,X7) ) )
& ssItem(X7) )
& sK53 = app(app(X5,cons(sK57,nil)),X6)
& ssList(X6) )
& ssList(X5) )
& ssItem(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ( ( ~ leq(sK57,X7)
& memberP(X6,X7) )
| ( ~ leq(X7,sK57)
& memberP(X5,X7) ) )
& ssItem(X7) )
& sK53 = app(app(X5,cons(sK57,nil)),X6)
& ssList(X6) )
& ssList(X5) )
=> ( ? [X6] :
( ? [X7] :
( ( ( ~ leq(sK57,X7)
& memberP(X6,X7) )
| ( ~ leq(X7,sK57)
& memberP(sK58,X7) ) )
& ssItem(X7) )
& sK53 = app(app(sK58,cons(sK57,nil)),X6)
& ssList(X6) )
& ssList(sK58) ) ),
introduced(choice_axiom,[]) ).
fof(f350,plain,
( ? [X6] :
( ? [X7] :
( ( ( ~ leq(sK57,X7)
& memberP(X6,X7) )
| ( ~ leq(X7,sK57)
& memberP(sK58,X7) ) )
& ssItem(X7) )
& sK53 = app(app(sK58,cons(sK57,nil)),X6)
& ssList(X6) )
=> ( ? [X7] :
( ( ( ~ leq(sK57,X7)
& memberP(sK59,X7) )
| ( ~ leq(X7,sK57)
& memberP(sK58,X7) ) )
& ssItem(X7) )
& sK53 = app(app(sK58,cons(sK57,nil)),sK59)
& ssList(sK59) ) ),
introduced(choice_axiom,[]) ).
fof(f351,plain,
( ? [X7] :
( ( ( ~ leq(sK57,X7)
& memberP(sK59,X7) )
| ( ~ leq(X7,sK57)
& memberP(sK58,X7) ) )
& ssItem(X7) )
=> ( ( ( ~ leq(sK57,sK60)
& memberP(sK59,sK60) )
| ( ~ leq(sK60,sK57)
& memberP(sK58,sK60) ) )
& ssItem(sK60) ) ),
introduced(choice_axiom,[]) ).
fof(f352,plain,
( ( ( ~ leq(sK57,sK60)
& memberP(sK59,sK60) )
| ( ~ leq(sK60,sK57)
& memberP(sK58,sK60) ) )
& ssItem(sK60)
& sK53 = app(app(sK58,cons(sK57,nil)),sK59)
& ssList(sK59)
& ssList(sK58)
& ssItem(sK57)
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ! [X11] :
( ( ( ~ memberP(X9,X11)
| leq(X11,X8) )
& ( ~ memberP(X10,X11)
| leq(X8,X11) ) )
| ~ ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != sK55
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57,sK58,sK59,sK60])],[f223,f351,f350,f349,f348,f347,f346,f345,f344]) ).
fof(f557,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f352]) ).
fof(f558,plain,
! [X10,X11,X8,X9] :
( ~ memberP(X10,X11)
| leq(X8,X11)
| ~ ssItem(X11)
| app(app(X9,cons(X8,nil)),X10) != sK55
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssItem(X8) ),
inference(cnf_transformation,[],[f352]) ).
fof(f559,plain,
! [X10,X11,X8,X9] :
( ~ memberP(X9,X11)
| leq(X11,X8)
| ~ ssItem(X11)
| app(app(X9,cons(X8,nil)),X10) != sK55
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssItem(X8) ),
inference(cnf_transformation,[],[f352]) ).
fof(f560,plain,
ssItem(sK57),
inference(cnf_transformation,[],[f352]) ).
fof(f561,plain,
ssList(sK58),
inference(cnf_transformation,[],[f352]) ).
fof(f562,plain,
ssList(sK59),
inference(cnf_transformation,[],[f352]) ).
fof(f563,plain,
sK53 = app(app(sK58,cons(sK57,nil)),sK59),
inference(cnf_transformation,[],[f352]) ).
fof(f564,plain,
ssItem(sK60),
inference(cnf_transformation,[],[f352]) ).
fof(f565,plain,
( memberP(sK59,sK60)
| memberP(sK58,sK60) ),
inference(cnf_transformation,[],[f352]) ).
fof(f566,plain,
( memberP(sK59,sK60)
| ~ leq(sK60,sK57) ),
inference(cnf_transformation,[],[f352]) ).
fof(f567,plain,
( ~ leq(sK57,sK60)
| memberP(sK58,sK60) ),
inference(cnf_transformation,[],[f352]) ).
fof(f568,plain,
( ~ leq(sK57,sK60)
| ~ leq(sK60,sK57) ),
inference(cnf_transformation,[],[f352]) ).
fof(f569,plain,
sK55 = app(app(sK58,cons(sK57,nil)),sK59),
inference(definition_unfolding,[],[f563,f557]) ).
cnf(c_246,negated_conjecture,
( ~ leq(sK57,sK60)
| ~ leq(sK60,sK57) ),
inference(cnf_transformation,[],[f568]) ).
cnf(c_247,negated_conjecture,
( ~ leq(sK57,sK60)
| memberP(sK58,sK60) ),
inference(cnf_transformation,[],[f567]) ).
cnf(c_248,negated_conjecture,
( ~ leq(sK60,sK57)
| memberP(sK59,sK60) ),
inference(cnf_transformation,[],[f566]) ).
cnf(c_249,negated_conjecture,
( memberP(sK58,sK60)
| memberP(sK59,sK60) ),
inference(cnf_transformation,[],[f565]) ).
cnf(c_250,negated_conjecture,
ssItem(sK60),
inference(cnf_transformation,[],[f564]) ).
cnf(c_251,negated_conjecture,
app(app(sK58,cons(sK57,nil)),sK59) = sK55,
inference(cnf_transformation,[],[f569]) ).
cnf(c_252,negated_conjecture,
ssList(sK59),
inference(cnf_transformation,[],[f562]) ).
cnf(c_253,negated_conjecture,
ssList(sK58),
inference(cnf_transformation,[],[f561]) ).
cnf(c_254,negated_conjecture,
ssItem(sK57),
inference(cnf_transformation,[],[f560]) ).
cnf(c_255,negated_conjecture,
( app(app(X0,cons(X1,nil)),X2) != sK55
| ~ memberP(X0,X3)
| ~ ssItem(X1)
| ~ ssItem(X3)
| ~ ssList(X0)
| ~ ssList(X2)
| leq(X3,X1) ),
inference(cnf_transformation,[],[f559]) ).
cnf(c_256,negated_conjecture,
( app(app(X0,cons(X1,nil)),X2) != sK55
| ~ memberP(X2,X3)
| ~ ssItem(X1)
| ~ ssItem(X3)
| ~ ssList(X0)
| ~ ssList(X2)
| leq(X1,X3) ),
inference(cnf_transformation,[],[f558]) ).
cnf(c_11889,plain,
( ~ memberP(sK58,X0)
| ~ ssItem(X0)
| ~ ssItem(sK57)
| ~ ssList(sK58)
| ~ ssList(sK59)
| leq(X0,sK57) ),
inference(superposition,[status(thm)],[c_251,c_255]) ).
cnf(c_11890,plain,
( ~ memberP(sK58,X0)
| ~ ssItem(X0)
| leq(X0,sK57) ),
inference(forward_subsumption_resolution,[status(thm)],[c_11889,c_252,c_253,c_254]) ).
cnf(c_11909,plain,
( ~ memberP(sK59,X0)
| ~ ssItem(X0)
| ~ ssItem(sK57)
| ~ ssList(sK58)
| ~ ssList(sK59)
| leq(sK57,X0) ),
inference(superposition,[status(thm)],[c_251,c_256]) ).
cnf(c_11910,plain,
( ~ memberP(sK59,X0)
| ~ ssItem(X0)
| leq(sK57,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_11909,c_252,c_253,c_254]) ).
cnf(c_11927,plain,
( ~ ssItem(sK60)
| memberP(sK58,sK60)
| leq(sK57,sK60) ),
inference(superposition,[status(thm)],[c_249,c_11910]) ).
cnf(c_11928,plain,
( memberP(sK58,sK60)
| leq(sK57,sK60) ),
inference(forward_subsumption_resolution,[status(thm)],[c_11927,c_250]) ).
cnf(c_11931,plain,
memberP(sK58,sK60),
inference(global_subsumption_just,[status(thm)],[c_11928,c_247,c_11928]) ).
cnf(c_11933,plain,
( ~ ssItem(sK60)
| leq(sK60,sK57) ),
inference(superposition,[status(thm)],[c_11931,c_11890]) ).
cnf(c_11934,plain,
leq(sK60,sK57),
inference(forward_subsumption_resolution,[status(thm)],[c_11933,c_250]) ).
cnf(c_11935,plain,
memberP(sK59,sK60),
inference(backward_subsumption_resolution,[status(thm)],[c_248,c_11934]) ).
cnf(c_11937,plain,
( ~ ssItem(sK60)
| leq(sK57,sK60) ),
inference(superposition,[status(thm)],[c_11935,c_11910]) ).
cnf(c_11938,plain,
leq(sK57,sK60),
inference(forward_subsumption_resolution,[status(thm)],[c_11937,c_250]) ).
cnf(c_11939,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_11938,c_11934,c_246]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWC279+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.17/0.35 % Computer : n012.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Mon Aug 28 14:45:54 EDT 2023
% 0.21/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.95/1.21 % SZS status Started for theBenchmark.p
% 3.95/1.21 % SZS status Theorem for theBenchmark.p
% 3.95/1.21
% 3.95/1.21 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.95/1.21
% 3.95/1.21 ------ iProver source info
% 3.95/1.21
% 3.95/1.21 git: date: 2023-05-31 18:12:56 +0000
% 3.95/1.21 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.95/1.21 git: non_committed_changes: false
% 3.95/1.21 git: last_make_outside_of_git: false
% 3.95/1.21
% 3.95/1.21 ------ Parsing...
% 3.95/1.21 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.95/1.21
% 3.95/1.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: 4 0s sf_e pe_s pe_e
% 3.95/1.21
% 3.95/1.21 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.95/1.21
% 3.95/1.21 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.95/1.21 ------ Proving...
% 3.95/1.21 ------ Problem Properties
% 3.95/1.21
% 3.95/1.21
% 3.95/1.21 clauses 193
% 3.95/1.21 conjectures 13
% 3.95/1.21 EPR 59
% 3.95/1.21 Horn 124
% 3.95/1.21 unary 23
% 3.95/1.21 binary 44
% 3.95/1.21 lits 647
% 3.95/1.21 lits eq 81
% 3.95/1.21 fd_pure 0
% 3.95/1.21 fd_pseudo 0
% 3.95/1.21 fd_cond 21
% 3.95/1.21 fd_pseudo_cond 14
% 3.95/1.21 AC symbols 0
% 3.95/1.21
% 3.95/1.21 ------ Schedule dynamic 5 is on
% 3.95/1.21
% 3.95/1.21 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.95/1.21
% 3.95/1.21
% 3.95/1.21 ------
% 3.95/1.21 Current options:
% 3.95/1.21 ------
% 3.95/1.21
% 3.95/1.21
% 3.95/1.21
% 3.95/1.21
% 3.95/1.21 ------ Proving...
% 3.95/1.21
% 3.95/1.21
% 3.95/1.21 % SZS status Theorem for theBenchmark.p
% 3.95/1.21
% 3.95/1.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.95/1.21
% 3.95/1.21
%------------------------------------------------------------------------------