TSTP Solution File: SWV189+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWV189+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n024.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 22:31:30 EDT 2023
% Result : Theorem 3.85s 1.17s
% Output : CNFRefutation 3.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 43 ( 22 unt; 0 def)
% Number of atoms : 125 ( 29 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 121 ( 39 ~; 23 |; 43 &)
% ( 1 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-3 aty)
% Number of variables : 60 ( 0 sgn; 40 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] : ~ gt(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',irreflexivity_gt) ).
fof(f5,axiom,
! [X0,X1,X2] :
( ( leq(X1,X2)
& leq(X0,X1) )
=> leq(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_leq) ).
fof(f13,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> gt(succ(X1),X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_succ_gt_equiv) ).
fof(f28,axiom,
n0 = succ(tptp_minus_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',succ_tptp_minus_1) ).
fof(f29,axiom,
! [X0] : succ(X0) = plus(X0,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',succ_plus_1_r) ).
fof(f30,axiom,
! [X0] : succ(X0) = plus(n1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',succ_plus_1_l) ).
fof(f53,conjecture,
( ! [X13] :
( ( leq(X13,n4)
& leq(n0,X13) )
=> a_select3(center_init,X13,n0) = init )
=> ! [X17] :
( ( leq(X17,tptp_minus_1)
& leq(n0,X17) )
=> ! [X3] :
( ( leq(X3,n4)
& leq(n0,X3) )
=> init = a_select3(q_init,X17,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_init_0121) ).
fof(f54,negated_conjecture,
~ ( ! [X13] :
( ( leq(X13,n4)
& leq(n0,X13) )
=> a_select3(center_init,X13,n0) = init )
=> ! [X17] :
( ( leq(X17,tptp_minus_1)
& leq(n0,X17) )
=> ! [X3] :
( ( leq(X3,n4)
& leq(n0,X3) )
=> init = a_select3(q_init,X17,X3) ) ) ),
inference(negated_conjecture,[],[f53]) ).
fof(f107,plain,
~ ( ! [X0] :
( ( leq(X0,n4)
& leq(n0,X0) )
=> init = a_select3(center_init,X0,n0) )
=> ! [X1] :
( ( leq(X1,tptp_minus_1)
& leq(n0,X1) )
=> ! [X2] :
( ( leq(X2,n4)
& leq(n0,X2) )
=> init = a_select3(q_init,X1,X2) ) ) ),
inference(rectify,[],[f54]) ).
fof(f111,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X1,X2)
| ~ leq(X0,X1) ),
inference(ennf_transformation,[],[f5]) ).
fof(f112,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X1,X2)
| ~ leq(X0,X1) ),
inference(flattening,[],[f111]) ).
fof(f149,plain,
( ? [X1] :
( ? [X2] :
( init != a_select3(q_init,X1,X2)
& leq(X2,n4)
& leq(n0,X2) )
& leq(X1,tptp_minus_1)
& leq(n0,X1) )
& ! [X0] :
( init = a_select3(center_init,X0,n0)
| ~ leq(X0,n4)
| ~ leq(n0,X0) ) ),
inference(ennf_transformation,[],[f107]) ).
fof(f150,plain,
( ? [X1] :
( ? [X2] :
( init != a_select3(q_init,X1,X2)
& leq(X2,n4)
& leq(n0,X2) )
& leq(X1,tptp_minus_1)
& leq(n0,X1) )
& ! [X0] :
( init = a_select3(center_init,X0,n0)
| ~ leq(X0,n4)
| ~ leq(n0,X0) ) ),
inference(flattening,[],[f149]) ).
fof(f171,plain,
! [X0,X1] :
( ( leq(X0,X1)
| ~ gt(succ(X1),X0) )
& ( gt(succ(X1),X0)
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f13]) ).
fof(f217,plain,
( ? [X0] :
( ? [X1] :
( init != a_select3(q_init,X0,X1)
& leq(X1,n4)
& leq(n0,X1) )
& leq(X0,tptp_minus_1)
& leq(n0,X0) )
& ! [X2] :
( init = a_select3(center_init,X2,n0)
| ~ leq(X2,n4)
| ~ leq(n0,X2) ) ),
inference(rectify,[],[f150]) ).
fof(f218,plain,
( ? [X0] :
( ? [X1] :
( init != a_select3(q_init,X0,X1)
& leq(X1,n4)
& leq(n0,X1) )
& leq(X0,tptp_minus_1)
& leq(n0,X0) )
=> ( ? [X1] :
( init != a_select3(q_init,sK31,X1)
& leq(X1,n4)
& leq(n0,X1) )
& leq(sK31,tptp_minus_1)
& leq(n0,sK31) ) ),
introduced(choice_axiom,[]) ).
fof(f219,plain,
( ? [X1] :
( init != a_select3(q_init,sK31,X1)
& leq(X1,n4)
& leq(n0,X1) )
=> ( init != a_select3(q_init,sK31,sK32)
& leq(sK32,n4)
& leq(n0,sK32) ) ),
introduced(choice_axiom,[]) ).
fof(f220,plain,
( init != a_select3(q_init,sK31,sK32)
& leq(sK32,n4)
& leq(n0,sK32)
& leq(sK31,tptp_minus_1)
& leq(n0,sK31)
& ! [X2] :
( init = a_select3(center_init,X2,n0)
| ~ leq(X2,n4)
| ~ leq(n0,X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK31,sK32])],[f217,f219,f218]) ).
fof(f223,plain,
! [X0] : ~ gt(X0,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f225,plain,
! [X2,X0,X1] :
( leq(X0,X2)
| ~ leq(X1,X2)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f112]) ).
fof(f232,plain,
! [X0,X1] :
( gt(succ(X1),X0)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f171]) ).
fof(f300,plain,
n0 = succ(tptp_minus_1),
inference(cnf_transformation,[],[f28]) ).
fof(f301,plain,
! [X0] : succ(X0) = plus(X0,n1),
inference(cnf_transformation,[],[f29]) ).
fof(f302,plain,
! [X0] : succ(X0) = plus(n1,X0),
inference(cnf_transformation,[],[f30]) ).
fof(f332,plain,
leq(n0,sK31),
inference(cnf_transformation,[],[f220]) ).
fof(f333,plain,
leq(sK31,tptp_minus_1),
inference(cnf_transformation,[],[f220]) ).
fof(f374,plain,
! [X0,X1] :
( gt(plus(X1,n1),X0)
| ~ leq(X0,X1) ),
inference(definition_unfolding,[],[f232,f301]) ).
fof(f375,plain,
n0 = plus(tptp_minus_1,n1),
inference(definition_unfolding,[],[f300,f301]) ).
fof(f376,plain,
! [X0] : plus(X0,n1) = plus(n1,X0),
inference(definition_unfolding,[],[f302,f301]) ).
cnf(c_51,plain,
~ gt(X0,X0),
inference(cnf_transformation,[],[f223]) ).
cnf(c_53,plain,
( ~ leq(X0,X1)
| ~ leq(X1,X2)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f225]) ).
cnf(c_61,plain,
( ~ leq(X0,X1)
| gt(plus(X1,n1),X0) ),
inference(cnf_transformation,[],[f374]) ).
cnf(c_128,plain,
plus(tptp_minus_1,n1) = n0,
inference(cnf_transformation,[],[f375]) ).
cnf(c_129,plain,
plus(X0,n1) = plus(n1,X0),
inference(cnf_transformation,[],[f376]) ).
cnf(c_160,negated_conjecture,
leq(sK31,tptp_minus_1),
inference(cnf_transformation,[],[f333]) ).
cnf(c_161,negated_conjecture,
leq(n0,sK31),
inference(cnf_transformation,[],[f332]) ).
cnf(c_1606,plain,
plus(n1,tptp_minus_1) = n0,
inference(demodulation,[status(thm)],[c_128,c_129]) ).
cnf(c_8901,plain,
~ leq(plus(X0,n1),X0),
inference(superposition,[status(thm)],[c_61,c_51]) ).
cnf(c_9303,plain,
~ leq(plus(n1,X0),X0),
inference(superposition,[status(thm)],[c_129,c_8901]) ).
cnf(c_9368,plain,
~ leq(n0,tptp_minus_1),
inference(superposition,[status(thm)],[c_1606,c_9303]) ).
cnf(c_10208,plain,
( ~ leq(X0,sK31)
| leq(X0,tptp_minus_1) ),
inference(superposition,[status(thm)],[c_160,c_53]) ).
cnf(c_10355,plain,
( ~ leq(n0,sK31)
| leq(n0,tptp_minus_1) ),
inference(instantiation,[status(thm)],[c_10208]) ).
cnf(c_10356,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_10355,c_9368,c_161]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV189+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n024.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 : Tue Aug 29 08:07:08 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.85/1.17 % SZS status Started for theBenchmark.p
% 3.85/1.17 % SZS status Theorem for theBenchmark.p
% 3.85/1.17
% 3.85/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.85/1.17
% 3.85/1.17 ------ iProver source info
% 3.85/1.17
% 3.85/1.17 git: date: 2023-05-31 18:12:56 +0000
% 3.85/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.85/1.17 git: non_committed_changes: false
% 3.85/1.17 git: last_make_outside_of_git: false
% 3.85/1.17
% 3.85/1.17 ------ Parsing...
% 3.85/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.85/1.17
% 3.85/1.17 ------ Preprocessing... sup_sim: 16 sf_s rm: 1 0s sf_e pe_s pe_e
% 3.85/1.17
% 3.85/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.85/1.17
% 3.85/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.85/1.17 ------ Proving...
% 3.85/1.17 ------ Problem Properties
% 3.85/1.17
% 3.85/1.17
% 3.85/1.17 clauses 146
% 3.85/1.17 conjectures 6
% 3.85/1.17 EPR 40
% 3.85/1.17 Horn 96
% 3.85/1.17 unary 51
% 3.85/1.17 binary 34
% 3.85/1.17 lits 487
% 3.85/1.17 lits eq 115
% 3.85/1.17 fd_pure 0
% 3.85/1.17 fd_pseudo 0
% 3.85/1.17 fd_cond 6
% 3.85/1.17 fd_pseudo_cond 4
% 3.85/1.17 AC symbols 0
% 3.85/1.17
% 3.85/1.17 ------ Schedule dynamic 5 is on
% 3.85/1.17
% 3.85/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.85/1.17
% 3.85/1.17
% 3.85/1.17 ------
% 3.85/1.17 Current options:
% 3.85/1.17 ------
% 3.85/1.17
% 3.85/1.17
% 3.85/1.17
% 3.85/1.17
% 3.85/1.17 ------ Proving...
% 3.85/1.17
% 3.85/1.17
% 3.85/1.17 % SZS status Theorem for theBenchmark.p
% 3.85/1.17
% 3.85/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.85/1.17
% 3.85/1.17
%------------------------------------------------------------------------------