TSTP Solution File: KLE041+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KLE041+1 : TPTP v8.2.0. 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 : Mon Jun 24 10:02:43 EDT 2024
% Result : Theorem 7.49s 1.63s
% Output : CNFRefutation 7.49s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% 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',additive_idempotence) ).
fof(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_right_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',left_distributivity) ).
fof(f12,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',order) ).
fof(f13,axiom,
! [X0] : leq(addition(one,multiplication(X0,star(X0))),star(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',star_unfold_right) ).
fof(f15,axiom,
! [X0,X1,X2] :
( leq(addition(multiplication(X0,X1),X2),X1)
=> leq(multiplication(star(X0),X2),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',star_induction_left) ).
fof(f17,conjecture,
! [X3,X4] :
( leq(X3,X4)
=> leq(star(X3),star(X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f18,negated_conjecture,
~ ! [X3,X4] :
( leq(X3,X4)
=> leq(star(X3),star(X4)) ),
inference(negated_conjecture,[],[f17]) ).
fof(f19,plain,
! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(rectify,[],[f2]) ).
fof(f20,plain,
~ ! [X0,X1] :
( leq(X0,X1)
=> leq(star(X0),star(X1)) ),
inference(rectify,[],[f18]) ).
fof(f21,plain,
! [X0,X1,X2] :
( leq(multiplication(star(X0),X2),X1)
| ~ leq(addition(multiplication(X0,X1),X2),X1) ),
inference(ennf_transformation,[],[f15]) ).
fof(f23,plain,
? [X0,X1] :
( ~ leq(star(X0),star(X1))
& leq(X0,X1) ),
inference(ennf_transformation,[],[f20]) ).
fof(f24,plain,
! [X0,X1] :
( ( leq(X0,X1)
| addition(X0,X1) != X1 )
& ( addition(X0,X1) = X1
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f12]) ).
fof(f25,plain,
( ? [X0,X1] :
( ~ leq(star(X0),star(X1))
& leq(X0,X1) )
=> ( ~ leq(star(sK0),star(sK1))
& leq(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f26,plain,
( ~ leq(star(sK0),star(sK1))
& leq(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f23,f25]) ).
fof(f27,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f28,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f19]) ).
fof(f30,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f32,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f35,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f38,plain,
! [X0,X1] :
( addition(X0,X1) = X1
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f39,plain,
! [X0,X1] :
( leq(X0,X1)
| addition(X0,X1) != X1 ),
inference(cnf_transformation,[],[f24]) ).
fof(f40,plain,
! [X0] : leq(addition(one,multiplication(X0,star(X0))),star(X0)),
inference(cnf_transformation,[],[f13]) ).
fof(f42,plain,
! [X2,X0,X1] :
( leq(multiplication(star(X0),X2),X1)
| ~ leq(addition(multiplication(X0,X1),X2),X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f44,plain,
leq(sK0,sK1),
inference(cnf_transformation,[],[f26]) ).
fof(f45,plain,
~ leq(star(sK0),star(sK1)),
inference(cnf_transformation,[],[f26]) ).
cnf(c_49,plain,
addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f27]) ).
cnf(c_50,plain,
addition(addition(X0,X1),X2) = addition(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f28]) ).
cnf(c_52,plain,
addition(X0,X0) = X0,
inference(cnf_transformation,[],[f30]) ).
cnf(c_54,plain,
multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f32]) ).
cnf(c_57,plain,
addition(multiplication(X0,X1),multiplication(X2,X1)) = multiplication(addition(X0,X2),X1),
inference(cnf_transformation,[],[f35]) ).
cnf(c_60,plain,
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f39]) ).
cnf(c_61,plain,
( ~ leq(X0,X1)
| addition(X0,X1) = X1 ),
inference(cnf_transformation,[],[f38]) ).
cnf(c_62,plain,
leq(addition(one,multiplication(X0,star(X0))),star(X0)),
inference(cnf_transformation,[],[f40]) ).
cnf(c_64,plain,
( ~ leq(addition(multiplication(X0,X1),X2),X1)
| leq(multiplication(star(X0),X2),X1) ),
inference(cnf_transformation,[],[f42]) ).
cnf(c_66,negated_conjecture,
~ leq(star(sK0),star(sK1)),
inference(cnf_transformation,[],[f45]) ).
cnf(c_67,negated_conjecture,
leq(sK0,sK1),
inference(cnf_transformation,[],[f44]) ).
cnf(c_186,plain,
star(sK0) = sP0_iProver_def,
definition ).
cnf(c_187,plain,
star(sK1) = sP1_iProver_def,
definition ).
cnf(c_188,negated_conjecture,
leq(sK0,sK1),
inference(demodulation,[status(thm)],[c_67]) ).
cnf(c_189,negated_conjecture,
~ leq(sP0_iProver_def,sP1_iProver_def),
inference(demodulation,[status(thm)],[c_66,c_187,c_186]) ).
cnf(c_486,plain,
leq(addition(one,multiplication(sK1,sP1_iProver_def)),sP1_iProver_def),
inference(superposition,[status(thm)],[c_187,c_62]) ).
cnf(c_523,plain,
addition(sK0,sK1) = sK1,
inference(superposition,[status(thm)],[c_188,c_61]) ).
cnf(c_527,plain,
addition(addition(one,multiplication(sK1,sP1_iProver_def)),sP1_iProver_def) = sP1_iProver_def,
inference(superposition,[status(thm)],[c_486,c_61]) ).
cnf(c_534,plain,
addition(sP1_iProver_def,addition(one,multiplication(sK1,sP1_iProver_def))) = sP1_iProver_def,
inference(theory_normalisation,[status(thm)],[c_527,c_50,c_49]) ).
cnf(c_545,plain,
addition(X0,addition(X0,X1)) = addition(X0,X1),
inference(superposition,[status(thm)],[c_52,c_50]) ).
cnf(c_624,plain,
addition(multiplication(sK0,X0),multiplication(sK1,X0)) = multiplication(sK1,X0),
inference(superposition,[status(thm)],[c_523,c_57]) ).
cnf(c_761,plain,
addition(multiplication(sK0,X0),addition(multiplication(sK1,X0),X1)) = addition(multiplication(sK1,X0),X1),
inference(superposition,[status(thm)],[c_624,c_50]) ).
cnf(c_955,plain,
( ~ leq(addition(X0,multiplication(X1,X2)),X2)
| leq(multiplication(star(X1),X0),X2) ),
inference(superposition,[status(thm)],[c_49,c_64]) ).
cnf(c_1650,plain,
leq(multiplication(sK0,X0),addition(multiplication(sK1,X0),X1)),
inference(superposition,[status(thm)],[c_761,c_60]) ).
cnf(c_1876,plain,
leq(multiplication(sK0,X0),addition(X1,multiplication(sK1,X0))),
inference(superposition,[status(thm)],[c_49,c_1650]) ).
cnf(c_2958,plain,
leq(X0,addition(X0,X1)),
inference(superposition,[status(thm)],[c_545,c_60]) ).
cnf(c_3047,plain,
leq(X0,addition(X1,X0)),
inference(superposition,[status(thm)],[c_49,c_2958]) ).
cnf(c_3049,plain,
leq(addition(X0,X1),addition(X0,addition(X1,X2))),
inference(superposition,[status(thm)],[c_50,c_2958]) ).
cnf(c_3074,plain,
leq(X0,addition(X1,addition(X2,X0))),
inference(superposition,[status(thm)],[c_50,c_3047]) ).
cnf(c_3122,plain,
leq(multiplication(sK1,sP1_iProver_def),sP1_iProver_def),
inference(superposition,[status(thm)],[c_534,c_3074]) ).
cnf(c_3130,plain,
leq(X0,addition(X1,addition(X0,X2))),
inference(superposition,[status(thm)],[c_49,c_3074]) ).
cnf(c_3337,plain,
leq(one,sP1_iProver_def),
inference(superposition,[status(thm)],[c_534,c_3130]) ).
cnf(c_3555,plain,
leq(addition(X0,X1),addition(X0,addition(X2,X1))),
inference(superposition,[status(thm)],[c_49,c_3049]) ).
cnf(c_3759,plain,
addition(one,sP1_iProver_def) = sP1_iProver_def,
inference(superposition,[status(thm)],[c_3337,c_61]) ).
cnf(c_3760,plain,
addition(sP1_iProver_def,one) = sP1_iProver_def,
inference(theory_normalisation,[status(thm)],[c_3759,c_50,c_49]) ).
cnf(c_3763,plain,
addition(multiplication(sK1,sP1_iProver_def),sP1_iProver_def) = sP1_iProver_def,
inference(superposition,[status(thm)],[c_3122,c_61]) ).
cnf(c_3764,plain,
addition(sP1_iProver_def,multiplication(sK1,sP1_iProver_def)) = sP1_iProver_def,
inference(theory_normalisation,[status(thm)],[c_3763,c_50,c_49]) ).
cnf(c_4917,plain,
leq(multiplication(sK0,sP1_iProver_def),sP1_iProver_def),
inference(superposition,[status(thm)],[c_3764,c_1876]) ).
cnf(c_4966,plain,
addition(multiplication(sK0,sP1_iProver_def),sP1_iProver_def) = sP1_iProver_def,
inference(superposition,[status(thm)],[c_4917,c_61]) ).
cnf(c_4967,plain,
addition(sP1_iProver_def,multiplication(sK0,sP1_iProver_def)) = sP1_iProver_def,
inference(theory_normalisation,[status(thm)],[c_4966,c_50,c_49]) ).
cnf(c_7530,plain,
leq(addition(X0,one),addition(X0,sP1_iProver_def)),
inference(superposition,[status(thm)],[c_3760,c_3555]) ).
cnf(c_7593,plain,
leq(addition(X0,one),addition(sP1_iProver_def,X0)),
inference(superposition,[status(thm)],[c_49,c_7530]) ).
cnf(c_8098,plain,
leq(addition(multiplication(sK0,sP1_iProver_def),one),sP1_iProver_def),
inference(superposition,[status(thm)],[c_4967,c_7593]) ).
cnf(c_8101,plain,
leq(addition(one,multiplication(sK0,sP1_iProver_def)),sP1_iProver_def),
inference(theory_normalisation,[status(thm)],[c_8098,c_50,c_49]) ).
cnf(c_8786,plain,
leq(multiplication(star(sK0),one),sP1_iProver_def),
inference(superposition,[status(thm)],[c_8101,c_955]) ).
cnf(c_8810,plain,
leq(multiplication(sP0_iProver_def,one),sP1_iProver_def),
inference(light_normalisation,[status(thm)],[c_8786,c_186]) ).
cnf(c_10134,plain,
leq(sP0_iProver_def,sP1_iProver_def),
inference(demodulation,[status(thm)],[c_8810,c_54]) ).
cnf(c_10135,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_10134,c_189]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KLE041+1 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n017.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Thu Jun 20 22:48:09 EDT 2024
% 0.11/0.33 % 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 --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 7.49/1.63 % SZS status Started for theBenchmark.p
% 7.49/1.63 % SZS status Theorem for theBenchmark.p
% 7.49/1.63
% 7.49/1.63 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.49/1.63
% 7.49/1.63 ------ iProver source info
% 7.49/1.63
% 7.49/1.63 git: date: 2024-06-12 09:56:46 +0000
% 7.49/1.63 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 7.49/1.63 git: non_committed_changes: false
% 7.49/1.63
% 7.49/1.63 ------ Parsing...
% 7.49/1.63 ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.49/1.63
% 7.49/1.63 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 7.49/1.63
% 7.49/1.63 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.49/1.63
% 7.49/1.63 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.49/1.63 ------ Proving...
% 7.49/1.63 ------ Problem Properties
% 7.49/1.63
% 7.49/1.63
% 7.49/1.63 clauses 21
% 7.49/1.63 conjectures 2
% 7.49/1.63 EPR 2
% 7.49/1.63 Horn 21
% 7.49/1.63 unary 17
% 7.49/1.63 binary 4
% 7.49/1.63 lits 25
% 7.49/1.63 lits eq 15
% 7.49/1.63 fd_pure 0
% 7.49/1.63 fd_pseudo 0
% 7.49/1.63 fd_cond 0
% 7.49/1.63 fd_pseudo_cond 0
% 7.49/1.63 AC symbols 1
% 7.49/1.63
% 7.49/1.63 ------ Schedule dynamic 5 is on
% 7.49/1.63
% 7.49/1.63 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 7.49/1.63
% 7.49/1.63
% 7.49/1.63 ------
% 7.49/1.63 Current options:
% 7.49/1.63 ------
% 7.49/1.63
% 7.49/1.63
% 7.49/1.63
% 7.49/1.63
% 7.49/1.63 ------ Proving...
% 7.49/1.63
% 7.49/1.63
% 7.49/1.63 % SZS status Theorem for theBenchmark.p
% 7.49/1.63
% 7.49/1.63 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.49/1.63
% 7.49/1.64
%------------------------------------------------------------------------------