TSTP Solution File: SWC012+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC012+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n027.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:17 EDT 2023
% Result : Theorem 3.83s 1.09s
% Output : CNFRefutation 3.83s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f605)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
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)
=> app(X2,cons(X7,nil)) != 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)
=> app(X2,cons(X7,nil)) != 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)
=> app(X2,cons(X4,nil)) != X3 )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( app(X6,X7) = X0
& app(app(X6,cons(X5,nil)),X7) = X1
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
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] :
( app(X2,cons(X4,nil)) = X3
& ssItem(X4) )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X6,X7) != X0
| app(app(X6,cons(X5,nil)),X7) != X1
| ~ ssList(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& 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] :
( app(X2,cons(X4,nil)) = X3
& ssItem(X4) )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X6,X7) != X0
| app(app(X6,cons(X5,nil)),X7) != X1
| ~ ssList(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f222]) ).
fof(f344,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ? [X4] :
( app(X2,cons(X4,nil)) = X3
& ssItem(X4) )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X6,X7) != X0
| app(app(X6,cons(X5,nil)),X7) != X1
| ~ ssList(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ? [X4] :
( app(X2,cons(X4,nil)) = X3
& ssItem(X4) )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X6,X7) != sK53
| app(app(X6,cons(X5,nil)),X7) != X1
| ~ ssList(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& neq(X1,nil) ) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ? [X4] :
( app(X2,cons(X4,nil)) = X3
& ssItem(X4) )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X6,X7) != sK53
| app(app(X6,cons(X5,nil)),X7) != X1
| ~ ssList(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& neq(X1,nil) ) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK54,nil) )
| ( ? [X4] :
( app(X2,cons(X4,nil)) = X3
& ssItem(X4) )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X6,X7) != sK53
| app(app(X6,cons(X5,nil)),X7) != sK54
| ~ ssList(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& neq(sK54,nil) ) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK54,nil) )
| ( ? [X4] :
( app(X2,cons(X4,nil)) = X3
& ssItem(X4) )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X6,X7) != sK53
| app(app(X6,cons(X5,nil)),X7) != sK54
| ~ ssList(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& neq(sK54,nil) ) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK54,nil) )
| ( ? [X4] :
( app(sK55,cons(X4,nil)) = X3
& ssItem(X4) )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X6,X7) != sK53
| app(app(X6,cons(X5,nil)),X7) != sK54
| ~ ssList(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& neq(sK54,nil) ) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK54,nil) )
| ( ? [X4] :
( app(sK55,cons(X4,nil)) = X3
& ssItem(X4) )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X6,X7) != sK53
| app(app(X6,cons(X5,nil)),X7) != sK54
| ~ ssList(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& neq(sK54,nil) ) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ( ~ neq(sK56,nil)
& neq(sK54,nil) )
| ( ? [X4] :
( app(sK55,cons(X4,nil)) = sK56
& ssItem(X4) )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X6,X7) != sK53
| app(app(X6,cons(X5,nil)),X7) != sK54
| ~ ssList(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& neq(sK54,nil) ) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ? [X4] :
( app(sK55,cons(X4,nil)) = sK56
& ssItem(X4) )
=> ( sK56 = app(sK55,cons(sK57,nil))
& ssItem(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
( ( ( ~ neq(sK56,nil)
& neq(sK54,nil) )
| ( sK56 = app(sK55,cons(sK57,nil))
& ssItem(sK57)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X6,X7) != sK53
| app(app(X6,cons(X5,nil)),X7) != sK54
| ~ ssList(X7) )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& neq(sK54,nil) ) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57])],[f223,f348,f347,f346,f345,f344]) ).
fof(f442,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f535,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f202]) ).
fof(f549,plain,
ssList(sK53),
inference(cnf_transformation,[],[f349]) ).
fof(f550,plain,
ssList(sK54),
inference(cnf_transformation,[],[f349]) ).
fof(f553,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f349]) ).
fof(f554,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f349]) ).
fof(f560,plain,
! [X6,X7,X5] :
( ~ neq(sK56,nil)
| app(X6,X7) != sK53
| app(app(X6,cons(X5,nil)),X7) != sK54
| ~ ssList(X7)
| ~ ssList(X6)
| ~ ssItem(X5) ),
inference(cnf_transformation,[],[f349]) ).
fof(f561,plain,
( ~ neq(sK56,nil)
| ssItem(sK57) ),
inference(cnf_transformation,[],[f349]) ).
fof(f562,plain,
( ~ neq(sK56,nil)
| sK56 = app(sK55,cons(sK57,nil)) ),
inference(cnf_transformation,[],[f349]) ).
fof(f563,plain,
! [X6,X7,X5] :
( ~ neq(sK56,nil)
| app(X6,X7) != sK55
| app(app(X6,cons(X5,nil)),X7) != sK56
| ~ ssList(X7)
| ~ ssList(X6)
| ~ ssItem(X5) ),
inference(definition_unfolding,[],[f560,f554,f553]) ).
fof(f569,plain,
ssList(sK56),
inference(definition_unfolding,[],[f550,f553]) ).
fof(f570,plain,
ssList(sK55),
inference(definition_unfolding,[],[f549,f554]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f442]) ).
cnf(c_232,plain,
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f535]) ).
cnf(c_246,negated_conjecture,
( ~ neq(sK56,nil)
| app(sK55,cons(sK57,nil)) = sK56 ),
inference(cnf_transformation,[],[f562]) ).
cnf(c_247,negated_conjecture,
( ~ neq(sK56,nil)
| ssItem(sK57) ),
inference(cnf_transformation,[],[f561]) ).
cnf(c_248,negated_conjecture,
( app(app(X0,cons(X1,nil)),X2) != sK56
| app(X0,X2) != sK55
| ~ neq(sK56,nil)
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2) ),
inference(cnf_transformation,[],[f563]) ).
cnf(c_252,negated_conjecture,
neq(sK56,nil),
inference(cnf_transformation,[],[f605]) ).
cnf(c_255,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f569]) ).
cnf(c_256,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f570]) ).
cnf(c_366,negated_conjecture,
ssItem(sK57),
inference(global_subsumption_just,[status(thm)],[c_247,c_252,c_247]) ).
cnf(c_382,negated_conjecture,
app(sK55,cons(sK57,nil)) = sK56,
inference(global_subsumption_just,[status(thm)],[c_246,c_252,c_246]) ).
cnf(c_392,plain,
( app(X0,X2) != sK55
| app(app(X0,cons(X1,nil)),X2) != sK56
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2) ),
inference(global_subsumption_just,[status(thm)],[c_248,c_252,c_248]) ).
cnf(c_393,negated_conjecture,
( app(app(X0,cons(X1,nil)),X2) != sK56
| app(X0,X2) != sK55
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2) ),
inference(renaming,[status(thm)],[c_392]) ).
cnf(c_11663,plain,
( app(sK56,X0) != sK56
| app(sK55,X0) != sK55
| ~ ssList(X0)
| ~ ssItem(sK57)
| ~ ssList(sK55) ),
inference(superposition,[status(thm)],[c_382,c_393]) ).
cnf(c_11664,plain,
( app(sK56,X0) != sK56
| app(sK55,X0) != sK55
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_11663,c_256,c_366]) ).
cnf(c_11668,plain,
( app(sK56,nil) != sK56
| app(sK55,nil) != sK55
| ~ ssList(nil) ),
inference(instantiation,[status(thm)],[c_11664]) ).
cnf(c_12097,plain,
app(sK56,nil) = sK56,
inference(superposition,[status(thm)],[c_255,c_232]) ).
cnf(c_12098,plain,
app(sK55,nil) = sK55,
inference(superposition,[status(thm)],[c_256,c_232]) ).
cnf(c_12154,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_12097,c_12098,c_11668,c_141]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWC012+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n027.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon Aug 28 16:42:22 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.83/1.09 % SZS status Started for theBenchmark.p
% 3.83/1.09 % SZS status Theorem for theBenchmark.p
% 3.83/1.09
% 3.83/1.09 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.83/1.09
% 3.83/1.09 ------ iProver source info
% 3.83/1.09
% 3.83/1.09 git: date: 2023-05-31 18:12:56 +0000
% 3.83/1.09 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.83/1.09 git: non_committed_changes: false
% 3.83/1.09 git: last_make_outside_of_git: false
% 3.83/1.09
% 3.83/1.09 ------ Parsing...
% 3.83/1.09 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.83/1.09
% 3.83/1.09 ------ 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: 5 0s sf_e pe_s pe_e
% 3.83/1.09
% 3.83/1.09 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.83/1.09
% 3.83/1.09 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.83/1.09 ------ Proving...
% 3.83/1.09 ------ Problem Properties
% 3.83/1.09
% 3.83/1.09
% 3.83/1.09 clauses 186
% 3.83/1.09 conjectures 5
% 3.83/1.09 EPR 53
% 3.83/1.09 Horn 118
% 3.83/1.09 unary 21
% 3.83/1.09 binary 40
% 3.83/1.09 lits 628
% 3.83/1.09 lits eq 82
% 3.83/1.09 fd_pure 0
% 3.83/1.09 fd_pseudo 0
% 3.83/1.09 fd_cond 21
% 3.83/1.09 fd_pseudo_cond 14
% 3.83/1.09 AC symbols 0
% 3.83/1.09
% 3.83/1.09 ------ Schedule dynamic 5 is on
% 3.83/1.09
% 3.83/1.09 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.83/1.09
% 3.83/1.09
% 3.83/1.09 ------
% 3.83/1.09 Current options:
% 3.83/1.09 ------
% 3.83/1.09
% 3.83/1.09
% 3.83/1.09
% 3.83/1.09
% 3.83/1.09 ------ Proving...
% 3.83/1.09
% 3.83/1.09
% 3.83/1.09 % SZS status Theorem for theBenchmark.p
% 3.83/1.09
% 3.83/1.09 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.83/1.09
% 3.83/1.10
%------------------------------------------------------------------------------