TSTP Solution File: KLE178+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : KLE178+1 : TPTP v8.1.2. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n006.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:25 EDT 2023
% Result : Satisfiable 0.38s 1.10s
% Output : Saturation 0.38s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% 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',additive_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(f7,axiom,
! [X0] : multiplication(one,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_left_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',right_distributivity) ).
fof(f9,axiom,
! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_distributivity) ).
fof(f10,axiom,
! [X0] : zero = multiplication(X0,zero),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_annihilation) ).
fof(f11,axiom,
! [X0] : zero = multiplication(zero,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_annihilation) ).
fof(f12,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',order) ).
fof(f13,axiom,
! [X0] : leq(addition(one,multiplication(X0,star(X0))),star(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',star_unfold_right) ).
fof(f14,axiom,
! [X0] : leq(addition(one,multiplication(star(X0),X0)),star(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',star_unfold_left) ).
fof(f15,axiom,
! [X0,X1,X2] :
( leq(addition(multiplication(X0,X1),X2),X1)
=> leq(multiplication(star(X0),X2),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',star_induction_left) ).
fof(f16,axiom,
! [X0,X1,X2] :
( leq(addition(multiplication(X0,X1),X2),X0)
=> leq(multiplication(X2,star(X1)),X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',star_induction_right) ).
fof(f17,axiom,
! [X3] : multiplication(domain(X3),X3) = addition(X3,multiplication(domain(X3),X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain1) ).
fof(f18,axiom,
! [X3,X4] : domain(multiplication(X3,X4)) = domain(multiplication(X3,domain(X4))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain2) ).
fof(f19,axiom,
! [X3] : one = addition(domain(X3),one),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain3) ).
fof(f20,axiom,
zero = domain(zero),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain4) ).
fof(f21,axiom,
! [X3,X4] : domain(addition(X3,X4)) = addition(domain(X3),domain(X4)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain5) ).
fof(f22,plain,
! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(rectify,[],[f2]) ).
fof(f23,plain,
! [X0] : multiplication(domain(X0),X0) = addition(X0,multiplication(domain(X0),X0)),
inference(rectify,[],[f17]) ).
fof(f24,plain,
! [X0,X1] : domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))),
inference(rectify,[],[f18]) ).
fof(f25,plain,
! [X0] : one = addition(domain(X0),one),
inference(rectify,[],[f19]) ).
fof(f26,plain,
! [X0,X1] : domain(addition(X0,X1)) = addition(domain(X0),domain(X1)),
inference(rectify,[],[f21]) ).
fof(f27,plain,
! [X0,X1,X2] :
( leq(multiplication(star(X0),X2),X1)
| ~ leq(addition(multiplication(X0,X1),X2),X1) ),
inference(ennf_transformation,[],[f15]) ).
fof(f28,plain,
! [X0,X1,X2] :
( leq(multiplication(X2,star(X1)),X0)
| ~ leq(addition(multiplication(X0,X1),X2),X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f29,plain,
! [X0,X1] :
( ( leq(X0,X1)
| addition(X0,X1) != X1 )
& ( addition(X0,X1) = X1
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f12]) ).
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,[],[f22]) ).
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(f36,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
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(X0,zero),
inference(cnf_transformation,[],[f10]) ).
fof(f40,plain,
! [X0] : zero = multiplication(zero,X0),
inference(cnf_transformation,[],[f11]) ).
fof(f41,plain,
! [X0,X1] :
( addition(X0,X1) = X1
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f42,plain,
! [X0,X1] :
( leq(X0,X1)
| addition(X0,X1) != X1 ),
inference(cnf_transformation,[],[f29]) ).
fof(f43,plain,
! [X0] : leq(addition(one,multiplication(X0,star(X0))),star(X0)),
inference(cnf_transformation,[],[f13]) ).
fof(f44,plain,
! [X0] : leq(addition(one,multiplication(star(X0),X0)),star(X0)),
inference(cnf_transformation,[],[f14]) ).
fof(f45,plain,
! [X2,X0,X1] :
( leq(multiplication(star(X0),X2),X1)
| ~ leq(addition(multiplication(X0,X1),X2),X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f46,plain,
! [X2,X0,X1] :
( leq(multiplication(X2,star(X1)),X0)
| ~ leq(addition(multiplication(X0,X1),X2),X0) ),
inference(cnf_transformation,[],[f28]) ).
fof(f47,plain,
! [X0] : multiplication(domain(X0),X0) = addition(X0,multiplication(domain(X0),X0)),
inference(cnf_transformation,[],[f23]) ).
fof(f48,plain,
! [X0,X1] : domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))),
inference(cnf_transformation,[],[f24]) ).
fof(f49,plain,
! [X0] : one = addition(domain(X0),one),
inference(cnf_transformation,[],[f25]) ).
fof(f50,plain,
zero = domain(zero),
inference(cnf_transformation,[],[f20]) ).
fof(f51,plain,
! [X0,X1] : domain(addition(X0,X1)) = addition(domain(X0),domain(X1)),
inference(cnf_transformation,[],[f26]) ).
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_55,plain,
multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f36]) ).
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(X0,zero) = zero,
inference(cnf_transformation,[],[f39]) ).
cnf(c_59,plain,
multiplication(zero,X0) = zero,
inference(cnf_transformation,[],[f40]) ).
cnf(c_60,plain,
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f42]) ).
cnf(c_61,plain,
( ~ leq(X0,X1)
| addition(X0,X1) = X1 ),
inference(cnf_transformation,[],[f41]) ).
cnf(c_62,plain,
leq(addition(one,multiplication(X0,star(X0))),star(X0)),
inference(cnf_transformation,[],[f43]) ).
cnf(c_63,plain,
leq(addition(one,multiplication(star(X0),X0)),star(X0)),
inference(cnf_transformation,[],[f44]) ).
cnf(c_64,plain,
( ~ leq(addition(multiplication(X0,X1),X2),X1)
| leq(multiplication(star(X0),X2),X1) ),
inference(cnf_transformation,[],[f45]) ).
cnf(c_65,plain,
( ~ leq(addition(multiplication(X0,X1),X2),X0)
| leq(multiplication(X2,star(X1)),X0) ),
inference(cnf_transformation,[],[f46]) ).
cnf(c_66,plain,
addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0),
inference(cnf_transformation,[],[f47]) ).
cnf(c_67,plain,
domain(multiplication(X0,domain(X1))) = domain(multiplication(X0,X1)),
inference(cnf_transformation,[],[f48]) ).
cnf(c_68,plain,
addition(domain(X0),one) = one,
inference(cnf_transformation,[],[f49]) ).
cnf(c_69,plain,
domain(zero) = zero,
inference(cnf_transformation,[],[f50]) ).
cnf(c_70,plain,
addition(domain(X0),domain(X1)) = domain(addition(X0,X1)),
inference(cnf_transformation,[],[f51]) ).
cnf(c_89,plain,
addition(one,domain(X0)) = one,
inference(theory_normalisation,[status(thm)],[c_68,c_50,c_49]) ).
cnf(c_90,plain,
( leq(X0,X1)
| addition(X0,X1) != X1 ),
inference(prop_impl_just,[status(thm)],[c_60]) ).
cnf(c_91,plain,
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(renaming,[status(thm)],[c_90]) ).
cnf(c_92,plain,
( ~ leq(X0,X1)
| addition(X0,X1) = X1 ),
inference(prop_impl_just,[status(thm)],[c_61]) ).
cnf(c_94,plain,
( ~ leq(addition(multiplication(X0,X1),X2),X1)
| leq(multiplication(star(X0),X2),X1) ),
inference(prop_impl_just,[status(thm)],[c_64]) ).
cnf(c_96,plain,
( ~ leq(addition(multiplication(X0,X1),X2),X0)
| leq(multiplication(X2,star(X1)),X0) ),
inference(prop_impl_just,[status(thm)],[c_65]) ).
cnf(c_197,plain,
X0 = X0,
theory(equality) ).
cnf(c_198,plain,
X0_1 = X0_1,
theory(equality) ).
cnf(c_199,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_200,plain,
( X0 != X1
| X2 != X3
| addition(X0,X2) = addition(X1,X3) ),
theory(equality) ).
cnf(c_201,plain,
( X0 != X1
| X2 != X3
| multiplication(X0,X2) = multiplication(X1,X3) ),
theory(equality) ).
cnf(c_202,plain,
( X0 != X1
| X2 != X3
| ~ leq(X1,X3)
| leq(X0,X2) ),
theory(equality) ).
cnf(c_203,plain,
( X0 != X1
| domain(X0) = domain(X1) ),
theory(equality) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : KLE178+1 : TPTP v8.1.2. Released v6.4.0.
% 0.08/0.11 % Command : run_iprover %s %d THM
% 0.09/0.31 % Computer : n006.cluster.edu
% 0.09/0.31 % Model : x86_64 x86_64
% 0.09/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.31 % Memory : 8042.1875MB
% 0.09/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.31 % CPULimit : 300
% 0.09/0.31 % WCLimit : 300
% 0.09/0.31 % DateTime : Tue Aug 29 10:59:36 EDT 2023
% 0.09/0.31 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.15/0.55 WARNING - Could not infer the problem pformat. Setting FOF as default
% 0.38/1.10 % SZS status Started for theBenchmark.p
% 0.38/1.10 % SZS status Satisfiable for theBenchmark.p
% 0.38/1.10
% 0.38/1.10 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.38/1.10
% 0.38/1.10 ------ iProver source info
% 0.38/1.10
% 0.38/1.10 git: date: 2023-05-31 18:12:56 +0000
% 0.38/1.10 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.38/1.10 git: non_committed_changes: false
% 0.38/1.10 git: last_make_outside_of_git: false
% 0.38/1.10
% 0.38/1.10 ------ Parsing...
% 0.38/1.10 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.38/1.10
% 0.38/1.10 ------ Preprocessing... sup_sim: 0 sf_s rm: 29 0s sf_e pe_s pe_e sf_s rm: 7 0s sf_e pe_s pe_e
% 0.38/1.10
% 0.38/1.10 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 0.38/1.10 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.38/1.10 ------ Proving...
% 0.38/1.10 ------ Problem Properties
% 0.38/1.10
% 0.38/1.10
% 0.38/1.10 clauses 0
% 0.38/1.10 conjectures 0
% 0.38/1.10 EPR 0
% 0.38/1.10 Horn 0
% 0.38/1.10 unary 0
% 0.38/1.10 binary 0
% 0.38/1.10 lits 0
% 0.38/1.10 lits eq 0
% 0.38/1.10 fd_pure 0
% 0.38/1.10 fd_pseudo 0
% 0.38/1.10 fd_cond 0
% 0.38/1.10 fd_pseudo_cond 0
% 0.38/1.10 AC symbols 0
% 0.38/1.10
% 0.38/1.10 ------ Schedule EPR Horn non eq is on
% 0.38/1.10
% 0.38/1.10 ------ no conjectures: strip conj schedule
% 0.38/1.10
% 0.38/1.10 ------ no equalities: superposition off
% 0.38/1.10
% 0.38/1.10 ------ Option_epr_horn stripped conjectures Time Limit: Unbounded
% 0.38/1.10
% 0.38/1.10
% 0.38/1.10
% 0.38/1.10
% 0.38/1.10 % SZS status Satisfiable for theBenchmark.p
% 0.38/1.10
% 0.38/1.10 % SZS output start Saturation for theBenchmark.p
% See solution above
% 0.38/1.10
% 0.38/1.10
%------------------------------------------------------------------------------