TSTP Solution File: KLE139+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : KLE139+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n012.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 10.40s 2.17s
% Output : CNFRefutation 10.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 14
% Syntax : Number of formulae : 69 ( 62 unt; 0 def)
% Number of atoms : 78 ( 64 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 26 ( 17 ~; 6 |; 1 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 112 ( 7 sgn; 54 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_commutativity) ).
fof(f2,axiom,
! [X2,X1,X0] : addition(X0,addition(X1,X2)) = addition(addition(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_associativity) ).
fof(f3,axiom,
! [X0] : addition(X0,zero) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_identity) ).
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence) ).
fof(f5,axiom,
! [X0,X1,X2] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_associativity) ).
fof(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',distributivity1) ).
fof(f9,axiom,
! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',distributivity2) ).
fof(f10,axiom,
! [X0] : zero = multiplication(zero,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_annihilation) ).
fof(f12,axiom,
! [X0] : star(X0) = addition(one,multiplication(star(X0),X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',star_unfold2) ).
fof(f17,axiom,
! [X0] : strong_iteration(X0) = addition(star(X0),multiplication(strong_iteration(X0),zero)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',isolation) ).
fof(f18,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',order) ).
fof(f19,conjecture,
! [X3] : strong_iteration(X3) = addition(multiplication(strong_iteration(X3),X3),one),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f20,negated_conjecture,
~ ! [X3] : strong_iteration(X3) = addition(multiplication(strong_iteration(X3),X3),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] : strong_iteration(X0) = addition(multiplication(strong_iteration(X0),X0),one),
inference(rectify,[],[f20]) ).
fof(f26,plain,
? [X0] : strong_iteration(X0) != addition(multiplication(strong_iteration(X0),X0),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] : strong_iteration(X0) != addition(multiplication(strong_iteration(X0),X0),one)
=> strong_iteration(sK0) != addition(multiplication(strong_iteration(sK0),sK0),one) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
strong_iteration(sK0) != addition(multiplication(strong_iteration(sK0),sK0),one),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[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(f38,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f39,plain,
! [X0] : zero = multiplication(zero,X0),
inference(cnf_transformation,[],[f10]) ).
fof(f41,plain,
! [X0] : star(X0) = addition(one,multiplication(star(X0),X0)),
inference(cnf_transformation,[],[f12]) ).
fof(f46,plain,
! [X0] : strong_iteration(X0) = addition(star(X0),multiplication(strong_iteration(X0),zero)),
inference(cnf_transformation,[],[f17]) ).
fof(f47,plain,
! [X0,X1] :
( addition(X0,X1) = X1
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f48,plain,
! [X0,X1] :
( leq(X0,X1)
| addition(X0,X1) != X1 ),
inference(cnf_transformation,[],[f27]) ).
fof(f49,plain,
strong_iteration(sK0) != addition(multiplication(strong_iteration(sK0),sK0),one),
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_57,plain,
addition(multiplication(X0,X1),multiplication(X2,X1)) = multiplication(addition(X0,X2),X1),
inference(cnf_transformation,[],[f38]) ).
cnf(c_58,plain,
multiplication(zero,X0) = zero,
inference(cnf_transformation,[],[f39]) ).
cnf(c_60,plain,
addition(one,multiplication(star(X0),X0)) = star(X0),
inference(cnf_transformation,[],[f41]) ).
cnf(c_65,plain,
addition(star(X0),multiplication(strong_iteration(X0),zero)) = strong_iteration(X0),
inference(cnf_transformation,[],[f46]) ).
cnf(c_66,plain,
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f48]) ).
cnf(c_67,plain,
( ~ leq(X0,X1)
| addition(X0,X1) = X1 ),
inference(cnf_transformation,[],[f47]) ).
cnf(c_68,negated_conjecture,
addition(multiplication(strong_iteration(sK0),sK0),one) != strong_iteration(sK0),
inference(cnf_transformation,[],[f49]) ).
cnf(c_87,negated_conjecture,
addition(one,multiplication(strong_iteration(sK0),sK0)) != strong_iteration(sK0),
inference(theory_normalisation,[status(thm)],[c_68,c_50,c_49]) ).
cnf(c_499,plain,
addition(X0,addition(X1,X2)) = addition(X1,addition(X0,X2)),
inference(superposition,[status(thm)],[c_50,c_49]) ).
cnf(c_654,plain,
addition(star(X0),addition(X1,multiplication(strong_iteration(X0),zero))) = addition(X1,strong_iteration(X0)),
inference(superposition,[status(thm)],[c_65,c_499]) ).
cnf(c_677,plain,
addition(X0,addition(X0,X1)) = addition(X0,X1),
inference(superposition,[status(thm)],[c_52,c_50]) ).
cnf(c_679,plain,
addition(one,addition(multiplication(star(X0),X0),X1)) = addition(star(X0),X1),
inference(superposition,[status(thm)],[c_60,c_50]) ).
cnf(c_729,plain,
addition(multiplication(X0,X1),multiplication(X0,zero)) = multiplication(X0,X1),
inference(superposition,[status(thm)],[c_51,c_56]) ).
cnf(c_820,plain,
addition(star(X0),strong_iteration(X0)) = strong_iteration(X0),
inference(superposition,[status(thm)],[c_65,c_677]) ).
cnf(c_825,plain,
leq(X0,addition(X0,X1)),
inference(superposition,[status(thm)],[c_677,c_66]) ).
cnf(c_842,plain,
leq(X0,addition(X1,X0)),
inference(superposition,[status(thm)],[c_49,c_825]) ).
cnf(c_877,plain,
leq(X0,addition(X1,addition(X2,X0))),
inference(superposition,[status(thm)],[c_50,c_842]) ).
cnf(c_1049,plain,
addition(multiplication(star(X0),X1),multiplication(multiplication(strong_iteration(X0),zero),X1)) = multiplication(strong_iteration(X0),X1),
inference(superposition,[status(thm)],[c_65,c_57]) ).
cnf(c_15026,plain,
addition(X0,multiplication(X0,zero)) = X0,
inference(superposition,[status(thm)],[c_54,c_729]) ).
cnf(c_15394,plain,
leq(multiplication(X0,zero),addition(X1,X0)),
inference(superposition,[status(thm)],[c_15026,c_877]) ).
cnf(c_15914,plain,
leq(multiplication(X0,zero),addition(X0,X1)),
inference(superposition,[status(thm)],[c_49,c_15394]) ).
cnf(c_16228,plain,
leq(multiplication(star(X0),zero),strong_iteration(X0)),
inference(superposition,[status(thm)],[c_820,c_15914]) ).
cnf(c_16382,plain,
addition(multiplication(star(X0),zero),strong_iteration(X0)) = strong_iteration(X0),
inference(superposition,[status(thm)],[c_16228,c_67]) ).
cnf(c_42259,plain,
addition(multiplication(star(X0),X1),multiplication(strong_iteration(X0),zero)) = multiplication(strong_iteration(X0),X1),
inference(demodulation,[status(thm)],[c_1049,c_53,c_58]) ).
cnf(c_42323,plain,
addition(one,addition(multiplication(star(sK0),sK0),multiplication(strong_iteration(sK0),zero))) != strong_iteration(sK0),
inference(demodulation,[status(thm)],[c_87,c_42259]) ).
cnf(c_42456,plain,
addition(multiplication(star(X0),X1),strong_iteration(X0)) = addition(star(X0),multiplication(strong_iteration(X0),X1)),
inference(superposition,[status(thm)],[c_42259,c_654]) ).
cnf(c_45232,plain,
strong_iteration(sK0) != strong_iteration(sK0),
inference(demodulation,[status(thm)],[c_42323,c_679,c_16382,c_42456]) ).
cnf(c_45233,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_45232]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KLE139+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n012.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:10:09 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.20/0.46 Running first-order theorem proving
% 0.20/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 10.40/2.17 % SZS status Started for theBenchmark.p
% 10.40/2.17 % SZS status Theorem for theBenchmark.p
% 10.40/2.17
% 10.40/2.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 10.40/2.17
% 10.40/2.17 ------ iProver source info
% 10.40/2.17
% 10.40/2.17 git: date: 2023-05-31 18:12:56 +0000
% 10.40/2.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 10.40/2.17 git: non_committed_changes: false
% 10.40/2.17 git: last_make_outside_of_git: false
% 10.40/2.17
% 10.40/2.17 ------ Parsing...
% 10.40/2.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 10.40/2.17
% 10.40/2.17 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 10.40/2.17
% 10.40/2.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 10.40/2.17
% 10.40/2.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 10.40/2.17 ------ Proving...
% 10.40/2.17 ------ Problem Properties
% 10.40/2.17
% 10.40/2.17
% 10.40/2.17 clauses 20
% 10.40/2.17 conjectures 1
% 10.40/2.17 EPR 0
% 10.40/2.17 Horn 20
% 10.40/2.17 unary 15
% 10.40/2.17 binary 5
% 10.40/2.17 lits 25
% 10.40/2.17 lits eq 17
% 10.40/2.17 fd_pure 0
% 10.40/2.17 fd_pseudo 0
% 10.40/2.17 fd_cond 0
% 10.40/2.17 fd_pseudo_cond 0
% 10.40/2.17 AC symbols 1
% 10.40/2.17
% 10.40/2.17 ------ Schedule dynamic 5 is on
% 10.40/2.17
% 10.40/2.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 10.40/2.17
% 10.40/2.17
% 10.40/2.17 ------
% 10.40/2.17 Current options:
% 10.40/2.17 ------
% 10.40/2.17
% 10.40/2.17
% 10.40/2.17
% 10.40/2.17
% 10.40/2.17 ------ Proving...
% 10.40/2.17
% 10.40/2.17
% 10.40/2.17 % SZS status Theorem for theBenchmark.p
% 10.40/2.17
% 10.40/2.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.40/2.17
% 10.40/2.17
%------------------------------------------------------------------------------