%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KLE035+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 01:52:14 PM UTC 2026
% Result : Theorem 3.89s 6.32s
% Output : CNFRefutation 3.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 48 ( 36 unt; 0 def)
% Number of atoms : 78 ( 37 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 50 ( 20 ~; 8 |; 19 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 74 ( 0 sgn 66 !; 8 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(f2,axiom,
! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_associativity) ).
fof(f3,axiom,
! [X0] : addition(X0,zero) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(f5,axiom,
! [X0,X1,X2] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_associativity) ).
fof(f8,axiom,
! [X0,X1,X2] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',right_distributivity) ).
fof(f9,axiom,
! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).
fof(f12,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',order) ).
fof(f17,conjecture,
! [X0,X1,X2,X3] :
( ( leq(multiplication(multiplication(X2,X1),c(X3)),zero)
& leq(multiplication(multiplication(X2,X0),c(X3)),zero)
& test(X2)
& test(X3) )
=> leq(multiplication(multiplication(X2,addition(X0,X1)),c(X3)),zero) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f18,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( leq(multiplication(multiplication(X2,X1),c(X3)),zero)
& leq(multiplication(multiplication(X2,X0),c(X3)),zero)
& test(X2)
& test(X3) )
=> leq(multiplication(multiplication(X2,addition(X0,X1)),c(X3)),zero) ),
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f19,plain,
? [X0,X1,X2,X3] :
( leq(multiplication(multiplication(X2,X1),c(X3)),zero)
& leq(multiplication(multiplication(X2,X0),c(X3)),zero)
& test(X2)
& test(X3)
& ~ leq(multiplication(multiplication(X2,addition(X0,X1)),c(X3)),zero) ),
inference(ennf_transformation,[],[f18]) ).
fof(f20,plain,
? [X0,X1,X2,X3] :
( leq(multiplication(multiplication(X2,X1),c(X3)),zero)
& leq(multiplication(multiplication(X2,X0),c(X3)),zero)
& test(X2)
& test(X3)
& ~ leq(multiplication(multiplication(X2,addition(X0,X1)),c(X3)),zero) ),
inference(flattening,[],[f19]) ).
fof(f23,plain,
( leq(multiplication(multiplication(sK2,sK1),c(sK3)),zero)
& leq(multiplication(multiplication(sK2,sK0),c(sK3)),zero)
& test(sK2)
& test(sK3)
& ~ leq(multiplication(multiplication(sK2,addition(sK0,sK1)),c(sK3)),zero) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[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(f31,plain,
leq(multiplication(multiplication(sK2,sK1),c(sK3)),zero),
inference(cnf_transformation,[],[f23]) ).
fof(f32,plain,
leq(multiplication(multiplication(sK2,sK0),c(sK3)),zero),
inference(cnf_transformation,[],[f23]) ).
fof(f35,plain,
~ leq(multiplication(multiplication(sK2,addition(sK0,sK1)),c(sK3)),zero),
inference(cnf_transformation,[],[f23]) ).
fof(f36,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f37,plain,
! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
inference(cnf_transformation,[],[f8]) ).
fof(f39,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f40,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f2]) ).
fof(f41,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f42,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| addition(X0,X1) = X1 ),
inference(cnf_transformation,[],[f24]) ).
fof(f51,plain,
! [X2,X0,X1] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
inference(cnf_transformation,[],[f5]) ).
tcf(c_49,negated_conjecture,
~ leq(multiplication(multiplication(sK2,addition(sK0,sK1)),c(sK3)),zero),
inference(cnf_transformation,[],[f35]) ).
tcf(c_52,negated_conjecture,
leq(multiplication(multiplication(sK2,sK0),c(sK3)),zero),
inference(cnf_transformation,[],[f32]) ).
tcf(c_53,negated_conjecture,
leq(multiplication(multiplication(sK2,sK1),c(sK3)),zero),
inference(cnf_transformation,[],[f31]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i] : addition(multiplication(X0,X1),multiplication(X2,X1)) = multiplication(addition(X0,X2),X1),
inference(cnf_transformation,[],[f36]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i] : addition(multiplication(X0,X1),multiplication(X0,X2)) = multiplication(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f37]) ).
tcf(c_57,plain,
! [X0: $i] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f39]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i,X2: $i] : addition(addition(X0,X1),X2) = addition(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f40]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f41]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] :
( ( addition(X0,X1) = X1 )
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f42]) ).
tcf(c_69,plain,
! [X0: $i,X1: $i,X2: $i] : multiplication(multiplication(X0,X1),X2) = multiplication(X0,multiplication(X1,X2)),
inference(cnf_transformation,[],[f51]) ).
tcf(c_95,plain,
! [X0: $i,X1: $i] :
( ( addition(X0,X1) = X1 )
| ~ leq(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_61]) ).
tcf(c_278,plain,
leq(multiplication(sK2,multiplication(sK0,c(sK3))),zero),
inference(demodulation,[status(thm)],[c_52,c_69]) ).
tcf(c_279,plain,
leq(multiplication(sK2,multiplication(sK1,c(sK3))),zero),
inference(demodulation,[status(thm)],[c_53,c_69]) ).
tcf(c_280,plain,
~ leq(multiplication(sK2,multiplication(addition(sK0,sK1),c(sK3))),zero),
inference(demodulation,[status(thm)],[c_49,c_69]) ).
tcf(c_311,plain,
! [X0: $i,X1: $i] :
( ( addition(X0,X1) = X1 )
| ( X1 != zero )
| ( multiplication(sK2,multiplication(sK1,c(sK3))) != X0 ) ),
inference(resolution_lifted,[status(thm)],[c_95,c_279]) ).
tcf(c_312,plain,
addition(multiplication(sK2,multiplication(sK1,c(sK3))),zero) = zero,
inference(unflattening,[status(thm)],[c_311]) ).
tcf(c_321,plain,
( ( zero != zero )
| ( multiplication(sK2,multiplication(addition(sK0,sK1),c(sK3))) != multiplication(sK2,multiplication(sK0,c(sK3))) ) ),
inference(resolution_lifted,[status(thm)],[c_278,c_280]) ).
tcf(c_853,plain,
multiplication(sK2,multiplication(addition(sK0,sK1),c(sK3))) != multiplication(sK2,multiplication(sK0,c(sK3))),
inference(equality_resolution_simp,[status(thm)],[c_321]) ).
tcf(c_861,plain,
addition(zero,multiplication(sK2,multiplication(sK1,c(sK3)))) = zero,
inference(theory_normalisation,[status(thm)],[c_312,c_58,c_59]) ).
tcf(c_864,plain,
addition(multiplication(sK2,multiplication(sK0,c(sK3))),multiplication(sK2,multiplication(sK1,c(sK3)))) != multiplication(sK2,multiplication(sK0,c(sK3))),
inference(demodulation,[status(thm)],[c_853,c_54,c_55]) ).
tcf(c_954,plain,
! [X0: $i] : addition(zero,X0) = X0,
inference(superposition,[status(thm)],[c_59,c_57]) ).
tcf(c_956,plain,
multiplication(sK2,multiplication(sK1,c(sK3))) = zero,
inference(demodulation,[status(thm)],[c_861,c_954]) ).
tcf(c_961,plain,
addition(multiplication(sK2,multiplication(sK0,c(sK3))),zero) != multiplication(sK2,multiplication(sK0,c(sK3))),
inference(demodulation,[status(thm)],[c_864,c_956]) ).
tcf(c_962,plain,
addition(zero,multiplication(sK2,multiplication(sK0,c(sK3)))) != multiplication(sK2,multiplication(sK0,c(sK3))),
inference(theory_normalisation,[status(thm)],[c_961,c_58,c_59]) ).
tcf(c_963,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_962,c_954]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE035+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/5.40 % Computer : n011.cluster.edu
% 0.13/5.40 % Model : x86_64 x86_64
% 0.13/5.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/5.40 % Memory : 8046.5625MB
% 0.13/5.40 % OS : Linux 6.8.0-71-generic
% 0.13/5.40 % CPULimit : 300
% 0.13/5.40 % WCLimit : 300
% 0.13/5.40 % DateTime : Wed Sep 23 18:43:33 UTC 2026
% 0.15/5.40 % CPUTime :
% 0.15/5.40 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/5.43 Running first-order theorem proving
% 0.15/5.44 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/5.45
% 0.15/5.45 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.45
% 0.15/5.45 % Detected problem language: tptp
% 0.15/5.46 % Proving...
% 3.89/6.32 % SZS status Started for theBenchmark.p
% 3.89/6.32 % SZS status Theorem for theBenchmark.p
% 3.89/6.32
% 3.89/6.32 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.89/6.32
% 3.89/6.32 % ------ iProver source info
% 3.89/6.32
% 3.89/6.32 % git: date: 2026-07-19 20:42:38 +0200
% 3.89/6.32 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.89/6.32 % git: non_committed_changes: false
% 3.89/6.32
% 3.89/6.32 % ------ Parsing...
% 3.89/6.32 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.89/6.32
% 3.89/6.32 % ------ Preprocessing... sup_sim: 3 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e %
% 3.89/6.32
% 3.89/6.32 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.89/6.32
% 3.89/6.32 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.89/6.32 % ------ Proving...
% 3.89/6.32 % ------ Problem Properties
% 3.89/6.32
% 3.89/6.32 %
% 3.89/6.32 % clauses 27
% 3.89/6.32 % conjectures 2
% 3.89/6.32 % EPR 3
% 3.89/6.32 % Horn 26
% 3.89/6.32 % unary 16
% 3.89/6.32 % binary 9
% 3.89/6.32 % lits 41
% 3.89/6.32 % lits eq 26
% 3.89/6.32 % fd_pure 0
% 3.89/6.32 % fd_pseudo 0
% 3.89/6.32 % fd_cond 0
% 3.89/6.32 % fd_pseudo_cond 1
% 3.89/6.32 % AC symbols 1
% 3.89/6.32
% 3.89/6.32 % ------ Schedule dynamic 5 is on
% 3.89/6.32
% 3.89/6.32 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.89/6.32
% 3.89/6.32
% 3.89/6.32 % ------
% 3.89/6.32 % Current options:
% 3.89/6.32 % ------
% 3.89/6.32
% 3.89/6.32
% 3.89/6.32 %
% 3.89/6.32
% 3.89/6.32 % ------ Proving...
% 3.89/6.32 %
% 3.89/6.32
% 3.89/6.32 % SZS status Theorem for theBenchmark.p
% 3.89/6.32
% 3.89/6.32 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.89/6.32
% 3.89/6.32
%------------------------------------------------------------------------------