TSTP Solution File: SWC317+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC317+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n003.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:59 EDT 2024
% Result : Theorem 0.43s 1.10s
% Output : CNFRefutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of formulae : 51 ( 9 unt; 0 def)
% Number of atoms : 302 ( 110 equ)
% Maximal formula atoms : 18 ( 5 avg)
% Number of connectives : 366 ( 115 ~; 103 |; 124 &)
% ( 0 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 7 avg)
% Maximal term depth : 4 ( 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 : 171 ( 20 sgn 81 !; 48 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(X7,cons(X6,nil)) != X3
| app(cons(X6,nil),X7) != X2 ) ) )
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X1
& app(cons(X4,nil),X5) = X0
& 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) )
& ( ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(X7,cons(X6,nil)) != X3
| app(cons(X6,nil),X7) != X2 ) ) )
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X1
& app(cons(X4,nil),X5) = X0
& 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)) != X3
| app(cons(X4,nil),X5) != X2 ) ) )
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X1
& app(cons(X6,nil),X7) = X0
& ssList(X7) )
& ssItem(X6) )
| ~ 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] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = X2
& ssList(X5) )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != X1
| app(cons(X6,nil),X7) != X0
| ~ 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)) = X3
& app(cons(X4,nil),X5) = X2
& ssList(X5) )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != X1
| app(cons(X6,nil),X7) != X0
| ~ 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,
! [X3,X2,X1,X0] :
( ( ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = X2
& ssList(X5) )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != X1
| app(cons(X6,nil),X7) != X0
| ~ ssList(X7) )
| ~ ssItem(X6) )
& neq(X1,nil) )
| ~ sP6(X3,X2,X1,X0) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP6])]) ).
fof(f234,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP6(X3,X2,X1,X0) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f223,f233]) ).
fof(f346,plain,
! [X3,X2,X1,X0] :
( ( ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = X2
& ssList(X5) )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( app(X7,cons(X6,nil)) != X1
| app(cons(X6,nil),X7) != X0
| ~ ssList(X7) )
| ~ ssItem(X6) )
& neq(X1,nil) )
| ~ sP6(X3,X2,X1,X0) ),
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] :
( app(X7,cons(X6,nil)) != X2
| app(cons(X6,nil),X7) != X3
| ~ ssList(X7) )
| ~ ssItem(X6) )
& neq(X2,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] :
( app(X7,cons(X6,nil)) != X2
| app(cons(X6,nil),X7) != X3
| ~ ssList(X7) )
| ~ ssItem(X6) )
& neq(X2,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(X3,X2,X1,X0) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP6(X3,X2,X1,sK56) )
& 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(X3,X2,X1,sK56) )
& sK56 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK57,nil) )
| sP6(X3,X2,sK57,sK56) )
& 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(X3,X2,sK57,sK56) )
& sK56 = X2
& sK57 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK57,nil) )
| sP6(X3,sK58,sK57,sK56) )
& sK56 = sK58
& sK57 = X3
& ssList(X3) )
& ssList(sK58) ) ),
introduced(choice_axiom,[]) ).
fof(f354,plain,
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK57,nil) )
| sP6(X3,sK58,sK57,sK56) )
& sK56 = sK58
& sK57 = X3
& ssList(X3) )
=> ( ( ( ~ neq(sK59,nil)
& neq(sK57,nil) )
| sP6(sK59,sK58,sK57,sK56) )
& sK56 = sK58
& sK57 = sK59
& ssList(sK59) ) ),
introduced(choice_axiom,[]) ).
fof(f355,plain,
( ( ( ~ neq(sK59,nil)
& neq(sK57,nil) )
| sP6(sK59,sK58,sK57,sK56) )
& 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(f556,plain,
! [X2,X3,X0,X1,X6,X7] :
( app(X7,cons(X6,nil)) != X2
| app(cons(X6,nil),X7) != X3
| ~ 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(f565,plain,
sK57 = sK59,
inference(cnf_transformation,[],[f355]) ).
fof(f566,plain,
sK56 = sK58,
inference(cnf_transformation,[],[f355]) ).
fof(f567,plain,
( neq(sK57,nil)
| sP6(sK59,sK58,sK57,sK56) ),
inference(cnf_transformation,[],[f355]) ).
fof(f568,plain,
( ~ neq(sK59,nil)
| sP6(sK59,sK58,sK57,sK56) ),
inference(cnf_transformation,[],[f355]) ).
fof(f569,plain,
( ~ neq(sK59,nil)
| sP6(sK59,sK58,sK59,sK58) ),
inference(definition_unfolding,[],[f568,f565,f566]) ).
fof(f570,plain,
( neq(sK59,nil)
| sP6(sK59,sK58,sK59,sK58) ),
inference(definition_unfolding,[],[f567,f565,f565,f566]) ).
fof(f600,plain,
! [X3,X0,X1,X6,X7] :
( app(cons(X6,nil),X7) != X3
| ~ ssList(X7)
| ~ ssItem(X6)
| ~ sP6(X0,X1,app(X7,cons(X6,nil)),X3) ),
inference(equality_resolution,[],[f556]) ).
fof(f601,plain,
! [X0,X1,X6,X7] :
( ~ ssList(X7)
| ~ ssItem(X6)
| ~ sP6(X0,X1,app(X7,cons(X6,nil)),app(cons(X6,nil),X7)) ),
inference(equality_resolution,[],[f600]) ).
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(X2,cons(X3,nil)),app(cons(X3,nil),X2))
| ~ ssItem(X3)
| ~ ssList(X2) ),
inference(cnf_transformation,[],[f601]) ).
cnf(c_252,negated_conjecture,
( ~ neq(sK59,nil)
| sP6(sK59,sK58,sK59,sK58) ),
inference(cnf_transformation,[],[f569]) ).
cnf(c_253,negated_conjecture,
( sP6(sK59,sK58,sK59,sK58)
| neq(sK59,nil) ),
inference(cnf_transformation,[],[f570]) ).
cnf(c_376,negated_conjecture,
sP6(sK59,sK58,sK59,sK58),
inference(global_subsumption_just,[status(thm)],[c_253,c_253,c_252]) ).
cnf(c_378,negated_conjecture,
sP6(sK59,sK58,sK59,sK58),
inference(global_subsumption_just,[status(thm)],[c_252,c_376]) ).
cnf(c_3140,plain,
( X0 != sK59
| X1 != sK58
| X2 != sK59
| X3 != sK58
| ssItem(sK54(X0,X1)) ),
inference(resolution_lifted,[status(thm)],[c_249,c_378]) ).
cnf(c_3141,plain,
ssItem(sK54(sK59,sK58)),
inference(unflattening,[status(thm)],[c_3140]) ).
cnf(c_3145,plain,
( X0 != sK59
| X1 != sK58
| X2 != sK59
| X3 != sK58
| ssList(sK55(X0,X1)) ),
inference(resolution_lifted,[status(thm)],[c_248,c_378]) ).
cnf(c_3146,plain,
ssList(sK55(sK59,sK58)),
inference(unflattening,[status(thm)],[c_3145]) ).
cnf(c_3150,plain,
( X0 != sK59
| X1 != sK58
| X2 != sK59
| X3 != sK58
| app(cons(sK54(X0,X1),nil),sK55(X0,X1)) = X1 ),
inference(resolution_lifted,[status(thm)],[c_247,c_378]) ).
cnf(c_3151,plain,
app(cons(sK54(sK59,sK58),nil),sK55(sK59,sK58)) = sK58,
inference(unflattening,[status(thm)],[c_3150]) ).
cnf(c_3155,plain,
( X0 != sK59
| X1 != sK58
| X2 != sK59
| X3 != sK58
| app(sK55(X0,X1),cons(sK54(X0,X1),nil)) = X0 ),
inference(resolution_lifted,[status(thm)],[c_246,c_378]) ).
cnf(c_3156,plain,
app(sK55(sK59,sK58),cons(sK54(sK59,sK58),nil)) = sK59,
inference(unflattening,[status(thm)],[c_3155]) ).
cnf(c_3160,plain,
( app(cons(X0,nil),X1) != sK58
| app(X1,cons(X0,nil)) != sK59
| X2 != sK59
| X3 != sK58
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(resolution_lifted,[status(thm)],[c_250,c_378]) ).
cnf(c_3161,plain,
( app(cons(X0,nil),X1) != sK58
| app(X1,cons(X0,nil)) != sK59
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(unflattening,[status(thm)],[c_3160]) ).
cnf(c_11773,plain,
( app(sK55(sK59,sK58),cons(sK54(sK59,sK58),nil)) != sK59
| ~ ssItem(sK54(sK59,sK58))
| ~ ssList(sK55(sK59,sK58)) ),
inference(superposition,[status(thm)],[c_3151,c_3161]) ).
cnf(c_11774,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11773,c_3146,c_3141,c_3156]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SWC317+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.10 % Command : run_iprover %s %d THM
% 0.10/0.30 % Computer : n003.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Thu May 2 23:28:50 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.41 Running first-order theorem proving
% 0.16/0.41 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.43/1.10 % SZS status Started for theBenchmark.p
% 0.43/1.10 % SZS status Theorem for theBenchmark.p
% 0.43/1.10
% 0.43/1.10 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.43/1.10
% 0.43/1.10 ------ iProver source info
% 0.43/1.10
% 0.43/1.10 git: date: 2024-05-02 19:28:25 +0000
% 0.43/1.10 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.43/1.10 git: non_committed_changes: false
% 0.43/1.10
% 0.43/1.10 ------ Parsing...
% 0.43/1.10 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.43/1.10
% 0.43/1.10 ------ 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
% 0.43/1.10
% 0.43/1.10 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.43/1.10
% 0.43/1.10 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.43/1.10 ------ Proving...
% 0.43/1.10 ------ Problem Properties
% 0.43/1.10
% 0.43/1.10
% 0.43/1.10 clauses 188
% 0.43/1.10 conjectures 2
% 0.43/1.10 EPR 52
% 0.43/1.10 Horn 120
% 0.43/1.10 unary 23
% 0.43/1.10 binary 40
% 0.43/1.10 lits 629
% 0.43/1.10 lits eq 83
% 0.43/1.10 fd_pure 0
% 0.43/1.10 fd_pseudo 0
% 0.43/1.10 fd_cond 21
% 0.43/1.10 fd_pseudo_cond 14
% 0.43/1.10 AC symbols 0
% 0.43/1.10
% 0.43/1.10 ------ Schedule dynamic 5 is on
% 0.43/1.10
% 0.43/1.10 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.43/1.10
% 0.43/1.10
% 0.43/1.10 ------
% 0.43/1.10 Current options:
% 0.43/1.10 ------
% 0.43/1.10
% 0.43/1.10
% 0.43/1.10
% 0.43/1.10
% 0.43/1.10 ------ Proving...
% 0.43/1.10
% 0.43/1.10
% 0.43/1.10 % SZS status Theorem for theBenchmark.p
% 0.43/1.10
% 0.43/1.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.43/1.10
% 0.43/1.11
%------------------------------------------------------------------------------