TSTP Solution File: SWC041+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC041+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n021.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:10:59 EDT 2024
% Result : Theorem 3.95s 1.12s
% Output : CNFRefutation 3.95s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax83) ).
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)
=> ( ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( app(X7,cons(X5,nil)) = X2
& ssList(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ equalelemsP(X2)
| app(X2,X4) != X3 ) )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( app(X7,cons(X5,nil)) = X2
& ssList(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ equalelemsP(X2)
| app(X2,X4) != X3 ) )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f200,plain,
! [X0] :
( ! [X1] :
( ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f201,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f339,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X0
| nil != X1 )
& ( ( nil = X0
& nil = X1 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f200]) ).
fof(f340,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X0
| nil != X1 )
& ( ( nil = X0
& nil = X1 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f339]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& nil != sK53
& sK53 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& nil != sK53
& sK53 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& nil != sK53
& sK53 = X2
& sK54 = X3
& nil = sK54
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& nil != sK53
& sK53 = X2
& sK54 = X3
& nil = sK54
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( nil != sK55
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != sK55
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(sK55)
& app(sK55,X4) = X3
& ssList(X4) )
& nil != sK53
& sK53 = sK55
& sK54 = X3
& nil = sK54
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ( nil != sK55
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != sK55
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(sK55)
& app(sK55,X4) = X3
& ssList(X4) )
& nil != sK53
& sK53 = sK55
& sK54 = X3
& nil = sK54
& ssList(X3) )
=> ( ( nil != sK55
| nil = sK56 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != sK55
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(sK55)
& app(sK55,X4) = sK56
& ssList(X4) )
& nil != sK53
& sK53 = sK55
& sK54 = sK56
& nil = sK54
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != sK55
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(sK55)
& app(sK55,X4) = sK56
& ssList(X4) )
=> ( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != sK55
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != sK57
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(sK55)
& sK56 = app(sK55,sK57)
& ssList(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ( nil != sK55
| nil = sK56 )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != sK55
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != sK57
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(sK55)
& sK56 = app(sK55,sK57)
& ssList(sK57)
& nil != sK53
& sK53 = sK55
& sK54 = sK56
& nil = sK54
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57])],[f222,f347,f346,f345,f344,f343]) ).
fof(f531,plain,
! [X0,X1] :
( nil = X1
| nil != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f340]) ).
fof(f534,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f201]) ).
fof(f548,plain,
ssList(sK53),
inference(cnf_transformation,[],[f348]) ).
fof(f549,plain,
ssList(sK54),
inference(cnf_transformation,[],[f348]) ).
fof(f552,plain,
nil = sK54,
inference(cnf_transformation,[],[f348]) ).
fof(f553,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f348]) ).
fof(f554,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f348]) ).
fof(f555,plain,
nil != sK53,
inference(cnf_transformation,[],[f348]) ).
fof(f556,plain,
ssList(sK57),
inference(cnf_transformation,[],[f348]) ).
fof(f557,plain,
sK56 = app(sK55,sK57),
inference(cnf_transformation,[],[f348]) ).
fof(f561,plain,
nil = sK56,
inference(definition_unfolding,[],[f552,f553]) ).
fof(f616,plain,
! [X0,X1] :
( sK56 = X1
| app(X0,X1) != sK56
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f531,f561,f561]) ).
fof(f617,plain,
! [X0] :
( app(X0,sK56) = X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f534,f561]) ).
fof(f622,plain,
sK55 != sK56,
inference(definition_unfolding,[],[f555,f561,f554]) ).
fof(f623,plain,
ssList(sK56),
inference(definition_unfolding,[],[f549,f553]) ).
fof(f624,plain,
ssList(sK55),
inference(definition_unfolding,[],[f548,f554]) ).
cnf(c_229,negated_conjecture,
( ~ ssList(sK56)
| app(sK56,sK56) = sK56 ),
inference(cnf_transformation,[],[f657]) ).
cnf(c_231,negated_conjecture,
( app(X0,X1) != sK56
| ~ ssList(X0)
| ~ ssList(X1)
| X1 = sK56 ),
inference(cnf_transformation,[],[f616]) ).
cnf(c_232,negated_conjecture,
( ~ ssList(X0)
| app(X0,sK56) = X0 ),
inference(cnf_transformation,[],[f617]) ).
cnf(c_248,negated_conjecture,
app(sK55,sK57) = sK56,
inference(cnf_transformation,[],[f557]) ).
cnf(c_249,negated_conjecture,
ssList(sK57),
inference(cnf_transformation,[],[f556]) ).
cnf(c_250,negated_conjecture,
sK56 != sK55,
inference(cnf_transformation,[],[f622]) ).
cnf(c_253,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f623]) ).
cnf(c_254,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f624]) ).
cnf(c_295,plain,
( ~ ssList(sK56)
| app(sK56,sK56) = sK56 ),
inference(instantiation,[status(thm)],[c_232]) ).
cnf(c_368,negated_conjecture,
app(sK56,sK56) = sK56,
inference(global_subsumption_just,[status(thm)],[c_229,c_253,c_295]) ).
cnf(c_8880,plain,
app(sK56,sK56) = sP0_iProver_def,
definition ).
cnf(c_8881,plain,
app(sK55,sK57) = sP1_iProver_def,
definition ).
cnf(c_8882,negated_conjecture,
sP0_iProver_def = sK56,
inference(demodulation,[status(thm)],[c_368,c_8880]) ).
cnf(c_8886,negated_conjecture,
ssList(sK55),
inference(demodulation,[status(thm)],[c_254]) ).
cnf(c_8887,negated_conjecture,
sK56 != sK55,
inference(demodulation,[status(thm)],[c_250]) ).
cnf(c_8888,negated_conjecture,
ssList(sK57),
inference(demodulation,[status(thm)],[c_249]) ).
cnf(c_8889,negated_conjecture,
sP1_iProver_def = sK56,
inference(demodulation,[status(thm)],[c_248,c_8881]) ).
cnf(c_8894,negated_conjecture,
( ~ ssList(X0)
| app(X0,sK56) = X0 ),
inference(demodulation,[status(thm)],[c_232]) ).
cnf(c_8895,negated_conjecture,
( app(X0,X1) != sK56
| ~ ssList(X0)
| ~ ssList(X1)
| X1 = sK56 ),
inference(demodulation,[status(thm)],[c_231]) ).
cnf(c_11768,plain,
sP0_iProver_def = sP1_iProver_def,
inference(light_normalisation,[status(thm)],[c_8889,c_8882]) ).
cnf(c_11769,plain,
sK55 != sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_8887,c_8882]) ).
cnf(c_11788,plain,
app(sK55,sK57) = sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_8881,c_11768]) ).
cnf(c_11837,plain,
( ~ ssList(X0)
| app(X0,sP0_iProver_def) = X0 ),
inference(light_normalisation,[status(thm)],[c_8894,c_8882]) ).
cnf(c_11848,plain,
app(sK55,sP0_iProver_def) = sK55,
inference(superposition,[status(thm)],[c_8886,c_11837]) ).
cnf(c_12411,plain,
( app(X0,X1) != sP0_iProver_def
| ~ ssList(X0)
| ~ ssList(X1)
| X1 = sP0_iProver_def ),
inference(light_normalisation,[status(thm)],[c_8895,c_8882]) ).
cnf(c_12420,plain,
( ~ ssList(sK55)
| ~ ssList(sK57)
| sK57 = sP0_iProver_def ),
inference(superposition,[status(thm)],[c_11788,c_12411]) ).
cnf(c_12426,plain,
sK57 = sP0_iProver_def,
inference(forward_subsumption_resolution,[status(thm)],[c_12420,c_8888,c_8886]) ).
cnf(c_12429,plain,
app(sK55,sP0_iProver_def) = sP0_iProver_def,
inference(demodulation,[status(thm)],[c_11788,c_12426]) ).
cnf(c_12431,plain,
sK55 = sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_12429,c_11848]) ).
cnf(c_12432,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_12431,c_11769]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWC041+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n021.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 23:35:13 EDT 2024
% 0.11/0.32 % 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 --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.95/1.12 % SZS status Started for theBenchmark.p
% 3.95/1.12 % SZS status Theorem for theBenchmark.p
% 3.95/1.12
% 3.95/1.12 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.95/1.12
% 3.95/1.12 ------ iProver source info
% 3.95/1.12
% 3.95/1.12 git: date: 2024-05-02 19:28:25 +0000
% 3.95/1.12 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.95/1.12 git: non_committed_changes: false
% 3.95/1.12
% 3.95/1.12 ------ Parsing...
% 3.95/1.12 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.95/1.12
% 3.95/1.12 ------ 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.12
% 3.95/1.12 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.95/1.12
% 3.95/1.12 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.95/1.12 ------ Proving...
% 3.95/1.12 ------ Problem Properties
% 3.95/1.12
% 3.95/1.12
% 3.95/1.12 clauses 188
% 3.95/1.12 conjectures 54
% 3.95/1.12 EPR 55
% 3.95/1.12 Horn 120
% 3.95/1.12 unary 23
% 3.95/1.12 binary 40
% 3.95/1.12 lits 630
% 3.95/1.12 lits eq 84
% 3.95/1.12 fd_pure 0
% 3.95/1.12 fd_pseudo 0
% 3.95/1.12 fd_cond 21
% 3.95/1.12 fd_pseudo_cond 14
% 3.95/1.12 AC symbols 0
% 3.95/1.12
% 3.95/1.12 ------ Schedule dynamic 5 is on
% 3.95/1.12
% 3.95/1.12 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.95/1.12
% 3.95/1.12
% 3.95/1.12 ------
% 3.95/1.12 Current options:
% 3.95/1.12 ------
% 3.95/1.12
% 3.95/1.12
% 3.95/1.12
% 3.95/1.12
% 3.95/1.12 ------ Proving...
% 3.95/1.12
% 3.95/1.12
% 3.95/1.12 % SZS status Theorem for theBenchmark.p
% 3.95/1.12
% 3.95/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.95/1.12
% 3.95/1.12
%------------------------------------------------------------------------------