TSTP Solution File: SWC189+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC189+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n015.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:41:34 EDT 2023
% Result : Theorem 3.68s 1.16s
% Output : CNFRefutation 3.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 32 ( 15 unt; 0 def)
% Number of atoms : 308 ( 111 equ)
% Maximal formula atoms : 36 ( 9 avg)
% Number of connectives : 380 ( 104 ~; 81 |; 163 &)
% ( 0 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 8 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 168 ( 0 sgn; 72 !; 92 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ssList(X11)
=> ( X8 = X9
| app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) != X0 ) ) ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = X2
& X4 != X5
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
& ssItem(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ssList(X11)
=> ( X8 = X9
| app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) != X0 ) ) ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = X2
& X4 != X5
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
& ssItem(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ( X4 = X5
| app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) != X0 ) ) ) ) )
| ? [X8] :
( ? [X9] :
( ? [X10] :
( ? [X11] :
( app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) = X2
& X8 != X9
& ssList(X11) )
& ssList(X10) )
& ssItem(X9) )
& ssItem(X8) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( X4 != X5
& app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = X0
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ! [X11] :
( app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) != X2
| X8 = X9
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssItem(X9) )
| ~ ssItem(X8) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f223,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( X4 != X5
& app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = X0
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ! [X11] :
( app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) != X2
| X8 = X9
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssItem(X9) )
| ~ ssItem(X8) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f222]) ).
fof(f344,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( X4 != X5
& app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = X0
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ! [X11] :
( app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) != X2
| X8 = X9
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssItem(X9) )
| ~ ssItem(X8) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( X4 != X5
& app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = sK53
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ! [X11] :
( app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) != X2
| X8 = X9
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssItem(X9) )
| ~ ssItem(X8) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( X4 != X5
& app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = sK53
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ! [X11] :
( app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) != X2
| X8 = X9
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssItem(X9) )
| ~ ssItem(X8) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( X4 != X5
& app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = sK53
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ! [X11] :
( app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) != X2
| X8 = X9
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssItem(X9) )
| ~ ssItem(X8) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( X4 != X5
& app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = sK53
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ! [X11] :
( app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) != X2
| X8 = X9
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssItem(X9) )
| ~ ssItem(X8) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( X4 != X5
& app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = sK53
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ! [X11] :
( app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) != sK55
| X8 = X9
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssItem(X9) )
| ~ ssItem(X8) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( X4 != X5
& app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = sK53
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ! [X11] :
( app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) != sK55
| X8 = X9
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssItem(X9) )
| ~ ssItem(X8) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( X4 != X5
& app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = sK53
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ! [X11] :
( app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) != sK55
| X8 = X9
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssItem(X9) )
| ~ ssItem(X8) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( X4 != X5
& app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = sK53
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
& ssItem(X4) )
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( sK57 != X5
& sK53 = app(app(app(X6,cons(sK57,nil)),cons(X5,nil)),X7)
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
& ssItem(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
( ? [X5] :
( ? [X6] :
( ? [X7] :
( sK57 != X5
& sK53 = app(app(app(X6,cons(sK57,nil)),cons(X5,nil)),X7)
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
=> ( ? [X6] :
( ? [X7] :
( sK57 != sK58
& sK53 = app(app(app(X6,cons(sK57,nil)),cons(sK58,nil)),X7)
& ssList(X7) )
& ssList(X6) )
& ssItem(sK58) ) ),
introduced(choice_axiom,[]) ).
fof(f350,plain,
( ? [X6] :
( ? [X7] :
( sK57 != sK58
& sK53 = app(app(app(X6,cons(sK57,nil)),cons(sK58,nil)),X7)
& ssList(X7) )
& ssList(X6) )
=> ( ? [X7] :
( sK57 != sK58
& sK53 = app(app(app(sK59,cons(sK57,nil)),cons(sK58,nil)),X7)
& ssList(X7) )
& ssList(sK59) ) ),
introduced(choice_axiom,[]) ).
fof(f351,plain,
( ? [X7] :
( sK57 != sK58
& sK53 = app(app(app(sK59,cons(sK57,nil)),cons(sK58,nil)),X7)
& ssList(X7) )
=> ( sK57 != sK58
& sK53 = app(app(app(sK59,cons(sK57,nil)),cons(sK58,nil)),sK60)
& ssList(sK60) ) ),
introduced(choice_axiom,[]) ).
fof(f352,plain,
( sK57 != sK58
& sK53 = app(app(app(sK59,cons(sK57,nil)),cons(sK58,nil)),sK60)
& ssList(sK60)
& ssList(sK59)
& ssItem(sK58)
& ssItem(sK57)
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ! [X11] :
( app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) != sK55
| X8 = X9
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssItem(X9) )
| ~ ssItem(X8) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57,sK58,sK59,sK60])],[f223,f351,f350,f349,f348,f347,f346,f345,f344]) ).
fof(f557,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f352]) ).
fof(f558,plain,
! [X10,X11,X8,X9] :
( app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) != sK55
| X8 = X9
| ~ ssList(X11)
| ~ ssList(X10)
| ~ ssItem(X9)
| ~ ssItem(X8) ),
inference(cnf_transformation,[],[f352]) ).
fof(f559,plain,
ssItem(sK57),
inference(cnf_transformation,[],[f352]) ).
fof(f560,plain,
ssItem(sK58),
inference(cnf_transformation,[],[f352]) ).
fof(f561,plain,
ssList(sK59),
inference(cnf_transformation,[],[f352]) ).
fof(f562,plain,
ssList(sK60),
inference(cnf_transformation,[],[f352]) ).
fof(f563,plain,
sK53 = app(app(app(sK59,cons(sK57,nil)),cons(sK58,nil)),sK60),
inference(cnf_transformation,[],[f352]) ).
fof(f564,plain,
sK57 != sK58,
inference(cnf_transformation,[],[f352]) ).
fof(f565,plain,
sK55 = app(app(app(sK59,cons(sK57,nil)),cons(sK58,nil)),sK60),
inference(definition_unfolding,[],[f563,f557]) ).
cnf(c_246,negated_conjecture,
sK57 != sK58,
inference(cnf_transformation,[],[f564]) ).
cnf(c_247,negated_conjecture,
app(app(app(sK59,cons(sK57,nil)),cons(sK58,nil)),sK60) = sK55,
inference(cnf_transformation,[],[f565]) ).
cnf(c_248,negated_conjecture,
ssList(sK60),
inference(cnf_transformation,[],[f562]) ).
cnf(c_249,negated_conjecture,
ssList(sK59),
inference(cnf_transformation,[],[f561]) ).
cnf(c_250,negated_conjecture,
ssItem(sK58),
inference(cnf_transformation,[],[f560]) ).
cnf(c_251,negated_conjecture,
ssItem(sK57),
inference(cnf_transformation,[],[f559]) ).
cnf(c_252,negated_conjecture,
( app(app(app(X0,cons(X1,nil)),cons(X2,nil)),X3) != sK55
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X0)
| ~ ssList(X3)
| X1 = X2 ),
inference(cnf_transformation,[],[f558]) ).
cnf(c_11676,plain,
( ~ ssItem(sK57)
| ~ ssItem(sK58)
| ~ ssList(sK59)
| ~ ssList(sK60)
| sK57 = sK58 ),
inference(superposition,[status(thm)],[c_247,c_252]) ).
cnf(c_11677,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11676,c_246,c_248,c_249,c_250,c_251]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC189+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Aug 28 17:46:40 EDT 2023
% 0.19/0.34 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.68/1.16 % SZS status Started for theBenchmark.p
% 3.68/1.16 % SZS status Theorem for theBenchmark.p
% 3.68/1.16
% 3.68/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.68/1.16
% 3.68/1.16 ------ iProver source info
% 3.68/1.16
% 3.68/1.16 git: date: 2023-05-31 18:12:56 +0000
% 3.68/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.68/1.16 git: non_committed_changes: false
% 3.68/1.16 git: last_make_outside_of_git: false
% 3.68/1.16
% 3.68/1.16 ------ Parsing...
% 3.68/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.68/1.16
% 3.68/1.16 ------ 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.68/1.16
% 3.68/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.68/1.16
% 3.68/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.68/1.16 ------ Proving...
% 3.68/1.16 ------ Problem Properties
% 3.68/1.16
% 3.68/1.16
% 3.68/1.16 clauses 189
% 3.68/1.16 conjectures 9
% 3.68/1.16 EPR 56
% 3.68/1.16 Horn 121
% 3.68/1.16 unary 24
% 3.68/1.16 binary 40
% 3.68/1.16 lits 632
% 3.68/1.16 lits eq 82
% 3.68/1.16 fd_pure 0
% 3.68/1.16 fd_pseudo 0
% 3.68/1.16 fd_cond 21
% 3.68/1.16 fd_pseudo_cond 15
% 3.68/1.16 AC symbols 0
% 3.68/1.16
% 3.68/1.16 ------ Schedule dynamic 5 is on
% 3.68/1.16
% 3.68/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.68/1.16
% 3.68/1.16
% 3.68/1.16 ------
% 3.68/1.16 Current options:
% 3.68/1.16 ------
% 3.68/1.16
% 3.68/1.16
% 3.68/1.16
% 3.68/1.16
% 3.68/1.16 ------ Proving...
% 3.68/1.16
% 3.68/1.16
% 3.68/1.16 % SZS status Theorem for theBenchmark.p
% 3.68/1.16
% 3.68/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.68/1.17
% 3.68/1.17
%------------------------------------------------------------------------------