TSTP Solution File: SWC095+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC095+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 : Thu Aug 31 20:40:56 EDT 2023
% Result : Theorem 0.47s 1.23s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 29 ( 13 unt; 0 def)
% Number of atoms : 252 ( 103 equ)
% Maximal formula atoms : 32 ( 8 avg)
% Number of connectives : 312 ( 89 ~; 73 |; 128 &)
% ( 0 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 125 ( 0 sgn; 57 !; 65 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( app(X7,X9) != X3
| app(app(X7,X8),X9) != X2
| ~ ssList(X9) ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X1
& app(app(X4,X5),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( app(X7,X9) != X3
| app(app(X7,X8),X9) != X2
| ~ ssList(X9) ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X1
& app(app(X4,X5),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( app(X4,X6) != X3
| app(app(X4,X5),X6) != X2
| ~ ssList(X6) ) ) )
| ? [X7] :
( ? [X8] :
( ? [X9] :
( app(X7,X9) = X1
& app(app(X7,X8),X9) = X0
& ssList(X9) )
& ssList(X8) )
& ssList(X7) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X3
& app(app(X4,X5),X6) = X2
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X7,X9) != X1
| app(app(X7,X8),X9) != X0
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X3
& app(app(X4,X5),X6) = X2
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X7,X9) != X1
| app(app(X7,X8),X9) != X0
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X3
& app(app(X4,X5),X6) = X2
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X7,X9) != X1
| app(app(X7,X8),X9) != sK53
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X3
& app(app(X4,X5),X6) = X2
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X7,X9) != X1
| app(app(X7,X8),X9) != sK53
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X3
& app(app(X4,X5),X6) = X2
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X7,X9) != sK54
| app(app(X7,X8),X9) != sK53
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X3
& app(app(X4,X5),X6) = X2
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X7,X9) != sK54
| app(app(X7,X8),X9) != sK53
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X3
& app(app(X4,X5),X6) = sK55
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X7,X9) != sK54
| app(app(X7,X8),X9) != sK53
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X3
& app(app(X4,X5),X6) = sK55
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X7,X9) != sK54
| app(app(X7,X8),X9) != sK53
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = sK56
& app(app(X4,X5),X6) = sK55
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X7,X9) != sK54
| app(app(X7,X8),X9) != sK53
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = sK56
& app(app(X4,X5),X6) = sK55
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( ? [X6] :
( sK56 = app(sK57,X6)
& sK55 = app(app(sK57,X5),X6)
& ssList(X6) )
& ssList(X5) )
& ssList(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ? [X5] :
( ? [X6] :
( sK56 = app(sK57,X6)
& sK55 = app(app(sK57,X5),X6)
& ssList(X6) )
& ssList(X5) )
=> ( ? [X6] :
( sK56 = app(sK57,X6)
& sK55 = app(app(sK57,sK58),X6)
& ssList(X6) )
& ssList(sK58) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
( ? [X6] :
( sK56 = app(sK57,X6)
& sK55 = app(app(sK57,sK58),X6)
& ssList(X6) )
=> ( sK56 = app(sK57,sK59)
& sK55 = app(app(sK57,sK58),sK59)
& ssList(sK59) ) ),
introduced(choice_axiom,[]) ).
fof(f350,plain,
( sK56 = app(sK57,sK59)
& sK55 = app(app(sK57,sK58),sK59)
& ssList(sK59)
& ssList(sK58)
& ssList(sK57)
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X7,X9) != sK54
| app(app(X7,X8),X9) != sK53
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& 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])],[f222,f349,f348,f347,f346,f345,f344,f343]) ).
fof(f554,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f350]) ).
fof(f555,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f350]) ).
fof(f556,plain,
! [X8,X9,X7] :
( app(X7,X9) != sK54
| app(app(X7,X8),X9) != sK53
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssList(X7) ),
inference(cnf_transformation,[],[f350]) ).
fof(f557,plain,
ssList(sK57),
inference(cnf_transformation,[],[f350]) ).
fof(f558,plain,
ssList(sK58),
inference(cnf_transformation,[],[f350]) ).
fof(f559,plain,
ssList(sK59),
inference(cnf_transformation,[],[f350]) ).
fof(f560,plain,
sK55 = app(app(sK57,sK58),sK59),
inference(cnf_transformation,[],[f350]) ).
fof(f561,plain,
sK56 = app(sK57,sK59),
inference(cnf_transformation,[],[f350]) ).
fof(f562,plain,
! [X8,X9,X7] :
( app(X7,X9) != sK56
| app(app(X7,X8),X9) != sK55
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssList(X7) ),
inference(definition_unfolding,[],[f556,f554,f555]) ).
cnf(c_246,negated_conjecture,
app(sK57,sK59) = sK56,
inference(cnf_transformation,[],[f561]) ).
cnf(c_247,negated_conjecture,
app(app(sK57,sK58),sK59) = sK55,
inference(cnf_transformation,[],[f560]) ).
cnf(c_248,negated_conjecture,
ssList(sK59),
inference(cnf_transformation,[],[f559]) ).
cnf(c_249,negated_conjecture,
ssList(sK58),
inference(cnf_transformation,[],[f558]) ).
cnf(c_250,negated_conjecture,
ssList(sK57),
inference(cnf_transformation,[],[f557]) ).
cnf(c_251,negated_conjecture,
( app(app(X0,X1),X2) != sK55
| app(X0,X2) != sK56
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cnf_transformation,[],[f562]) ).
cnf(c_11654,plain,
( app(sK57,sK59) != sK56
| ~ ssList(sK57)
| ~ ssList(sK59)
| ~ ssList(sK58) ),
inference(superposition,[status(thm)],[c_247,c_251]) ).
cnf(c_11657,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11654,c_249,c_248,c_250,c_246]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.15 % Problem : SWC095+1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.16 % Command : run_iprover %s %d THM
% 0.14/0.37 % Computer : n021.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Mon Aug 28 14:45:44 EDT 2023
% 0.14/0.37 % CPUTime :
% 0.20/0.50 Running first-order theorem proving
% 0.20/0.50 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.47/1.23 % SZS status Started for theBenchmark.p
% 0.47/1.23 % SZS status Theorem for theBenchmark.p
% 0.47/1.23
% 0.47/1.23 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.47/1.23
% 0.47/1.23 ------ iProver source info
% 0.47/1.23
% 0.47/1.23 git: date: 2023-05-31 18:12:56 +0000
% 0.47/1.23 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.47/1.23 git: non_committed_changes: false
% 0.47/1.23 git: last_make_outside_of_git: false
% 0.47/1.23
% 0.47/1.23 ------ Parsing...
% 0.47/1.23 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.47/1.23
% 0.47/1.23 ------ 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
% 0.47/1.23
% 0.47/1.23 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.47/1.23
% 0.47/1.23 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.47/1.23 ------ Proving...
% 0.47/1.23 ------ Problem Properties
% 0.47/1.23
% 0.47/1.23
% 0.47/1.23 clauses 188
% 0.47/1.23 conjectures 8
% 0.47/1.23 EPR 54
% 0.47/1.23 Horn 120
% 0.47/1.23 unary 23
% 0.47/1.23 binary 40
% 0.47/1.23 lits 630
% 0.47/1.23 lits eq 82
% 0.47/1.23 fd_pure 0
% 0.47/1.23 fd_pseudo 0
% 0.47/1.23 fd_cond 21
% 0.47/1.23 fd_pseudo_cond 14
% 0.47/1.23 AC symbols 0
% 0.47/1.23
% 0.47/1.23 ------ Schedule dynamic 5 is on
% 0.47/1.23
% 0.47/1.23 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.47/1.23
% 0.47/1.23
% 0.47/1.23 ------
% 0.47/1.23 Current options:
% 0.47/1.23 ------
% 0.47/1.23
% 0.47/1.23
% 0.47/1.23
% 0.47/1.23
% 0.47/1.23 ------ Proving...
% 0.47/1.23
% 0.47/1.23
% 0.47/1.23 % SZS status Theorem for theBenchmark.p
% 0.47/1.23
% 0.47/1.23 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.47/1.23
% 0.47/1.23
%------------------------------------------------------------------------------