TSTP Solution File: SWC007+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC007+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n019.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:15 EDT 2023
% Result : Theorem 3.77s 1.19s
% Output : CNFRefutation 3.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 38 ( 12 unt; 0 def)
% Number of atoms : 204 ( 93 equ)
% Maximal formula atoms : 24 ( 5 avg)
% Number of connectives : 263 ( 97 ~; 79 |; 73 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 92 ( 0 sgn; 55 !; 30 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax28) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X0
& app(app(X4,X5),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| X0 != X2
| X1 != X3
| nil != X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X0
& app(app(X4,X5),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| X0 != X2
| X1 != X3
| nil != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f134,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f201,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != X0
| app(app(X4,X5),X6) != X1
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& X0 = X2
& X1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != X0
| app(app(X4,X5),X6) != X1
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& X0 = X2
& X1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != X0
| app(app(X4,X5),X6) != X1
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& X0 = X2
& X1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK53
| app(app(X4,X5),X6) != X1
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& sK53 = X2
& X1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK53
| app(app(X4,X5),X6) != X1
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& sK53 = X2
& X1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK53
| app(app(X4,X5),X6) != sK54
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& sK53 = X2
& sK54 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK53
| app(app(X4,X5),X6) != sK54
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& sK53 = X2
& sK54 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK53
| app(app(X4,X5),X6) != sK54
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& sK53 = sK55
& sK54 = X3
& nil = sK55
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK53
| app(app(X4,X5),X6) != sK54
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& sK53 = sK55
& sK54 = X3
& nil = sK55
& ssList(X3) )
=> ( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK53
| app(app(X4,X5),X6) != sK54
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& sK53 = sK55
& sK54 = sK56
& nil = sK55
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK53
| app(app(X4,X5),X6) != sK54
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& sK53 = sK55
& sK54 = sK56
& nil = sK55
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56])],[f222,f346,f345,f344,f343]) ).
fof(f454,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f134]) ).
fof(f533,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f201]) ).
fof(f547,plain,
ssList(sK53),
inference(cnf_transformation,[],[f347]) ).
fof(f548,plain,
ssList(sK54),
inference(cnf_transformation,[],[f347]) ).
fof(f551,plain,
nil = sK55,
inference(cnf_transformation,[],[f347]) ).
fof(f552,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f347]) ).
fof(f553,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f347]) ).
fof(f554,plain,
! [X6,X4,X5] :
( app(X4,X6) != sK53
| app(app(X4,X5),X6) != sK54
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f347]) ).
fof(f564,plain,
! [X0] :
( app(sK55,X0) = X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f454,f551]) ).
fof(f610,plain,
! [X0] :
( app(X0,sK55) = X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f533,f551]) ).
fof(f613,plain,
! [X6,X4,X5] :
( app(X4,X6) != sK55
| app(app(X4,X5),X6) != sK56
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f554,f553,f552]) ).
fof(f614,plain,
ssList(sK56),
inference(definition_unfolding,[],[f548,f552]) ).
fof(f615,plain,
ssList(sK55),
inference(definition_unfolding,[],[f547,f553]) ).
cnf(c_155,negated_conjecture,
( ~ ssList(X0)
| app(sK55,X0) = X0 ),
inference(cnf_transformation,[],[f564]) ).
cnf(c_232,negated_conjecture,
( ~ ssList(X0)
| app(X0,sK55) = X0 ),
inference(cnf_transformation,[],[f610]) ).
cnf(c_246,negated_conjecture,
( app(app(X0,X1),X2) != sK56
| app(X0,X2) != sK55
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cnf_transformation,[],[f613]) ).
cnf(c_249,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f614]) ).
cnf(c_250,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f615]) ).
cnf(c_291,plain,
( ~ ssList(sK55)
| app(sK55,sK55) = sK55 ),
inference(instantiation,[status(thm)],[c_232]) ).
cnf(c_11676,plain,
app(sK55,sK56) = sK56,
inference(superposition,[status(thm)],[c_249,c_155]) ).
cnf(c_11700,plain,
app(sK56,sK55) = sK56,
inference(superposition,[status(thm)],[c_249,c_232]) ).
cnf(c_12583,plain,
( app(sK55,X0) != sK55
| app(sK56,X0) != sK56
| ~ ssList(X0)
| ~ ssList(sK55)
| ~ ssList(sK56) ),
inference(superposition,[status(thm)],[c_11676,c_246]) ).
cnf(c_12593,plain,
( app(sK55,X0) != sK55
| app(sK56,X0) != sK56
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_12583,c_249,c_250]) ).
cnf(c_12597,plain,
( app(sK55,sK55) != sK55
| app(sK56,sK55) != sK56
| ~ ssList(sK55) ),
inference(instantiation,[status(thm)],[c_12593]) ).
cnf(c_12598,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_12597,c_11700,c_291,c_250]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWC007+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.14/0.36 % Computer : n019.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Aug 28 15:04:13 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.77/1.19 % SZS status Started for theBenchmark.p
% 3.77/1.19 % SZS status Theorem for theBenchmark.p
% 3.77/1.19
% 3.77/1.19 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.77/1.19
% 3.77/1.19 ------ iProver source info
% 3.77/1.19
% 3.77/1.19 git: date: 2023-05-31 18:12:56 +0000
% 3.77/1.19 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.77/1.19 git: non_committed_changes: false
% 3.77/1.19 git: last_make_outside_of_git: false
% 3.77/1.19
% 3.77/1.19 ------ Parsing...
% 3.77/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.77/1.19
% 3.77/1.19 ------ 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.77/1.19
% 3.77/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.77/1.19
% 3.77/1.19 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.77/1.19 ------ Proving...
% 3.77/1.19 ------ Problem Properties
% 3.77/1.19
% 3.77/1.19
% 3.77/1.19 clauses 182
% 3.77/1.19 conjectures 50
% 3.77/1.19 EPR 50
% 3.77/1.19 Horn 114
% 3.77/1.19 unary 17
% 3.77/1.19 binary 40
% 3.77/1.19 lits 624
% 3.77/1.19 lits eq 80
% 3.77/1.19 fd_pure 0
% 3.77/1.19 fd_pseudo 0
% 3.77/1.19 fd_cond 21
% 3.77/1.19 fd_pseudo_cond 14
% 3.77/1.19 AC symbols 0
% 3.77/1.19
% 3.77/1.19 ------ Schedule dynamic 5 is on
% 3.77/1.19
% 3.77/1.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.77/1.19
% 3.77/1.19
% 3.77/1.19 ------
% 3.77/1.19 Current options:
% 3.77/1.19 ------
% 3.77/1.19
% 3.77/1.19
% 3.77/1.19
% 3.77/1.19
% 3.77/1.19 ------ Proving...
% 3.77/1.19
% 3.77/1.19
% 3.77/1.19 % SZS status Theorem for theBenchmark.p
% 3.77/1.19
% 3.77/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.77/1.19
% 3.77/1.19
%------------------------------------------------------------------------------