TSTP Solution File: SWC417+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC417+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n006.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:43:16 EDT 2023
% Result : Theorem 178.25s 24.38s
% Output : CNFRefutation 178.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 12
% Syntax : Number of formulae : 84 ( 22 unt; 0 def)
% Number of atoms : 383 ( 133 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 458 ( 159 ~; 144 |; 127 &)
% ( 0 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 214 ( 20 sgn; 102 !; 51 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax28) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax84) ).
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)
=> ( app(X8,cons(X7,nil)) != X2
| app(cons(X7,nil),X8) != X3 ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X6,cons(X4,nil)),X5) = 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)
=> ( app(X8,cons(X7,nil)) != X2
| app(cons(X7,nil),X8) != X3 ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(X6,cons(X4,nil)),X5) = 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)
=> ( app(X5,cons(X4,nil)) != X2
| app(cons(X4,nil),X5) != X3 ) ) )
| ? [X6] :
( ? [X7] :
( ? [X8] :
( app(app(X8,cons(X6,nil)),X7) = X0
& app(app(X7,cons(X6,nil)),X8) = X1
& ssList(X8) )
& ssList(X7) )
& ssItem(X6) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f120,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f135,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f202,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X2
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( app(app(X8,cons(X6,nil)),X7) != X0
| app(app(X7,cons(X6,nil)),X8) != X1
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& 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] :
( app(X5,cons(X4,nil)) = X2
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( app(app(X8,cons(X6,nil)),X7) != X0
| app(app(X7,cons(X6,nil)),X8) != X1
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f222]) ).
fof(f233,plain,
! [X2,X3,X0,X1] :
( ( ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X2
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( app(app(X8,cons(X6,nil)),X7) != X0
| app(app(X7,cons(X6,nil)),X8) != X1
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& neq(X1,nil) )
| ~ sP6(X2,X3,X0,X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP6])]) ).
fof(f234,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,[],[f223,f233]) ).
fof(f346,plain,
! [X2,X3,X0,X1] :
( ( ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X2
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( app(app(X8,cons(X6,nil)),X7) != X0
| app(app(X7,cons(X6,nil)),X8) != X1
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& neq(X1,nil) )
| ~ sP6(X2,X3,X0,X1) ),
inference(nnf_transformation,[],[f233]) ).
fof(f347,plain,
! [X0,X1,X2,X3] :
( ( ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X0
& app(cons(X4,nil),X5) = X1
& ssList(X5) )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( app(app(X8,cons(X6,nil)),X7) != X2
| app(app(X7,cons(X6,nil)),X8) != X3
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& neq(X3,nil) )
| ~ sP6(X0,X1,X2,X3) ),
inference(rectify,[],[f346]) ).
fof(f348,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X0
& app(cons(X4,nil),X5) = X1
& ssList(X5) )
& ssItem(X4) )
=> ( ? [X5] :
( app(X5,cons(sK54(X0,X1),nil)) = X0
& app(cons(sK54(X0,X1),nil),X5) = X1
& ssList(X5) )
& ssItem(sK54(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
! [X0,X1] :
( ? [X5] :
( app(X5,cons(sK54(X0,X1),nil)) = X0
& app(cons(sK54(X0,X1),nil),X5) = X1
& ssList(X5) )
=> ( app(sK55(X0,X1),cons(sK54(X0,X1),nil)) = X0
& app(cons(sK54(X0,X1),nil),sK55(X0,X1)) = X1
& ssList(sK55(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f350,plain,
! [X0,X1,X2,X3] :
( ( app(sK55(X0,X1),cons(sK54(X0,X1),nil)) = X0
& app(cons(sK54(X0,X1),nil),sK55(X0,X1)) = X1
& ssList(sK55(X0,X1))
& ssItem(sK54(X0,X1))
& ! [X6] :
( ! [X7] :
( ! [X8] :
( app(app(X8,cons(X6,nil)),X7) != X2
| app(app(X7,cons(X6,nil)),X8) != X3
| ~ ssList(X8) )
| ~ ssList(X7) )
| ~ ssItem(X6) )
& neq(X3,nil) )
| ~ sP6(X0,X1,X2,X3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK54,sK55])],[f347,f349,f348]) ).
fof(f351,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,sK56,X1) )
& sK56 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f352,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP6(X2,X3,sK56,X1) )
& sK56 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK57,nil) )
| sP6(X2,X3,sK56,sK57) )
& sK56 = X2
& sK57 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f353,plain,
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK57,nil) )
| sP6(X2,X3,sK56,sK57) )
& sK56 = X2
& sK57 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK57,nil) )
| sP6(sK58,X3,sK56,sK57) )
& sK56 = sK58
& sK57 = X3
& ssList(X3) )
& ssList(sK58) ) ),
introduced(choice_axiom,[]) ).
fof(f354,plain,
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK57,nil) )
| sP6(sK58,X3,sK56,sK57) )
& sK56 = sK58
& sK57 = X3
& ssList(X3) )
=> ( ( ( ~ neq(sK59,nil)
& neq(sK57,nil) )
| sP6(sK58,sK59,sK56,sK57) )
& sK56 = sK58
& sK57 = sK59
& ssList(sK59) ) ),
introduced(choice_axiom,[]) ).
fof(f355,plain,
( ( ( ~ neq(sK59,nil)
& neq(sK57,nil) )
| sP6(sK58,sK59,sK56,sK57) )
& sK56 = sK58
& sK57 = sK59
& ssList(sK59)
& ssList(sK58)
& ssList(sK57)
& ssList(sK56) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK56,sK57,sK58,sK59])],[f234,f354,f353,f352,f351]) ).
fof(f447,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f448,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f462,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f135]) ).
fof(f541,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f202]) ).
fof(f556,plain,
! [X2,X3,X0,X1,X8,X6,X7] :
( app(app(X8,cons(X6,nil)),X7) != X2
| app(app(X7,cons(X6,nil)),X8) != X3
| ~ ssList(X8)
| ~ ssList(X7)
| ~ ssItem(X6)
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f350]) ).
fof(f557,plain,
! [X2,X3,X0,X1] :
( ssItem(sK54(X0,X1))
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f350]) ).
fof(f558,plain,
! [X2,X3,X0,X1] :
( ssList(sK55(X0,X1))
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f350]) ).
fof(f559,plain,
! [X2,X3,X0,X1] :
( app(cons(sK54(X0,X1),nil),sK55(X0,X1)) = X1
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f350]) ).
fof(f560,plain,
! [X2,X3,X0,X1] :
( app(sK55(X0,X1),cons(sK54(X0,X1),nil)) = X0
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f350]) ).
fof(f561,plain,
ssList(sK56),
inference(cnf_transformation,[],[f355]) ).
fof(f565,plain,
sK57 = sK59,
inference(cnf_transformation,[],[f355]) ).
fof(f566,plain,
sK56 = sK58,
inference(cnf_transformation,[],[f355]) ).
fof(f567,plain,
( neq(sK57,nil)
| sP6(sK58,sK59,sK56,sK57) ),
inference(cnf_transformation,[],[f355]) ).
fof(f568,plain,
( ~ neq(sK59,nil)
| sP6(sK58,sK59,sK56,sK57) ),
inference(cnf_transformation,[],[f355]) ).
fof(f569,plain,
( ~ neq(sK59,nil)
| sP6(sK58,sK59,sK58,sK59) ),
inference(definition_unfolding,[],[f568,f566,f565]) ).
fof(f570,plain,
( neq(sK59,nil)
| sP6(sK58,sK59,sK58,sK59) ),
inference(definition_unfolding,[],[f567,f565,f566,f565]) ).
fof(f572,plain,
ssList(sK58),
inference(definition_unfolding,[],[f561,f566]) ).
fof(f600,plain,
! [X3,X0,X1,X8,X6,X7] :
( app(app(X7,cons(X6,nil)),X8) != X3
| ~ ssList(X8)
| ~ ssList(X7)
| ~ ssItem(X6)
| ~ sP6(X0,X1,app(app(X8,cons(X6,nil)),X7),X3) ),
inference(equality_resolution,[],[f556]) ).
fof(f601,plain,
! [X0,X1,X8,X6,X7] :
( ~ ssList(X8)
| ~ ssList(X7)
| ~ ssItem(X6)
| ~ sP6(X0,X1,app(app(X8,cons(X6,nil)),X7),app(app(X7,cons(X6,nil)),X8)) ),
inference(equality_resolution,[],[f600]) ).
cnf(c_140,plain,
( ~ ssItem(X0)
| ~ ssList(X1)
| ssList(cons(X0,X1)) ),
inference(cnf_transformation,[],[f447]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f448]) ).
cnf(c_155,plain,
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f462]) ).
cnf(c_232,plain,
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f541]) ).
cnf(c_246,plain,
( ~ sP6(X0,X1,X2,X3)
| app(sK55(X0,X1),cons(sK54(X0,X1),nil)) = X0 ),
inference(cnf_transformation,[],[f560]) ).
cnf(c_247,plain,
( ~ sP6(X0,X1,X2,X3)
| app(cons(sK54(X0,X1),nil),sK55(X0,X1)) = X1 ),
inference(cnf_transformation,[],[f559]) ).
cnf(c_248,plain,
( ~ sP6(X0,X1,X2,X3)
| ssList(sK55(X0,X1)) ),
inference(cnf_transformation,[],[f558]) ).
cnf(c_249,plain,
( ~ sP6(X0,X1,X2,X3)
| ssItem(sK54(X0,X1)) ),
inference(cnf_transformation,[],[f557]) ).
cnf(c_250,plain,
( ~ sP6(X0,X1,app(app(X2,cons(X3,nil)),X4),app(app(X4,cons(X3,nil)),X2))
| ~ ssItem(X3)
| ~ ssList(X2)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f601]) ).
cnf(c_252,negated_conjecture,
( ~ neq(sK59,nil)
| sP6(sK58,sK59,sK58,sK59) ),
inference(cnf_transformation,[],[f569]) ).
cnf(c_253,negated_conjecture,
( sP6(sK58,sK59,sK58,sK59)
| neq(sK59,nil) ),
inference(cnf_transformation,[],[f570]) ).
cnf(c_257,negated_conjecture,
ssList(sK58),
inference(cnf_transformation,[],[f572]) ).
cnf(c_376,negated_conjecture,
sP6(sK58,sK59,sK58,sK59),
inference(global_subsumption_just,[status(thm)],[c_253,c_253,c_252]) ).
cnf(c_378,negated_conjecture,
sP6(sK58,sK59,sK58,sK59),
inference(global_subsumption_just,[status(thm)],[c_252,c_376]) ).
cnf(c_1848,plain,
( X0 != sK58
| X1 != sK59
| X2 != sK58
| X3 != sK59
| ssItem(sK54(X0,X1)) ),
inference(resolution_lifted,[status(thm)],[c_249,c_378]) ).
cnf(c_1849,plain,
ssItem(sK54(sK58,sK59)),
inference(unflattening,[status(thm)],[c_1848]) ).
cnf(c_1853,plain,
( X0 != sK58
| X1 != sK59
| X2 != sK58
| X3 != sK59
| ssList(sK55(X0,X1)) ),
inference(resolution_lifted,[status(thm)],[c_248,c_378]) ).
cnf(c_1854,plain,
ssList(sK55(sK58,sK59)),
inference(unflattening,[status(thm)],[c_1853]) ).
cnf(c_1858,plain,
( X0 != sK58
| X1 != sK59
| X2 != sK58
| X3 != sK59
| app(cons(sK54(X0,X1),nil),sK55(X0,X1)) = X1 ),
inference(resolution_lifted,[status(thm)],[c_247,c_378]) ).
cnf(c_1859,plain,
app(cons(sK54(sK58,sK59),nil),sK55(sK58,sK59)) = sK59,
inference(unflattening,[status(thm)],[c_1858]) ).
cnf(c_1863,plain,
( X0 != sK58
| X1 != sK59
| X2 != sK58
| X3 != sK59
| app(sK55(X0,X1),cons(sK54(X0,X1),nil)) = X0 ),
inference(resolution_lifted,[status(thm)],[c_246,c_378]) ).
cnf(c_1864,plain,
app(sK55(sK58,sK59),cons(sK54(sK58,sK59),nil)) = sK58,
inference(unflattening,[status(thm)],[c_1863]) ).
cnf(c_1868,plain,
( app(app(X0,cons(X1,nil)),X2) != sK58
| app(app(X2,cons(X1,nil)),X0) != sK59
| X3 != sK58
| X4 != sK59
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2) ),
inference(resolution_lifted,[status(thm)],[c_250,c_378]) ).
cnf(c_1869,plain,
( app(app(X0,cons(X1,nil)),X2) != sK58
| app(app(X2,cons(X1,nil)),X0) != sK59
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2) ),
inference(unflattening,[status(thm)],[c_1868]) ).
cnf(c_6435,plain,
( app(app(X0_13,cons(X0_14,nil)),X1_13) != sK58
| app(app(X1_13,cons(X0_14,nil)),X0_13) != sK59
| ~ ssItem(X0_14)
| ~ ssList(X0_13)
| ~ ssList(X1_13) ),
inference(subtyping,[status(esa)],[c_1869]) ).
cnf(c_6436,plain,
app(sK55(sK58,sK59),cons(sK54(sK58,sK59),nil)) = sK58,
inference(subtyping,[status(esa)],[c_1864]) ).
cnf(c_6437,plain,
app(cons(sK54(sK58,sK59),nil),sK55(sK58,sK59)) = sK59,
inference(subtyping,[status(esa)],[c_1859]) ).
cnf(c_6439,plain,
ssItem(sK54(sK58,sK59)),
inference(subtyping,[status(esa)],[c_1849]) ).
cnf(c_6446,negated_conjecture,
ssList(sK58),
inference(subtyping,[status(esa)],[c_257]) ).
cnf(c_6459,plain,
( ~ ssList(X0_13)
| app(X0_13,nil) = X0_13 ),
inference(subtyping,[status(esa)],[c_232]) ).
cnf(c_6524,plain,
( ~ ssList(X0_13)
| app(nil,X0_13) = X0_13 ),
inference(subtyping,[status(esa)],[c_155]) ).
cnf(c_6538,plain,
ssList(nil),
inference(subtyping,[status(esa)],[c_141]) ).
cnf(c_6539,plain,
( ~ ssItem(X0_14)
| ~ ssList(X0_13)
| ssList(cons(X0_14,X0_13)) ),
inference(subtyping,[status(esa)],[c_140]) ).
cnf(c_9533,plain,
app(sK58,nil) = sK58,
inference(superposition,[status(thm)],[c_6446,c_6459]) ).
cnf(c_228894,plain,
( app(app(X0_13,cons(sK54(sK58,sK59),nil)),sK55(sK58,sK59)) != sK59
| app(sK58,X0_13) != sK58
| ~ ssItem(sK54(sK58,sK59))
| ~ ssList(sK55(sK58,sK59))
| ~ ssList(X0_13) ),
inference(superposition,[status(thm)],[c_6436,c_6435]) ).
cnf(c_228904,plain,
( app(app(X0_13,cons(sK54(sK58,sK59),nil)),sK55(sK58,sK59)) != sK59
| app(sK58,X0_13) != sK58
| ~ ssList(X0_13) ),
inference(global_subsumption_just,[status(thm)],[c_228894,c_1849,c_1854,c_228894]) ).
cnf(c_228921,plain,
( ~ ssItem(X0_14)
| ~ ssList(X0_13)
| app(nil,cons(X0_14,X0_13)) = cons(X0_14,X0_13) ),
inference(superposition,[status(thm)],[c_6539,c_6524]) ).
cnf(c_234226,plain,
( ~ ssList(X0_13)
| app(nil,cons(sK54(sK58,sK59),X0_13)) = cons(sK54(sK58,sK59),X0_13) ),
inference(superposition,[status(thm)],[c_6439,c_228921]) ).
cnf(c_234451,plain,
app(nil,cons(sK54(sK58,sK59),nil)) = cons(sK54(sK58,sK59),nil),
inference(superposition,[status(thm)],[c_6538,c_234226]) ).
cnf(c_234808,plain,
( app(cons(sK54(sK58,sK59),nil),sK55(sK58,sK59)) != sK59
| app(sK58,nil) != sK58
| ~ ssList(nil) ),
inference(superposition,[status(thm)],[c_234451,c_228904]) ).
cnf(c_234809,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_234808,c_9533,c_6437,c_141]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SWC417+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.16/0.36 % Computer : n006.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Mon Aug 28 16:46:21 EDT 2023
% 0.16/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 178.25/24.38 % SZS status Started for theBenchmark.p
% 178.25/24.38 % SZS status Theorem for theBenchmark.p
% 178.25/24.38
% 178.25/24.38 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 178.25/24.38
% 178.25/24.38 ------ iProver source info
% 178.25/24.38
% 178.25/24.38 git: date: 2023-05-31 18:12:56 +0000
% 178.25/24.38 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 178.25/24.38 git: non_committed_changes: false
% 178.25/24.38 git: last_make_outside_of_git: false
% 178.25/24.38
% 178.25/24.38 ------ Parsing...
% 178.25/24.38 ------ Clausification by vclausify_rel & Parsing by iProver...
% 178.25/24.38
% 178.25/24.38 ------ 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
% 178.25/24.38
% 178.25/24.38 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 178.25/24.38
% 178.25/24.38 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 178.25/24.38 ------ Proving...
% 178.25/24.38 ------ Problem Properties
% 178.25/24.38
% 178.25/24.38
% 178.25/24.38 clauses 188
% 178.25/24.38 conjectures 2
% 178.25/24.38 EPR 52
% 178.25/24.38 Horn 120
% 178.25/24.38 unary 23
% 178.25/24.38 binary 40
% 178.25/24.38 lits 630
% 178.25/24.38 lits eq 83
% 178.25/24.38 fd_pure 0
% 178.25/24.38 fd_pseudo 0
% 178.25/24.38 fd_cond 21
% 178.25/24.38 fd_pseudo_cond 14
% 178.25/24.38 AC symbols 0
% 178.25/24.38
% 178.25/24.38 ------ Input Options Time Limit: Unbounded
% 178.25/24.38
% 178.25/24.38
% 178.25/24.38 ------
% 178.25/24.38 Current options:
% 178.25/24.38 ------
% 178.25/24.38
% 178.25/24.38
% 178.25/24.38
% 178.25/24.38
% 178.25/24.38 ------ Proving...
% 178.25/24.38
% 178.25/24.38
% 178.25/24.38 ------ Proving...
% 178.25/24.38
% 178.25/24.38
% 178.25/24.38 ------ Proving...
% 178.25/24.38
% 178.25/24.38
% 178.25/24.38 ------ Proving...
% 178.25/24.38
% 178.25/24.38
% 178.25/24.38 % SZS status Theorem for theBenchmark.p
% 178.25/24.38
% 178.25/24.38 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 178.25/24.38
% 178.25/24.39
%------------------------------------------------------------------------------