TSTP Solution File: KLE093+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KLE093+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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 : Fri May 3 02:32:54 EDT 2024
% Result : Theorem 4.05s 1.17s
% Output : CNFRefutation 4.05s
% 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(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',left_distributivity) ).
fof(f12,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',order) ).
fof(f14,axiom,
! [X0] : leq(addition(one,multiplication(star(X0),X0)),star(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',star_unfold_left) ).
fof(f17,axiom,
! [X3] : multiplication(domain(X3),X3) = addition(X3,multiplication(domain(X3),X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain1) ).
fof(f19,axiom,
! [X3] : one = addition(domain(X3),one),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain3) ).
fof(f21,axiom,
! [X3,X4] : domain(addition(X3,X4)) = addition(domain(X3),domain(X4)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain5) ).
fof(f22,conjecture,
! [X3] : one = domain(star(X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f23,negated_conjecture,
~ ! [X3] : one = domain(star(X3)),
inference(negated_conjecture,[],[f22]) ).
fof(f24,plain,
! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(rectify,[],[f2]) ).
fof(f25,plain,
! [X0] : multiplication(domain(X0),X0) = addition(X0,multiplication(domain(X0),X0)),
inference(rectify,[],[f17]) ).
fof(f27,plain,
! [X0] : one = addition(domain(X0),one),
inference(rectify,[],[f19]) ).
fof(f28,plain,
! [X0,X1] : domain(addition(X0,X1)) = addition(domain(X0),domain(X1)),
inference(rectify,[],[f21]) ).
fof(f29,plain,
~ ! [X0] : one = domain(star(X0)),
inference(rectify,[],[f23]) ).
fof(f32,plain,
? [X0] : one != domain(star(X0)),
inference(ennf_transformation,[],[f29]) ).
fof(f33,plain,
! [X0,X1] :
( ( leq(X0,X1)
| addition(X0,X1) != X1 )
& ( addition(X0,X1) = X1
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f12]) ).
fof(f34,plain,
( ? [X0] : one != domain(star(X0))
=> one != domain(star(sK0)) ),
introduced(choice_axiom,[]) ).
fof(f35,plain,
one != domain(star(sK0)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f32,f34]) ).
fof(f36,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f37,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f24]) ).
fof(f39,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f41,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f42,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f44,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f47,plain,
! [X0,X1] :
( addition(X0,X1) = X1
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f33]) ).
fof(f48,plain,
! [X0,X1] :
( leq(X0,X1)
| addition(X0,X1) != X1 ),
inference(cnf_transformation,[],[f33]) ).
fof(f50,plain,
! [X0] : leq(addition(one,multiplication(star(X0),X0)),star(X0)),
inference(cnf_transformation,[],[f14]) ).
fof(f53,plain,
! [X0] : multiplication(domain(X0),X0) = addition(X0,multiplication(domain(X0),X0)),
inference(cnf_transformation,[],[f25]) ).
fof(f55,plain,
! [X0] : one = addition(domain(X0),one),
inference(cnf_transformation,[],[f27]) ).
fof(f57,plain,
! [X0,X1] : domain(addition(X0,X1)) = addition(domain(X0),domain(X1)),
inference(cnf_transformation,[],[f28]) ).
fof(f58,plain,
one != domain(star(sK0)),
inference(cnf_transformation,[],[f35]) ).
cnf(c_49,plain,
addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f36]) ).
cnf(c_50,plain,
addition(addition(X0,X1),X2) = addition(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f37]) ).
cnf(c_52,plain,
addition(X0,X0) = X0,
inference(cnf_transformation,[],[f39]) ).
cnf(c_54,plain,
multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f41]) ).
cnf(c_55,plain,
multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f42]) ).
cnf(c_57,plain,
addition(multiplication(X0,X1),multiplication(X2,X1)) = multiplication(addition(X0,X2),X1),
inference(cnf_transformation,[],[f44]) ).
cnf(c_60,plain,
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f48]) ).
cnf(c_61,plain,
( ~ leq(X0,X1)
| addition(X0,X1) = X1 ),
inference(cnf_transformation,[],[f47]) ).
cnf(c_63,plain,
leq(addition(one,multiplication(star(X0),X0)),star(X0)),
inference(cnf_transformation,[],[f50]) ).
cnf(c_66,plain,
addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0),
inference(cnf_transformation,[],[f53]) ).
cnf(c_68,plain,
addition(domain(X0),one) = one,
inference(cnf_transformation,[],[f55]) ).
cnf(c_70,plain,
addition(domain(X0),domain(X1)) = domain(addition(X0,X1)),
inference(cnf_transformation,[],[f57]) ).
cnf(c_71,negated_conjecture,
domain(star(sK0)) != one,
inference(cnf_transformation,[],[f58]) ).
cnf(c_91,plain,
addition(one,domain(X0)) = one,
inference(theory_normalisation,[status(thm)],[c_68,c_50,c_49]) ).
cnf(c_210,plain,
star(sK0) = sP0_iProver_def,
definition ).
cnf(c_211,plain,
domain(sP0_iProver_def) = sP1_iProver_def,
definition ).
cnf(c_212,negated_conjecture,
sP1_iProver_def != one,
inference(demodulation,[status(thm)],[c_71,c_210,c_211]) ).
cnf(c_213,plain,
X0 = X0,
theory(equality) ).
cnf(c_215,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_545,plain,
addition(one,sP1_iProver_def) = one,
inference(superposition,[status(thm)],[c_211,c_91]) ).
cnf(c_546,plain,
addition(sP1_iProver_def,one) = one,
inference(theory_normalisation,[status(thm)],[c_545,c_50,c_49]) ).
cnf(c_570,plain,
( addition(X0,X1) != X0
| leq(X1,X0) ),
inference(superposition,[status(thm)],[c_49,c_60]) ).
cnf(c_625,plain,
addition(addition(one,multiplication(star(X0),X0)),star(X0)) = star(X0),
inference(superposition,[status(thm)],[c_63,c_61]) ).
cnf(c_636,plain,
addition(one,addition(star(X0),multiplication(star(X0),X0))) = star(X0),
inference(theory_normalisation,[status(thm)],[c_625,c_50,c_49]) ).
cnf(c_670,plain,
( one != X0
| sP1_iProver_def != X0
| sP1_iProver_def = one ),
inference(instantiation,[status(thm)],[c_215]) ).
cnf(c_680,plain,
addition(X0,addition(X0,X1)) = addition(X0,X1),
inference(superposition,[status(thm)],[c_52,c_50]) ).
cnf(c_695,plain,
( one != sP1_iProver_def
| sP1_iProver_def != sP1_iProver_def
| sP1_iProver_def = one ),
inference(instantiation,[status(thm)],[c_670]) ).
cnf(c_696,plain,
sP1_iProver_def = sP1_iProver_def,
inference(instantiation,[status(thm)],[c_213]) ).
cnf(c_1118,plain,
addition(multiplication(one,X0),multiplication(domain(X1),X0)) = multiplication(one,X0),
inference(superposition,[status(thm)],[c_91,c_57]) ).
cnf(c_1142,plain,
addition(X0,multiplication(domain(X1),X0)) = X0,
inference(light_normalisation,[status(thm)],[c_1118,c_55]) ).
cnf(c_1146,plain,
multiplication(domain(X0),X0) = X0,
inference(demodulation,[status(thm)],[c_66,c_1142]) ).
cnf(c_1196,plain,
domain(one) = one,
inference(superposition,[status(thm)],[c_1146,c_54]) ).
cnf(c_2362,plain,
( one != sP1_iProver_def
| leq(one,sP1_iProver_def) ),
inference(superposition,[status(thm)],[c_546,c_570]) ).
cnf(c_2528,plain,
one != sP1_iProver_def,
inference(global_subsumption_just,[status(thm)],[c_2362,c_212,c_695,c_696]) ).
cnf(c_3427,plain,
leq(X0,addition(X0,X1)),
inference(superposition,[status(thm)],[c_680,c_60]) ).
cnf(c_3494,plain,
leq(one,star(X0)),
inference(superposition,[status(thm)],[c_636,c_3427]) ).
cnf(c_3732,plain,
leq(one,sP0_iProver_def),
inference(superposition,[status(thm)],[c_210,c_3494]) ).
cnf(c_3734,plain,
addition(one,sP0_iProver_def) = sP0_iProver_def,
inference(superposition,[status(thm)],[c_3732,c_61]) ).
cnf(c_3735,plain,
addition(sP0_iProver_def,one) = sP0_iProver_def,
inference(theory_normalisation,[status(thm)],[c_3734,c_50,c_49]) ).
cnf(c_3762,plain,
addition(domain(sP0_iProver_def),domain(one)) = domain(sP0_iProver_def),
inference(superposition,[status(thm)],[c_3735,c_70]) ).
cnf(c_3781,plain,
one = sP1_iProver_def,
inference(light_normalisation,[status(thm)],[c_3762,c_211,c_546,c_1196]) ).
cnf(c_3782,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3781,c_2528]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KLE093+1 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n026.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri May 3 00:57:21 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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
% 4.05/1.17 % SZS status Started for theBenchmark.p
% 4.05/1.17 % SZS status Theorem for theBenchmark.p
% 4.05/1.17
% 4.05/1.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.05/1.17
% 4.05/1.17 ------ iProver source info
% 4.05/1.17
% 4.05/1.17 git: date: 2024-05-02 19:28:25 +0000
% 4.05/1.17 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 4.05/1.17 git: non_committed_changes: false
% 4.05/1.17
% 4.05/1.17 ------ Parsing...
% 4.05/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.05/1.17
% 4.05/1.17 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 4.05/1.17
% 4.05/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.05/1.17
% 4.05/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.05/1.17 ------ Proving...
% 4.05/1.17 ------ Problem Properties
% 4.05/1.17
% 4.05/1.17
% 4.05/1.17 clauses 25
% 4.05/1.17 conjectures 1
% 4.05/1.17 EPR 1
% 4.05/1.17 Horn 25
% 4.05/1.17 unary 21
% 4.05/1.17 binary 4
% 4.05/1.17 lits 29
% 4.05/1.17 lits eq 21
% 4.05/1.17 fd_pure 0
% 4.05/1.17 fd_pseudo 0
% 4.05/1.17 fd_cond 0
% 4.05/1.17 fd_pseudo_cond 0
% 4.05/1.17 AC symbols 1
% 4.05/1.17
% 4.05/1.17 ------ Schedule dynamic 5 is on
% 4.05/1.17
% 4.05/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.05/1.17
% 4.05/1.17
% 4.05/1.17 ------
% 4.05/1.17 Current options:
% 4.05/1.17 ------
% 4.05/1.17
% 4.05/1.17
% 4.05/1.17
% 4.05/1.17
% 4.05/1.17 ------ Proving...
% 4.05/1.17
% 4.05/1.17
% 4.05/1.17 % SZS status Theorem for theBenchmark.p
% 4.05/1.17
% 4.05/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.05/1.17
% 4.05/1.18
%------------------------------------------------------------------------------