TSTP Solution File: KLE144+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : KLE144+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n017.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:16 EDT 2023
% Result : Theorem 7.74s 1.65s
% Output : CNFRefutation 7.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of formulae : 54 ( 33 unt; 0 def)
% Number of atoms : 79 ( 29 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 52 ( 27 ~; 18 |; 4 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 97 ( 13 sgn; 45 !; 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(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence) ).
fof(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_right_identity) ).
fof(f7,axiom,
! [X0] : multiplication(one,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_left_identity) ).
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(f11,axiom,
! [X0] : star(X0) = addition(one,multiplication(X0,star(X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',star_unfold1) ).
fof(f16,axiom,
! [X0,X1,X2] :
( leq(X2,addition(multiplication(X0,X2),X1))
=> leq(X2,multiplication(strong_iteration(X0),X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',infty_coinduction) ).
fof(f18,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',order) ).
fof(f19,conjecture,
! [X3] :
( leq(strong_iteration(one),strong_iteration(star(X3)))
& leq(strong_iteration(star(X3)),strong_iteration(one)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f20,negated_conjecture,
~ ! [X3] :
( leq(strong_iteration(one),strong_iteration(star(X3)))
& leq(strong_iteration(star(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(strong_iteration(one),strong_iteration(star(X0)))
& leq(strong_iteration(star(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(strong_iteration(one),strong_iteration(star(X0)))
| ~ leq(strong_iteration(star(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(strong_iteration(one),strong_iteration(star(X0)))
| ~ leq(strong_iteration(star(X0)),strong_iteration(one)) )
=> ( ~ leq(strong_iteration(one),strong_iteration(star(sK0)))
| ~ leq(strong_iteration(star(sK0)),strong_iteration(one)) ) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
( ~ leq(strong_iteration(one),strong_iteration(star(sK0)))
| ~ leq(strong_iteration(star(sK0)),strong_iteration(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(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(f38,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f40,plain,
! [X0] : star(X0) = addition(one,multiplication(X0,star(X0))),
inference(cnf_transformation,[],[f11]) ).
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(strong_iteration(one),strong_iteration(star(sK0)))
| ~ leq(strong_iteration(star(sK0)),strong_iteration(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_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_57,plain,
addition(multiplication(X0,X1),multiplication(X2,X1)) = multiplication(addition(X0,X2),X1),
inference(cnf_transformation,[],[f38]) ).
cnf(c_59,plain,
addition(one,multiplication(X0,star(X0))) = star(X0),
inference(cnf_transformation,[],[f40]) ).
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(strong_iteration(star(sK0)),strong_iteration(one))
| ~ leq(strong_iteration(one),strong_iteration(star(sK0))) ),
inference(cnf_transformation,[],[f49]) ).
cnf(c_657,plain,
addition(X0,addition(X0,X1)) = addition(X0,X1),
inference(superposition,[status(thm)],[c_52,c_50]) ).
cnf(c_861,plain,
addition(one,star(X0)) = star(X0),
inference(superposition,[status(thm)],[c_59,c_657]) ).
cnf(c_867,plain,
leq(X0,addition(X0,X1)),
inference(superposition,[status(thm)],[c_657,c_66]) ).
cnf(c_1243,plain,
( ~ leq(X0,addition(X0,X1))
| leq(X0,multiplication(strong_iteration(one),X1)) ),
inference(superposition,[status(thm)],[c_55,c_64]) ).
cnf(c_1245,plain,
( ~ leq(X0,addition(addition(multiplication(X1,X0),multiplication(X2,X0)),X3))
| leq(X0,multiplication(strong_iteration(addition(X1,X2)),X3)) ),
inference(superposition,[status(thm)],[c_57,c_64]) ).
cnf(c_1250,plain,
leq(X0,multiplication(strong_iteration(one),X1)),
inference(forward_subsumption_resolution,[status(thm)],[c_1243,c_867]) ).
cnf(c_1263,plain,
( ~ leq(X0,addition(multiplication(X1,X0),addition(multiplication(X2,X0),X3)))
| leq(X0,multiplication(strong_iteration(addition(X1,X2)),X3)) ),
inference(theory_normalisation,[status(thm)],[c_1245,c_50,c_49]) ).
cnf(c_1337,plain,
leq(X0,strong_iteration(one)),
inference(superposition,[status(thm)],[c_54,c_1250]) ).
cnf(c_1342,plain,
~ leq(strong_iteration(one),strong_iteration(star(sK0))),
inference(backward_subsumption_resolution,[status(thm)],[c_68,c_1337]) ).
cnf(c_20358,plain,
( ~ leq(X0,addition(multiplication(X1,X0),addition(X0,X2)))
| leq(X0,multiplication(strong_iteration(addition(X1,one)),X2)) ),
inference(superposition,[status(thm)],[c_55,c_1263]) ).
cnf(c_20367,plain,
( ~ leq(X0,addition(X0,addition(X1,multiplication(X2,X0))))
| leq(X0,multiplication(strong_iteration(addition(X2,one)),X1)) ),
inference(theory_normalisation,[status(thm)],[c_20358,c_50,c_49]) ).
cnf(c_20368,plain,
leq(X0,multiplication(strong_iteration(addition(X1,one)),X2)),
inference(forward_subsumption_resolution,[status(thm)],[c_20367,c_867]) ).
cnf(c_20568,plain,
leq(X0,strong_iteration(addition(X1,one))),
inference(superposition,[status(thm)],[c_54,c_20368]) ).
cnf(c_20617,plain,
leq(X0,strong_iteration(addition(one,X1))),
inference(superposition,[status(thm)],[c_49,c_20568]) ).
cnf(c_20703,plain,
leq(X0,strong_iteration(star(X1))),
inference(superposition,[status(thm)],[c_861,c_20617]) ).
cnf(c_20718,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_1342,c_20703]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KLE144+2 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n017.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 10:36:28 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 7.74/1.65 % SZS status Started for theBenchmark.p
% 7.74/1.65 % SZS status Theorem for theBenchmark.p
% 7.74/1.65
% 7.74/1.65 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 7.74/1.65
% 7.74/1.65 ------ iProver source info
% 7.74/1.65
% 7.74/1.65 git: date: 2023-05-31 18:12:56 +0000
% 7.74/1.65 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 7.74/1.65 git: non_committed_changes: false
% 7.74/1.65 git: last_make_outside_of_git: false
% 7.74/1.65
% 7.74/1.65 ------ Parsing...
% 7.74/1.65 ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.74/1.65
% 7.74/1.65 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 7.74/1.65
% 7.74/1.65 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.74/1.65
% 7.74/1.65 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.74/1.65 ------ Proving...
% 7.74/1.65 ------ Problem Properties
% 7.74/1.65
% 7.74/1.65
% 7.74/1.65 clauses 20
% 7.74/1.65 conjectures 1
% 7.74/1.65 EPR 0
% 7.74/1.65 Horn 20
% 7.74/1.65 unary 14
% 7.74/1.65 binary 6
% 7.74/1.65 lits 26
% 7.74/1.65 lits eq 16
% 7.74/1.65 fd_pure 0
% 7.74/1.65 fd_pseudo 0
% 7.74/1.65 fd_cond 0
% 7.74/1.65 fd_pseudo_cond 0
% 7.74/1.65 AC symbols 1
% 7.74/1.65
% 7.74/1.65 ------ Schedule dynamic 5 is on
% 7.74/1.65
% 7.74/1.65 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 7.74/1.65
% 7.74/1.65
% 7.74/1.65 ------
% 7.74/1.65 Current options:
% 7.74/1.65 ------
% 7.74/1.65
% 7.74/1.65
% 7.74/1.65
% 7.74/1.65
% 7.74/1.65 ------ Proving...
% 7.74/1.65
% 7.74/1.65
% 7.74/1.65 % SZS status Theorem for theBenchmark.p
% 7.74/1.65
% 7.74/1.65 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.74/1.65
% 7.74/1.66
%------------------------------------------------------------------------------