TSTP Solution File: SWV165+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWV165+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n018.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 : Fri May 3 03:13:39 EDT 2024
% Result : Theorem 0.80s 1.12s
% Output : CNFRefutation 0.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 42 ( 23 unt; 0 def)
% Number of atoms : 78 ( 19 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 64 ( 28 ~; 15 |; 15 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn 30 !; 3 ?)
% 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(f53,conjecture,
! [X13] :
( ( leq(X13,tptp_minus_1)
& leq(n0,X13) )
=> uninit = init ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_init_0001) ).
fof(f54,negated_conjecture,
~ ! [X13] :
( ( leq(X13,tptp_minus_1)
& leq(n0,X13) )
=> uninit = init ),
inference(negated_conjecture,[],[f53]) ).
fof(f107,plain,
~ ! [X0] :
( ( leq(X0,tptp_minus_1)
& leq(n0,X0) )
=> uninit = init ),
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,
? [X0] :
( uninit != init
& leq(X0,tptp_minus_1)
& leq(n0,X0) ),
inference(ennf_transformation,[],[f107]) ).
fof(f150,plain,
? [X0] :
( uninit != init
& leq(X0,tptp_minus_1)
& 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] :
( uninit != init
& leq(X0,tptp_minus_1)
& leq(n0,X0) )
=> ( uninit != init
& leq(sK31,tptp_minus_1)
& leq(n0,sK31) ) ),
introduced(choice_axiom,[]) ).
fof(f218,plain,
( uninit != init
& leq(sK31,tptp_minus_1)
& leq(n0,sK31) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK31])],[f150,f217]) ).
fof(f221,plain,
! [X0] : ~ gt(X0,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f223,plain,
! [X2,X0,X1] :
( leq(X0,X2)
| ~ leq(X1,X2)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f112]) ).
fof(f230,plain,
! [X0,X1] :
( gt(succ(X1),X0)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f171]) ).
fof(f298,plain,
n0 = succ(tptp_minus_1),
inference(cnf_transformation,[],[f28]) ).
fof(f299,plain,
! [X0] : succ(X0) = plus(X0,n1),
inference(cnf_transformation,[],[f29]) ).
fof(f300,plain,
! [X0] : succ(X0) = plus(n1,X0),
inference(cnf_transformation,[],[f30]) ).
fof(f329,plain,
leq(n0,sK31),
inference(cnf_transformation,[],[f218]) ).
fof(f330,plain,
leq(sK31,tptp_minus_1),
inference(cnf_transformation,[],[f218]) ).
fof(f369,plain,
! [X0,X1] :
( gt(plus(X1,n1),X0)
| ~ leq(X0,X1) ),
inference(definition_unfolding,[],[f230,f299]) ).
fof(f370,plain,
n0 = plus(tptp_minus_1,n1),
inference(definition_unfolding,[],[f298,f299]) ).
fof(f371,plain,
! [X0] : plus(X0,n1) = plus(n1,X0),
inference(definition_unfolding,[],[f300,f299]) ).
cnf(c_51,plain,
~ gt(X0,X0),
inference(cnf_transformation,[],[f221]) ).
cnf(c_53,plain,
( ~ leq(X0,X1)
| ~ leq(X1,X2)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f223]) ).
cnf(c_61,plain,
( ~ leq(X0,X1)
| gt(plus(X1,n1),X0) ),
inference(cnf_transformation,[],[f369]) ).
cnf(c_128,plain,
plus(tptp_minus_1,n1) = n0,
inference(cnf_transformation,[],[f370]) ).
cnf(c_129,plain,
plus(X0,n1) = plus(n1,X0),
inference(cnf_transformation,[],[f371]) ).
cnf(c_158,negated_conjecture,
leq(sK31,tptp_minus_1),
inference(cnf_transformation,[],[f330]) ).
cnf(c_159,negated_conjecture,
leq(n0,sK31),
inference(cnf_transformation,[],[f329]) ).
cnf(c_1589,plain,
plus(n1,tptp_minus_1) = n0,
inference(demodulation,[status(thm)],[c_128,c_129]) ).
cnf(c_5790,negated_conjecture,
leq(sK31,tptp_minus_1),
inference(demodulation,[status(thm)],[c_158]) ).
cnf(c_8785,plain,
~ leq(plus(X0,n1),X0),
inference(superposition,[status(thm)],[c_61,c_51]) ).
cnf(c_8806,plain,
~ leq(plus(n1,X0),X0),
inference(superposition,[status(thm)],[c_129,c_8785]) ).
cnf(c_8822,plain,
~ leq(n0,tptp_minus_1),
inference(superposition,[status(thm)],[c_1589,c_8806]) ).
cnf(c_9908,plain,
( ~ leq(X0,sK31)
| leq(X0,tptp_minus_1) ),
inference(superposition,[status(thm)],[c_5790,c_53]) ).
cnf(c_10075,plain,
( ~ leq(n0,sK31)
| leq(n0,tptp_minus_1) ),
inference(instantiation,[status(thm)],[c_9908]) ).
cnf(c_10076,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_10075,c_8822,c_159]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SWV165+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.10/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n018.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri May 3 00:32:31 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.80/1.12 % SZS status Started for theBenchmark.p
% 0.80/1.12 % SZS status Theorem for theBenchmark.p
% 0.80/1.12
% 0.80/1.12 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.80/1.12
% 0.80/1.12 ------ iProver source info
% 0.80/1.12
% 0.80/1.12 git: date: 2024-05-02 19:28:25 +0000
% 0.80/1.12 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.80/1.12 git: non_committed_changes: false
% 0.80/1.12
% 0.80/1.12 ------ Parsing...
% 0.80/1.12 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.80/1.12
% 0.80/1.12 ------ Preprocessing... sup_sim: 16 sf_s rm: 1 0s sf_e pe_s pe_e
% 0.80/1.12
% 0.80/1.12 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.80/1.12
% 0.80/1.12 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.80/1.12 ------ Proving...
% 0.80/1.12 ------ Problem Properties
% 0.80/1.12
% 0.80/1.12
% 0.80/1.12 clauses 143
% 0.80/1.12 conjectures 3
% 0.80/1.12 EPR 39
% 0.80/1.12 Horn 93
% 0.80/1.12 unary 49
% 0.80/1.12 binary 34
% 0.80/1.12 lits 482
% 0.80/1.12 lits eq 114
% 0.80/1.12 fd_pure 0
% 0.80/1.12 fd_pseudo 0
% 0.80/1.12 fd_cond 6
% 0.80/1.12 fd_pseudo_cond 4
% 0.80/1.12 AC symbols 0
% 0.80/1.12
% 0.80/1.12 ------ Schedule dynamic 5 is on
% 0.80/1.12
% 0.80/1.12 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.80/1.12
% 0.80/1.12
% 0.80/1.12 ------
% 0.80/1.12 Current options:
% 0.80/1.12 ------
% 0.80/1.12
% 0.80/1.12
% 0.80/1.12
% 0.80/1.12
% 0.80/1.12 ------ Proving...
% 0.80/1.12
% 0.80/1.12
% 0.80/1.12 % SZS status Theorem for theBenchmark.p
% 0.80/1.12
% 0.80/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.80/1.12
% 0.80/1.12
%------------------------------------------------------------------------------