TSTP Solution File: SWV041+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWV041+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n014.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:30:53 EDT 2023
% Result : Theorem 4.02s 1.17s
% Output : CNFRefutation 4.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of formulae : 51 ( 31 unt; 0 def)
% Number of atoms : 120 ( 29 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 99 ( 30 ~; 15 |; 41 &)
% ( 1 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 11 con; 0-3 aty)
% Number of variables : 58 ( 0 sgn; 38 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] : ~ gt(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',irreflexivity_gt) ).
fof(f5,axiom,
! [X0,X1,X2] :
( ( leq(X1,X2)
& leq(X0,X1) )
=> leq(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_leq) ).
fof(f13,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> gt(succ(X1),X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leq_succ_gt_equiv) ).
fof(f28,axiom,
n0 = succ(tptp_minus_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',succ_tptp_minus_1) ).
fof(f29,axiom,
! [X0] : succ(X0) = plus(X0,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',succ_plus_1_r) ).
fof(f30,axiom,
! [X0] : succ(X0) = plus(n1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',succ_plus_1_l) ).
fof(f39,axiom,
! [X0] : minus(X0,n1) = pred(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pred_minus_1) ).
fof(f40,axiom,
! [X0] : pred(succ(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pred_succ) ).
fof(f53,conjecture,
( ( geq(minus(n410,n1),n0)
& geq(minus(n330,n1),n0) )
=> ! [X13] :
( ( leq(X13,n2)
& leq(n0,X13) )
=> ! [X17] :
( ( leq(X17,minus(n0,n1))
& leq(n0,X17) )
=> a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X17,X13) = init ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gauss_init_0077) ).
fof(f54,negated_conjecture,
~ ( ( geq(minus(n410,n1),n0)
& geq(minus(n330,n1),n0) )
=> ! [X13] :
( ( leq(X13,n2)
& leq(n0,X13) )
=> ! [X17] :
( ( leq(X17,minus(n0,n1))
& leq(n0,X17) )
=> a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X17,X13) = init ) ) ),
inference(negated_conjecture,[],[f53]) ).
fof(f122,plain,
~ ( ( geq(minus(n410,n1),n0)
& geq(minus(n330,n1),n0) )
=> ! [X0] :
( ( leq(X0,n2)
& leq(n0,X0) )
=> ! [X1] :
( ( leq(X1,minus(n0,n1))
& leq(n0,X1) )
=> init = a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X1,X0) ) ) ),
inference(rectify,[],[f54]) ).
fof(f127,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X1,X2)
| ~ leq(X0,X1) ),
inference(ennf_transformation,[],[f5]) ).
fof(f128,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X1,X2)
| ~ leq(X0,X1) ),
inference(flattening,[],[f127]) ).
fof(f166,plain,
( ? [X0] :
( ? [X1] :
( init != a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X1,X0)
& leq(X1,minus(n0,n1))
& leq(n0,X1) )
& leq(X0,n2)
& leq(n0,X0) )
& geq(minus(n410,n1),n0)
& geq(minus(n330,n1),n0) ),
inference(ennf_transformation,[],[f122]) ).
fof(f167,plain,
( ? [X0] :
( ? [X1] :
( init != a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X1,X0)
& leq(X1,minus(n0,n1))
& leq(n0,X1) )
& leq(X0,n2)
& leq(n0,X0) )
& geq(minus(n410,n1),n0)
& geq(minus(n330,n1),n0) ),
inference(flattening,[],[f166]) ).
fof(f188,plain,
! [X0,X1] :
( ( leq(X0,X1)
| ~ gt(succ(X1),X0) )
& ( gt(succ(X1),X0)
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f13]) ).
fof(f234,plain,
( ? [X0] :
( ? [X1] :
( init != a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X1,X0)
& leq(X1,minus(n0,n1))
& leq(n0,X1) )
& leq(X0,n2)
& leq(n0,X0) )
=> ( ? [X1] :
( init != a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X1,sK31)
& leq(X1,minus(n0,n1))
& leq(n0,X1) )
& leq(sK31,n2)
& leq(n0,sK31) ) ),
introduced(choice_axiom,[]) ).
fof(f235,plain,
( ? [X1] :
( init != a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X1,sK31)
& leq(X1,minus(n0,n1))
& leq(n0,X1) )
=> ( init != a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),sK32,sK31)
& leq(sK32,minus(n0,n1))
& leq(n0,sK32) ) ),
introduced(choice_axiom,[]) ).
fof(f236,plain,
( init != a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),sK32,sK31)
& leq(sK32,minus(n0,n1))
& leq(n0,sK32)
& leq(sK31,n2)
& leq(n0,sK31)
& geq(minus(n410,n1),n0)
& geq(minus(n330,n1),n0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK31,sK32])],[f167,f235,f234]) ).
fof(f239,plain,
! [X0] : ~ gt(X0,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f241,plain,
! [X2,X0,X1] :
( leq(X0,X2)
| ~ leq(X1,X2)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f128]) ).
fof(f249,plain,
! [X0,X1] :
( gt(succ(X1),X0)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f188]) ).
fof(f317,plain,
n0 = succ(tptp_minus_1),
inference(cnf_transformation,[],[f28]) ).
fof(f318,plain,
! [X0] : succ(X0) = plus(X0,n1),
inference(cnf_transformation,[],[f29]) ).
fof(f319,plain,
! [X0] : succ(X0) = plus(n1,X0),
inference(cnf_transformation,[],[f30]) ).
fof(f328,plain,
! [X0] : minus(X0,n1) = pred(X0),
inference(cnf_transformation,[],[f39]) ).
fof(f329,plain,
! [X0] : pred(succ(X0)) = X0,
inference(cnf_transformation,[],[f40]) ).
fof(f352,plain,
leq(n0,sK32),
inference(cnf_transformation,[],[f236]) ).
fof(f353,plain,
leq(sK32,minus(n0,n1)),
inference(cnf_transformation,[],[f236]) ).
fof(f407,plain,
! [X0,X1] :
( gt(plus(X1,n1),X0)
| ~ leq(X0,X1) ),
inference(definition_unfolding,[],[f249,f318]) ).
fof(f408,plain,
n0 = plus(tptp_minus_1,n1),
inference(definition_unfolding,[],[f317,f318]) ).
fof(f409,plain,
! [X0] : plus(X0,n1) = plus(n1,X0),
inference(definition_unfolding,[],[f319,f318]) ).
fof(f418,plain,
! [X0] : minus(plus(X0,n1),n1) = X0,
inference(definition_unfolding,[],[f329,f328,f318]) ).
cnf(c_51,plain,
~ gt(X0,X0),
inference(cnf_transformation,[],[f239]) ).
cnf(c_53,plain,
( ~ leq(X0,X1)
| ~ leq(X1,X2)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f241]) ).
cnf(c_62,plain,
( ~ leq(X0,X1)
| gt(plus(X1,n1),X0) ),
inference(cnf_transformation,[],[f407]) ).
cnf(c_129,plain,
plus(tptp_minus_1,n1) = n0,
inference(cnf_transformation,[],[f408]) ).
cnf(c_130,plain,
plus(X0,n1) = plus(n1,X0),
inference(cnf_transformation,[],[f409]) ).
cnf(c_139,plain,
minus(plus(X0,n1),n1) = X0,
inference(cnf_transformation,[],[f418]) ).
cnf(c_159,negated_conjecture,
leq(sK32,minus(n0,n1)),
inference(cnf_transformation,[],[f353]) ).
cnf(c_160,negated_conjecture,
leq(n0,sK32),
inference(cnf_transformation,[],[f352]) ).
cnf(c_1679,plain,
plus(n1,tptp_minus_1) = n0,
inference(demodulation,[status(thm)],[c_129,c_130]) ).
cnf(c_14342,plain,
minus(plus(n1,X0),n1) = X0,
inference(superposition,[status(thm)],[c_130,c_139]) ).
cnf(c_14480,plain,
~ leq(plus(X0,n1),X0),
inference(superposition,[status(thm)],[c_62,c_51]) ).
cnf(c_14654,plain,
~ leq(plus(n1,X0),X0),
inference(superposition,[status(thm)],[c_130,c_14480]) ).
cnf(c_14669,plain,
minus(n0,n1) = tptp_minus_1,
inference(superposition,[status(thm)],[c_1679,c_14342]) ).
cnf(c_14679,plain,
leq(sK32,tptp_minus_1),
inference(demodulation,[status(thm)],[c_159,c_14669]) ).
cnf(c_14712,plain,
~ leq(n0,tptp_minus_1),
inference(superposition,[status(thm)],[c_1679,c_14654]) ).
cnf(c_15398,plain,
( ~ leq(X0,sK32)
| leq(X0,tptp_minus_1) ),
inference(superposition,[status(thm)],[c_14679,c_53]) ).
cnf(c_15552,plain,
( ~ leq(n0,sK32)
| leq(n0,tptp_minus_1) ),
inference(instantiation,[status(thm)],[c_15398]) ).
cnf(c_15553,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_15552,c_14712,c_160]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV041+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n014.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 29 08:19:15 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.02/1.17 % SZS status Started for theBenchmark.p
% 4.02/1.17 % SZS status Theorem for theBenchmark.p
% 4.02/1.17
% 4.02/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 4.02/1.17
% 4.02/1.17 ------ iProver source info
% 4.02/1.17
% 4.02/1.17 git: date: 2023-05-31 18:12:56 +0000
% 4.02/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 4.02/1.17 git: non_committed_changes: false
% 4.02/1.17 git: last_make_outside_of_git: false
% 4.02/1.17
% 4.02/1.17 ------ Parsing...
% 4.02/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.02/1.17
% 4.02/1.17 ------ Preprocessing... sup_sim: 16 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 4.02/1.17
% 4.02/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.02/1.17
% 4.02/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.02/1.17 ------ Proving...
% 4.02/1.17 ------ Problem Properties
% 4.02/1.17
% 4.02/1.17
% 4.02/1.17 clauses 162
% 4.02/1.17 conjectures 5
% 4.02/1.17 EPR 54
% 4.02/1.17 Horn 112
% 4.02/1.17 unary 68
% 4.02/1.17 binary 34
% 4.02/1.17 lits 501
% 4.02/1.17 lits eq 114
% 4.02/1.17 fd_pure 0
% 4.02/1.17 fd_pseudo 0
% 4.02/1.17 fd_cond 6
% 4.02/1.17 fd_pseudo_cond 4
% 4.02/1.17 AC symbols 0
% 4.02/1.17
% 4.02/1.17 ------ Schedule dynamic 5 is on
% 4.02/1.17
% 4.02/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.02/1.17
% 4.02/1.17
% 4.02/1.17 ------
% 4.02/1.17 Current options:
% 4.02/1.17 ------
% 4.02/1.17
% 4.02/1.17
% 4.02/1.17
% 4.02/1.17
% 4.02/1.17 ------ Proving...
% 4.02/1.17
% 4.02/1.17
% 4.02/1.17 % SZS status Theorem for theBenchmark.p
% 4.02/1.17
% 4.02/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.02/1.17
% 4.02/1.18
%------------------------------------------------------------------------------