TSTP Solution File: SWC010+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC010+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:40:16 EDT 2023
% Result : Theorem 1.02s 1.35s
% Output : CNFRefutation 1.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 56 ( 10 unt; 0 def)
% Number of atoms : 407 ( 133 equ)
% Maximal formula atoms : 23 ( 7 avg)
% Number of connectives : 524 ( 173 ~; 161 |; 162 &)
% ( 0 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 8 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 228 ( 24 sgn; 111 !; 64 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( ? [X10] :
( geq(X10,X7)
& memberP(X3,X10)
& X7 != X10
& ssItem(X10) )
| app(X8,X9) != X2
| app(app(X8,cons(X7,nil)),X9) != X3 ) ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X5,X6) = X0
& app(app(X5,cons(X4,nil)),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssItem(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)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( ? [X10] :
( geq(X10,X7)
& memberP(X3,X10)
& X7 != X10
& ssItem(X10) )
| app(X8,X9) != X2
| app(app(X8,cons(X7,nil)),X9) != X3 ) ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X5,X6) = X0
& app(app(X5,cons(X4,nil)),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssItem(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)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ? [X7] :
( geq(X7,X4)
& memberP(X3,X7)
& X4 != X7
& ssItem(X7) )
| app(X5,X6) != X2
| app(app(X5,cons(X4,nil)),X6) != X3 ) ) ) )
| ? [X8] :
( ? [X9] :
( ? [X10] :
( app(X9,X10) = X0
& app(app(X9,cons(X8,nil)),X10) = X1
& ssList(X10) )
& ssList(X9) )
& ssItem(X8) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ geq(X7,X4)
| ~ memberP(X3,X7)
| X4 = X7
| ~ ssItem(X7) )
& app(X5,X6) = X2
& app(app(X5,cons(X4,nil)),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( app(X9,X10) != X0
| app(app(X9,cons(X8,nil)),X10) != X1
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& 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] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ geq(X7,X4)
| ~ memberP(X3,X7)
| X4 = X7
| ~ ssItem(X7) )
& app(X5,X6) = X2
& app(app(X5,cons(X4,nil)),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( app(X9,X10) != X0
| app(app(X9,cons(X8,nil)),X10) != X1
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f222]) ).
fof(f233,plain,
! [X3,X2,X0,X1] :
( ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ geq(X7,X4)
| ~ memberP(X3,X7)
| X4 = X7
| ~ ssItem(X7) )
& app(X5,X6) = X2
& app(app(X5,cons(X4,nil)),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( app(X9,X10) != X0
| app(app(X9,cons(X8,nil)),X10) != X1
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& neq(X1,nil) )
| ~ sP6(X3,X2,X0,X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP6])]) ).
fof(f234,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP6(X3,X2,X0,X1) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f223,f233]) ).
fof(f346,plain,
! [X3,X2,X0,X1] :
( ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ geq(X7,X4)
| ~ memberP(X3,X7)
| X4 = X7
| ~ ssItem(X7) )
& app(X5,X6) = X2
& app(app(X5,cons(X4,nil)),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( app(X9,X10) != X0
| app(app(X9,cons(X8,nil)),X10) != X1
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& neq(X1,nil) )
| ~ sP6(X3,X2,X0,X1) ),
inference(nnf_transformation,[],[f233]) ).
fof(f347,plain,
! [X0,X1,X2,X3] :
( ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ geq(X7,X4)
| ~ memberP(X0,X7)
| X4 = X7
| ~ ssItem(X7) )
& app(X5,X6) = X1
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( app(X9,X10) != X2
| app(app(X9,cons(X8,nil)),X10) != X3
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& neq(X3,nil) )
| ~ sP6(X0,X1,X2,X3) ),
inference(rectify,[],[f346]) ).
fof(f348,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ geq(X7,X4)
| ~ memberP(X0,X7)
| X4 = X7
| ~ ssItem(X7) )
& app(X5,X6) = X1
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
=> ( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ geq(X7,sK54(X0,X1))
| ~ memberP(X0,X7)
| sK54(X0,X1) = X7
| ~ ssItem(X7) )
& app(X5,X6) = X1
& app(app(X5,cons(sK54(X0,X1),nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(sK54(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
! [X0,X1] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ geq(X7,sK54(X0,X1))
| ~ memberP(X0,X7)
| sK54(X0,X1) = X7
| ~ ssItem(X7) )
& app(X5,X6) = X1
& app(app(X5,cons(sK54(X0,X1),nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
=> ( ? [X6] :
( ! [X7] :
( ~ geq(X7,sK54(X0,X1))
| ~ memberP(X0,X7)
| sK54(X0,X1) = X7
| ~ ssItem(X7) )
& app(sK55(X0,X1),X6) = X1
& app(app(sK55(X0,X1),cons(sK54(X0,X1),nil)),X6) = X0
& ssList(X6) )
& ssList(sK55(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f350,plain,
! [X0,X1] :
( ? [X6] :
( ! [X7] :
( ~ geq(X7,sK54(X0,X1))
| ~ memberP(X0,X7)
| sK54(X0,X1) = X7
| ~ ssItem(X7) )
& app(sK55(X0,X1),X6) = X1
& app(app(sK55(X0,X1),cons(sK54(X0,X1),nil)),X6) = X0
& ssList(X6) )
=> ( ! [X7] :
( ~ geq(X7,sK54(X0,X1))
| ~ memberP(X0,X7)
| sK54(X0,X1) = X7
| ~ ssItem(X7) )
& app(sK55(X0,X1),sK56(X0,X1)) = X1
& app(app(sK55(X0,X1),cons(sK54(X0,X1),nil)),sK56(X0,X1)) = X0
& ssList(sK56(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f351,plain,
! [X0,X1,X2,X3] :
( ( ! [X7] :
( ~ geq(X7,sK54(X0,X1))
| ~ memberP(X0,X7)
| sK54(X0,X1) = X7
| ~ ssItem(X7) )
& app(sK55(X0,X1),sK56(X0,X1)) = X1
& app(app(sK55(X0,X1),cons(sK54(X0,X1),nil)),sK56(X0,X1)) = X0
& ssList(sK56(X0,X1))
& ssList(sK55(X0,X1))
& ssItem(sK54(X0,X1))
& ! [X8] :
( ! [X9] :
( ! [X10] :
( app(X9,X10) != X2
| app(app(X9,cons(X8,nil)),X10) != X3
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& neq(X3,nil) )
| ~ sP6(X0,X1,X2,X3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK54,sK55,sK56])],[f347,f350,f349,f348]) ).
fof(f352,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP6(X3,X2,X0,X1) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP6(X3,X2,sK57,X1) )
& sK57 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f353,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP6(X3,X2,sK57,X1) )
& sK57 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK58,nil) )
| sP6(X3,X2,sK57,sK58) )
& sK57 = X2
& sK58 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK58) ) ),
introduced(choice_axiom,[]) ).
fof(f354,plain,
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK58,nil) )
| sP6(X3,X2,sK57,sK58) )
& sK57 = X2
& sK58 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK58,nil) )
| sP6(X3,sK59,sK57,sK58) )
& sK57 = sK59
& sK58 = X3
& ssList(X3) )
& ssList(sK59) ) ),
introduced(choice_axiom,[]) ).
fof(f355,plain,
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK58,nil) )
| sP6(X3,sK59,sK57,sK58) )
& sK57 = sK59
& sK58 = X3
& ssList(X3) )
=> ( ( ( ~ neq(sK60,nil)
& neq(sK58,nil) )
| sP6(sK60,sK59,sK57,sK58) )
& sK57 = sK59
& sK58 = sK60
& ssList(sK60) ) ),
introduced(choice_axiom,[]) ).
fof(f356,plain,
( ( ( ~ neq(sK60,nil)
& neq(sK58,nil) )
| sP6(sK60,sK59,sK57,sK58) )
& sK57 = sK59
& sK58 = sK60
& ssList(sK60)
& ssList(sK59)
& ssList(sK58)
& ssList(sK57) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK57,sK58,sK59,sK60])],[f234,f355,f354,f353,f352]) ).
fof(f557,plain,
! [X2,X3,X10,X0,X1,X8,X9] :
( app(X9,X10) != X2
| app(app(X9,cons(X8,nil)),X10) != X3
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssItem(X8)
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f351]) ).
fof(f558,plain,
! [X2,X3,X0,X1] :
( ssItem(sK54(X0,X1))
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f351]) ).
fof(f559,plain,
! [X2,X3,X0,X1] :
( ssList(sK55(X0,X1))
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f351]) ).
fof(f560,plain,
! [X2,X3,X0,X1] :
( ssList(sK56(X0,X1))
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f351]) ).
fof(f561,plain,
! [X2,X3,X0,X1] :
( app(app(sK55(X0,X1),cons(sK54(X0,X1),nil)),sK56(X0,X1)) = X0
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f351]) ).
fof(f562,plain,
! [X2,X3,X0,X1] :
( app(sK55(X0,X1),sK56(X0,X1)) = X1
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f351]) ).
fof(f568,plain,
sK58 = sK60,
inference(cnf_transformation,[],[f356]) ).
fof(f569,plain,
sK57 = sK59,
inference(cnf_transformation,[],[f356]) ).
fof(f570,plain,
( neq(sK58,nil)
| sP6(sK60,sK59,sK57,sK58) ),
inference(cnf_transformation,[],[f356]) ).
fof(f571,plain,
( ~ neq(sK60,nil)
| sP6(sK60,sK59,sK57,sK58) ),
inference(cnf_transformation,[],[f356]) ).
fof(f572,plain,
( ~ neq(sK60,nil)
| sP6(sK60,sK59,sK59,sK60) ),
inference(definition_unfolding,[],[f571,f569,f568]) ).
fof(f573,plain,
( neq(sK60,nil)
| sP6(sK60,sK59,sK59,sK60) ),
inference(definition_unfolding,[],[f570,f568,f569,f568]) ).
fof(f603,plain,
! [X3,X10,X0,X1,X8,X9] :
( app(app(X9,cons(X8,nil)),X10) != X3
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssItem(X8)
| ~ sP6(X0,X1,app(X9,X10),X3) ),
inference(equality_resolution,[],[f557]) ).
fof(f604,plain,
! [X10,X0,X1,X8,X9] :
( ~ ssList(X10)
| ~ ssList(X9)
| ~ ssItem(X8)
| ~ sP6(X0,X1,app(X9,X10),app(app(X9,cons(X8,nil)),X10)) ),
inference(equality_resolution,[],[f603]) ).
cnf(c_247,plain,
( ~ sP6(X0,X1,X2,X3)
| app(sK55(X0,X1),sK56(X0,X1)) = X1 ),
inference(cnf_transformation,[],[f562]) ).
cnf(c_248,plain,
( ~ sP6(X0,X1,X2,X3)
| app(app(sK55(X0,X1),cons(sK54(X0,X1),nil)),sK56(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f561]) ).
cnf(c_249,plain,
( ~ sP6(X0,X1,X2,X3)
| ssList(sK56(X0,X1)) ),
inference(cnf_transformation,[],[f560]) ).
cnf(c_250,plain,
( ~ sP6(X0,X1,X2,X3)
| ssList(sK55(X0,X1)) ),
inference(cnf_transformation,[],[f559]) ).
cnf(c_251,plain,
( ~ sP6(X0,X1,X2,X3)
| ssItem(sK54(X0,X1)) ),
inference(cnf_transformation,[],[f558]) ).
cnf(c_252,plain,
( ~ sP6(X0,X1,app(X2,X3),app(app(X2,cons(X4,nil)),X3))
| ~ ssItem(X4)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(cnf_transformation,[],[f604]) ).
cnf(c_254,negated_conjecture,
( ~ neq(sK60,nil)
| sP6(sK60,sK59,sK59,sK60) ),
inference(cnf_transformation,[],[f572]) ).
cnf(c_255,negated_conjecture,
( sP6(sK60,sK59,sK59,sK60)
| neq(sK60,nil) ),
inference(cnf_transformation,[],[f573]) ).
cnf(c_379,negated_conjecture,
sP6(sK60,sK59,sK59,sK60),
inference(global_subsumption_just,[status(thm)],[c_255,c_255,c_254]) ).
cnf(c_381,negated_conjecture,
sP6(sK60,sK59,sK59,sK60),
inference(global_subsumption_just,[status(thm)],[c_254,c_379]) ).
cnf(c_3295,plain,
( X0 != sK60
| X1 != sK59
| X2 != sK59
| X3 != sK60
| ssItem(sK54(X0,X1)) ),
inference(resolution_lifted,[status(thm)],[c_251,c_381]) ).
cnf(c_3296,plain,
ssItem(sK54(sK60,sK59)),
inference(unflattening,[status(thm)],[c_3295]) ).
cnf(c_3300,plain,
( X0 != sK60
| X1 != sK59
| X2 != sK59
| X3 != sK60
| ssList(sK55(X0,X1)) ),
inference(resolution_lifted,[status(thm)],[c_250,c_381]) ).
cnf(c_3301,plain,
ssList(sK55(sK60,sK59)),
inference(unflattening,[status(thm)],[c_3300]) ).
cnf(c_3305,plain,
( X0 != sK60
| X1 != sK59
| X2 != sK59
| X3 != sK60
| ssList(sK56(X0,X1)) ),
inference(resolution_lifted,[status(thm)],[c_249,c_381]) ).
cnf(c_3306,plain,
ssList(sK56(sK60,sK59)),
inference(unflattening,[status(thm)],[c_3305]) ).
cnf(c_3310,plain,
( X0 != sK60
| X1 != sK59
| X2 != sK59
| X3 != sK60
| app(app(sK55(X0,X1),cons(sK54(X0,X1),nil)),sK56(X0,X1)) = X0 ),
inference(resolution_lifted,[status(thm)],[c_248,c_381]) ).
cnf(c_3311,plain,
app(app(sK55(sK60,sK59),cons(sK54(sK60,sK59),nil)),sK56(sK60,sK59)) = sK60,
inference(unflattening,[status(thm)],[c_3310]) ).
cnf(c_3315,plain,
( X0 != sK60
| X1 != sK59
| X2 != sK59
| X3 != sK60
| app(sK55(X0,X1),sK56(X0,X1)) = X1 ),
inference(resolution_lifted,[status(thm)],[c_247,c_381]) ).
cnf(c_3316,plain,
app(sK55(sK60,sK59),sK56(sK60,sK59)) = sK59,
inference(unflattening,[status(thm)],[c_3315]) ).
cnf(c_3335,plain,
( app(app(X0,cons(X1,nil)),X2) != sK60
| app(X0,X2) != sK59
| X3 != sK60
| X4 != sK59
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2) ),
inference(resolution_lifted,[status(thm)],[c_252,c_381]) ).
cnf(c_3336,plain,
( app(app(X0,cons(X1,nil)),X2) != sK60
| app(X0,X2) != sK59
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2) ),
inference(unflattening,[status(thm)],[c_3335]) ).
cnf(c_11921,plain,
( app(sK55(sK60,sK59),sK56(sK60,sK59)) != sK59
| ~ ssItem(sK54(sK60,sK59))
| ~ ssList(sK55(sK60,sK59))
| ~ ssList(sK56(sK60,sK59)) ),
inference(superposition,[status(thm)],[c_3311,c_3336]) ).
cnf(c_11922,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11921,c_3306,c_3301,c_3296,c_3316]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.18 % Problem : SWC010+1 : TPTP v8.1.2. Released v2.4.0.
% 0.05/0.20 % Command : run_iprover %s %d THM
% 0.08/0.44 % Computer : n012.cluster.edu
% 0.08/0.44 % Model : x86_64 x86_64
% 0.08/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.44 % Memory : 8042.1875MB
% 0.08/0.44 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.44 % CPULimit : 300
% 0.08/0.44 % WCLimit : 300
% 0.08/0.44 % DateTime : Mon Aug 28 17:55:09 EDT 2023
% 0.08/0.44 % CPUTime :
% 0.14/0.57 Running first-order theorem proving
% 0.14/0.57 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.02/1.35 % SZS status Started for theBenchmark.p
% 1.02/1.35 % SZS status Theorem for theBenchmark.p
% 1.02/1.35
% 1.02/1.35 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.02/1.35
% 1.02/1.35 ------ iProver source info
% 1.02/1.35
% 1.02/1.35 git: date: 2023-05-31 18:12:56 +0000
% 1.02/1.35 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.02/1.35 git: non_committed_changes: false
% 1.02/1.35 git: last_make_outside_of_git: false
% 1.02/1.35
% 1.02/1.35 ------ Parsing...
% 1.02/1.35 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.02/1.35
% 1.02/1.35 ------ 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
% 1.02/1.35
% 1.02/1.35 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.02/1.35
% 1.02/1.35 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.02/1.35 ------ Proving...
% 1.02/1.35 ------ Problem Properties
% 1.02/1.35
% 1.02/1.35
% 1.02/1.35 clauses 190
% 1.02/1.35 conjectures 2
% 1.02/1.35 EPR 52
% 1.02/1.35 Horn 122
% 1.02/1.35 unary 24
% 1.02/1.35 binary 40
% 1.02/1.35 lits 635
% 1.02/1.35 lits eq 84
% 1.02/1.35 fd_pure 0
% 1.02/1.35 fd_pseudo 0
% 1.02/1.35 fd_cond 22
% 1.02/1.35 fd_pseudo_cond 14
% 1.02/1.35 AC symbols 0
% 1.02/1.35
% 1.02/1.35 ------ Schedule dynamic 5 is on
% 1.02/1.35
% 1.02/1.35 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.02/1.35
% 1.02/1.35
% 1.02/1.35 ------
% 1.02/1.35 Current options:
% 1.02/1.35 ------
% 1.02/1.35
% 1.02/1.35
% 1.02/1.35
% 1.02/1.35
% 1.02/1.35 ------ Proving...
% 1.02/1.35
% 1.02/1.35
% 1.02/1.35 % SZS status Theorem for theBenchmark.p
% 1.02/1.35
% 1.02/1.35 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.02/1.35
% 1.02/1.35
%------------------------------------------------------------------------------