TSTP Solution File: KLE137+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : KLE137+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n013.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 05:32:14 EDT 2023
% Result : Theorem 3.72s 1.15s
% Output : CNFRefutation 3.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 35 ( 25 unt; 0 def)
% Number of atoms : 47 ( 19 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 28 ( 16 ~; 8 |; 1 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 55 ( 4 sgn; 33 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X2,X1,X0] : addition(X0,addition(X1,X2)) = addition(addition(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_associativity) ).
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',idempotence) ).
fof(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_right_identity) ).
fof(f7,axiom,
! [X0] : multiplication(one,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_left_identity) ).
fof(f16,axiom,
! [X0,X1,X2] :
( leq(X2,addition(multiplication(X0,X2),X1))
=> leq(X2,multiplication(strong_iteration(X0),X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',infty_coinduction) ).
fof(f18,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',order) ).
fof(f19,conjecture,
! [X3] : leq(X3,strong_iteration(one)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f20,negated_conjecture,
~ ! [X3] : leq(X3,strong_iteration(one)),
inference(negated_conjecture,[],[f19]) ).
fof(f21,plain,
! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(rectify,[],[f2]) ).
fof(f22,plain,
~ ! [X0] : leq(X0,strong_iteration(one)),
inference(rectify,[],[f20]) ).
fof(f25,plain,
! [X0,X1,X2] :
( leq(X2,multiplication(strong_iteration(X0),X1))
| ~ leq(X2,addition(multiplication(X0,X2),X1)) ),
inference(ennf_transformation,[],[f16]) ).
fof(f26,plain,
? [X0] : ~ leq(X0,strong_iteration(one)),
inference(ennf_transformation,[],[f22]) ).
fof(f27,plain,
! [X0,X1] :
( ( leq(X0,X1)
| addition(X0,X1) != X1 )
& ( addition(X0,X1) = X1
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f18]) ).
fof(f28,plain,
( ? [X0] : ~ leq(X0,strong_iteration(one))
=> ~ leq(sK0,strong_iteration(one)) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
~ leq(sK0,strong_iteration(one)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f26,f28]) ).
fof(f31,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f21]) ).
fof(f33,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f35,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f36,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f45,plain,
! [X2,X0,X1] :
( leq(X2,multiplication(strong_iteration(X0),X1))
| ~ leq(X2,addition(multiplication(X0,X2),X1)) ),
inference(cnf_transformation,[],[f25]) ).
fof(f48,plain,
! [X0,X1] :
( leq(X0,X1)
| addition(X0,X1) != X1 ),
inference(cnf_transformation,[],[f27]) ).
fof(f49,plain,
~ leq(sK0,strong_iteration(one)),
inference(cnf_transformation,[],[f29]) ).
cnf(c_50,plain,
addition(addition(X0,X1),X2) = addition(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f31]) ).
cnf(c_52,plain,
addition(X0,X0) = X0,
inference(cnf_transformation,[],[f33]) ).
cnf(c_54,plain,
multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f35]) ).
cnf(c_55,plain,
multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f36]) ).
cnf(c_64,plain,
( ~ leq(X0,addition(multiplication(X1,X0),X2))
| leq(X0,multiplication(strong_iteration(X1),X2)) ),
inference(cnf_transformation,[],[f45]) ).
cnf(c_66,plain,
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f48]) ).
cnf(c_68,negated_conjecture,
~ leq(sK0,strong_iteration(one)),
inference(cnf_transformation,[],[f49]) ).
cnf(c_607,plain,
addition(X0,addition(X0,X1)) = addition(X0,X1),
inference(superposition,[status(thm)],[c_52,c_50]) ).
cnf(c_815,plain,
leq(X0,addition(X0,X1)),
inference(superposition,[status(thm)],[c_607,c_66]) ).
cnf(c_1197,plain,
( ~ leq(X0,addition(X0,X1))
| leq(X0,multiplication(strong_iteration(one),X1)) ),
inference(superposition,[status(thm)],[c_55,c_64]) ).
cnf(c_1204,plain,
leq(X0,multiplication(strong_iteration(one),X1)),
inference(forward_subsumption_resolution,[status(thm)],[c_1197,c_815]) ).
cnf(c_1285,plain,
leq(X0,strong_iteration(one)),
inference(superposition,[status(thm)],[c_54,c_1204]) ).
cnf(c_1290,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_68,c_1285]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KLE137+1 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n013.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 29 11:08:02 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.72/1.15 % SZS status Started for theBenchmark.p
% 3.72/1.15 % SZS status Theorem for theBenchmark.p
% 3.72/1.15
% 3.72/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.72/1.15
% 3.72/1.15 ------ iProver source info
% 3.72/1.15
% 3.72/1.15 git: date: 2023-05-31 18:12:56 +0000
% 3.72/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.72/1.15 git: non_committed_changes: false
% 3.72/1.15 git: last_make_outside_of_git: false
% 3.72/1.15
% 3.72/1.15 ------ Parsing...
% 3.72/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.72/1.15
% 3.72/1.15 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 3.72/1.15
% 3.72/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.72/1.15
% 3.72/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.72/1.15 ------ Proving...
% 3.72/1.15 ------ Problem Properties
% 3.72/1.15
% 3.72/1.15
% 3.72/1.15 clauses 20
% 3.72/1.15 conjectures 1
% 3.72/1.15 EPR 0
% 3.72/1.15 Horn 20
% 3.72/1.15 unary 15
% 3.72/1.15 binary 5
% 3.72/1.15 lits 25
% 3.72/1.15 lits eq 16
% 3.72/1.15 fd_pure 0
% 3.72/1.15 fd_pseudo 0
% 3.72/1.15 fd_cond 0
% 3.72/1.15 fd_pseudo_cond 0
% 3.72/1.15 AC symbols 1
% 3.72/1.15
% 3.72/1.15 ------ Schedule dynamic 5 is on
% 3.72/1.15
% 3.72/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.72/1.15
% 3.72/1.15
% 3.72/1.15 ------
% 3.72/1.15 Current options:
% 3.72/1.15 ------
% 3.72/1.15
% 3.72/1.15
% 3.72/1.15
% 3.72/1.15
% 3.72/1.15 ------ Proving...
% 3.72/1.15
% 3.72/1.15
% 3.72/1.15 % SZS status Theorem for theBenchmark.p
% 3.72/1.15
% 3.72/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.72/1.15
% 3.72/1.15
%------------------------------------------------------------------------------