TSTP Solution File: KLE148+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : KLE148+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n019.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:17 EDT 2023
% Result : Theorem 7.50s 1.64s
% Output : CNFRefutation 7.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 14
% Syntax : Number of formulae : 65 ( 47 unt; 0 def)
% Number of atoms : 100 ( 63 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 67 ( 32 ~; 22 |; 8 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 92 ( 4 sgn; 47 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_commutativity) ).
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(f3,axiom,
! [X0] : addition(X0,zero) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_identity) ).
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',idempotence) ).
fof(f5,axiom,
! [X0,X1,X2] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_associativity) ).
fof(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_right_identity) ).
fof(f8,axiom,
! [X0,X1,X2] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distributivity1) ).
fof(f10,axiom,
! [X0] : zero = multiplication(zero,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_annihilation) ).
fof(f15,axiom,
! [X0] : strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',infty_unfold1) ).
fof(f18,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',order) ).
fof(f19,conjecture,
! [X3,X4] :
( leq(X3,multiplication(X3,strong_iteration(X4)))
& ( zero = multiplication(X3,X4)
=> leq(multiplication(X3,strong_iteration(X4)),X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f20,negated_conjecture,
~ ! [X3,X4] :
( leq(X3,multiplication(X3,strong_iteration(X4)))
& ( zero = multiplication(X3,X4)
=> leq(multiplication(X3,strong_iteration(X4)),X3) ) ),
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,X1] :
( leq(X0,multiplication(X0,strong_iteration(X1)))
& ( zero = multiplication(X0,X1)
=> leq(multiplication(X0,strong_iteration(X1)),X0) ) ),
inference(rectify,[],[f20]) ).
fof(f26,plain,
? [X0,X1] :
( ~ leq(X0,multiplication(X0,strong_iteration(X1)))
| ( ~ leq(multiplication(X0,strong_iteration(X1)),X0)
& zero = multiplication(X0,X1) ) ),
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,X1] :
( ~ leq(X0,multiplication(X0,strong_iteration(X1)))
| ( ~ leq(multiplication(X0,strong_iteration(X1)),X0)
& zero = multiplication(X0,X1) ) )
=> ( ~ leq(sK0,multiplication(sK0,strong_iteration(sK1)))
| ( ~ leq(multiplication(sK0,strong_iteration(sK1)),sK0)
& zero = multiplication(sK0,sK1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
( ~ leq(sK0,multiplication(sK0,strong_iteration(sK1)))
| ( ~ leq(multiplication(sK0,strong_iteration(sK1)),sK0)
& zero = multiplication(sK0,sK1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f26,f28]) ).
fof(f30,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f31,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f21]) ).
fof(f32,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f33,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f34,plain,
! [X2,X0,X1] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
inference(cnf_transformation,[],[f5]) ).
fof(f35,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f37,plain,
! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
inference(cnf_transformation,[],[f8]) ).
fof(f39,plain,
! [X0] : zero = multiplication(zero,X0),
inference(cnf_transformation,[],[f10]) ).
fof(f44,plain,
! [X0] : strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
inference(cnf_transformation,[],[f15]) ).
fof(f48,plain,
! [X0,X1] :
( leq(X0,X1)
| addition(X0,X1) != X1 ),
inference(cnf_transformation,[],[f27]) ).
fof(f49,plain,
( ~ leq(sK0,multiplication(sK0,strong_iteration(sK1)))
| zero = multiplication(sK0,sK1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f50,plain,
( ~ leq(sK0,multiplication(sK0,strong_iteration(sK1)))
| ~ leq(multiplication(sK0,strong_iteration(sK1)),sK0) ),
inference(cnf_transformation,[],[f29]) ).
cnf(c_49,plain,
addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f30]) ).
cnf(c_50,plain,
addition(addition(X0,X1),X2) = addition(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f31]) ).
cnf(c_51,plain,
addition(X0,zero) = X0,
inference(cnf_transformation,[],[f32]) ).
cnf(c_52,plain,
addition(X0,X0) = X0,
inference(cnf_transformation,[],[f33]) ).
cnf(c_53,plain,
multiplication(multiplication(X0,X1),X2) = multiplication(X0,multiplication(X1,X2)),
inference(cnf_transformation,[],[f34]) ).
cnf(c_54,plain,
multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f35]) ).
cnf(c_56,plain,
addition(multiplication(X0,X1),multiplication(X0,X2)) = multiplication(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f37]) ).
cnf(c_58,plain,
multiplication(zero,X0) = zero,
inference(cnf_transformation,[],[f39]) ).
cnf(c_63,plain,
addition(multiplication(X0,strong_iteration(X0)),one) = strong_iteration(X0),
inference(cnf_transformation,[],[f44]) ).
cnf(c_66,plain,
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f48]) ).
cnf(c_68,negated_conjecture,
( ~ leq(multiplication(sK0,strong_iteration(sK1)),sK0)
| ~ leq(sK0,multiplication(sK0,strong_iteration(sK1))) ),
inference(cnf_transformation,[],[f50]) ).
cnf(c_69,negated_conjecture,
( ~ leq(sK0,multiplication(sK0,strong_iteration(sK1)))
| multiplication(sK0,sK1) = zero ),
inference(cnf_transformation,[],[f49]) ).
cnf(c_73,plain,
addition(sK0,sK0) = sK0,
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_76,plain,
( addition(sK0,sK0) != sK0
| leq(sK0,sK0) ),
inference(instantiation,[status(thm)],[c_66]) ).
cnf(c_88,plain,
addition(one,multiplication(X0,strong_iteration(X0))) = strong_iteration(X0),
inference(theory_normalisation,[status(thm)],[c_63,c_50,c_49]) ).
cnf(c_232,plain,
X0 = X0,
theory(equality) ).
cnf(c_237,plain,
( X0 != X1
| X2 != X3
| ~ leq(X1,X3)
| leq(X0,X2) ),
theory(equality) ).
cnf(c_241,plain,
sK0 = sK0,
inference(instantiation,[status(thm)],[c_232]) ).
cnf(c_565,plain,
addition(zero,X0) = X0,
inference(superposition,[status(thm)],[c_51,c_49]) ).
cnf(c_569,plain,
addition(zero,sK0) = sK0,
inference(instantiation,[status(thm)],[c_565]) ).
cnf(c_693,plain,
addition(X0,addition(X0,X1)) = addition(X0,X1),
inference(superposition,[status(thm)],[c_52,c_50]) ).
cnf(c_752,plain,
addition(multiplication(X0,one),multiplication(X0,multiplication(X1,strong_iteration(X1)))) = multiplication(X0,strong_iteration(X1)),
inference(superposition,[status(thm)],[c_88,c_56]) ).
cnf(c_771,plain,
addition(X0,multiplication(X0,multiplication(X1,strong_iteration(X1)))) = multiplication(X0,strong_iteration(X1)),
inference(light_normalisation,[status(thm)],[c_752,c_54]) ).
cnf(c_875,plain,
leq(X0,addition(X0,X1)),
inference(superposition,[status(thm)],[c_693,c_66]) ).
cnf(c_12733,plain,
( addition(zero,X0) != X1
| X2 != X3
| ~ leq(X1,X3)
| leq(addition(zero,X0),X2) ),
inference(instantiation,[status(thm)],[c_237]) ).
cnf(c_12734,plain,
( addition(zero,sK0) != sK0
| sK0 != sK0
| ~ leq(sK0,sK0)
| leq(addition(zero,sK0),sK0) ),
inference(instantiation,[status(thm)],[c_12733]) ).
cnf(c_17835,plain,
leq(X0,multiplication(X0,strong_iteration(X1))),
inference(superposition,[status(thm)],[c_771,c_875]) ).
cnf(c_17986,plain,
multiplication(sK0,sK1) = zero,
inference(backward_subsumption_resolution,[status(thm)],[c_69,c_17835]) ).
cnf(c_17987,plain,
~ leq(multiplication(sK0,strong_iteration(sK1)),sK0),
inference(backward_subsumption_resolution,[status(thm)],[c_68,c_17835]) ).
cnf(c_18553,plain,
multiplication(sK0,multiplication(sK1,X0)) = multiplication(zero,X0),
inference(superposition,[status(thm)],[c_17986,c_53]) ).
cnf(c_18563,plain,
multiplication(sK0,multiplication(sK1,X0)) = zero,
inference(light_normalisation,[status(thm)],[c_18553,c_58]) ).
cnf(c_18806,plain,
multiplication(sK0,strong_iteration(sK1)) = addition(sK0,zero),
inference(superposition,[status(thm)],[c_18563,c_771]) ).
cnf(c_18821,plain,
multiplication(sK0,strong_iteration(sK1)) = addition(zero,sK0),
inference(theory_normalisation,[status(thm)],[c_18806,c_50,c_49]) ).
cnf(c_18838,plain,
~ leq(addition(zero,sK0),sK0),
inference(demodulation,[status(thm)],[c_17987,c_18821]) ).
cnf(c_18839,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_18838,c_12734,c_569,c_241,c_76,c_73]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KLE148+2 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.16/0.34 % Computer : n019.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Tue Aug 29 12:07:28 EDT 2023
% 0.16/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
% 7.50/1.64 % SZS status Started for theBenchmark.p
% 7.50/1.64 % SZS status Theorem for theBenchmark.p
% 7.50/1.64
% 7.50/1.64 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 7.50/1.64
% 7.50/1.64 ------ iProver source info
% 7.50/1.64
% 7.50/1.64 git: date: 2023-05-31 18:12:56 +0000
% 7.50/1.64 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 7.50/1.64 git: non_committed_changes: false
% 7.50/1.64 git: last_make_outside_of_git: false
% 7.50/1.64
% 7.50/1.64 ------ Parsing...
% 7.50/1.64 ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.50/1.64
% 7.50/1.64 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 7.50/1.64
% 7.50/1.64 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.50/1.64
% 7.50/1.64 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.50/1.64 ------ Proving...
% 7.50/1.64 ------ Problem Properties
% 7.50/1.64
% 7.50/1.64
% 7.50/1.64 clauses 21
% 7.50/1.64 conjectures 2
% 7.50/1.64 EPR 0
% 7.50/1.64 Horn 21
% 7.50/1.64 unary 14
% 7.50/1.64 binary 7
% 7.50/1.64 lits 28
% 7.50/1.64 lits eq 17
% 7.50/1.64 fd_pure 0
% 7.50/1.64 fd_pseudo 0
% 7.50/1.64 fd_cond 0
% 7.50/1.64 fd_pseudo_cond 0
% 7.50/1.64 AC symbols 1
% 7.50/1.64
% 7.50/1.64 ------ Schedule dynamic 5 is on
% 7.50/1.64
% 7.50/1.64 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 7.50/1.64
% 7.50/1.64
% 7.50/1.64 ------
% 7.50/1.64 Current options:
% 7.50/1.64 ------
% 7.50/1.64
% 7.50/1.64
% 7.50/1.64
% 7.50/1.64
% 7.50/1.64 ------ Proving...
% 7.50/1.64
% 7.50/1.64
% 7.50/1.64 % SZS status Theorem for theBenchmark.p
% 7.50/1.64
% 7.50/1.64 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.50/1.64
% 7.50/1.65
%------------------------------------------------------------------------------