%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KLE021+4 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n017.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:10 PM UTC 2026
% Result : Theorem 3.97s 11.31s
% Output : CNFRefutation 3.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 56 ( 30 unt; 3 def)
% Number of atoms : 123 ( 50 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 88 ( 38 ~; 29 |; 13 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 68 ( 0 sgn 66 !; 2 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_associativity) ).
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
fof(f7,axiom,
! [X0] : multiplication(one,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
fof(f9,axiom,
! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).
fof(f12,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',order) ).
fof(f14,axiom,
! [X0,X1] :
( complement(X1,X0)
<=> ( addition(X0,X1) = one
& multiplication(X1,X0) = zero
& multiplication(X0,X1) = zero ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_2) ).
fof(f15,axiom,
! [X0,X1] :
( test(X0)
=> ( c(X0) = X1
<=> complement(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_3) ).
fof(f19,conjecture,
! [X0,X1] :
( test(X1)
=> ( leq(addition(multiplication(X1,X0),multiplication(c(X1),X0)),X0)
& leq(X0,addition(multiplication(X1,X0),multiplication(c(X1),X0))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f20,negated_conjecture,
~ ! [X0,X1] :
( test(X1)
=> ( leq(addition(multiplication(X1,X0),multiplication(c(X1),X0)),X0)
& leq(X0,addition(multiplication(X1,X0),multiplication(c(X1),X0))) ) ),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f21,plain,
! [X0,X1] :
( addition(X0,X1) = X1
=> leq(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f12]) ).
fof(f22,plain,
! [X0,X1] :
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(ennf_transformation,[],[f21]) ).
fof(f23,plain,
! [X0,X1] :
( ~ test(X0)
| ( c(X0) = X1
<=> complement(X0,X1) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f29,plain,
? [X0,X1] :
( test(X1)
& ( ~ leq(addition(multiplication(X1,X0),multiplication(c(X1),X0)),X0)
| ~ leq(X0,addition(multiplication(X1,X0),multiplication(c(X1),X0))) ) ),
inference(ennf_transformation,[],[f20]) ).
fof(f33,plain,
! [X0,X1] :
( ( ~ complement(X1,X0)
| ( addition(X0,X1) = one
& multiplication(X1,X0) = zero
& multiplication(X0,X1) = zero ) )
& ( addition(X0,X1) != one
| zero != multiplication(X1,X0)
| zero != multiplication(X0,X1)
| complement(X1,X0) ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f34,plain,
! [X0,X1] :
( ( ~ complement(X1,X0)
| ( addition(X0,X1) = one
& multiplication(X1,X0) = zero
& multiplication(X0,X1) = zero ) )
& ( addition(X0,X1) != one
| zero != multiplication(X1,X0)
| zero != multiplication(X0,X1)
| complement(X1,X0) ) ),
inference(flattening,[],[f33]) ).
fof(f35,plain,
! [X0,X1] :
( ~ test(X0)
| ( ( c(X0) != X1
| complement(X0,X1) )
& ( ~ complement(X0,X1)
| c(X0) = X1 ) ) ),
inference(nnf_transformation,[],[f23]) ).
fof(f36,plain,
( test(sK2)
& ( ~ leq(addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)),sK1)
| ~ leq(sK1,addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1))) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X0,sK1),skolemize(X1,sK2)],[f29]) ).
fof(f37,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f38,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f2]) ).
fof(f40,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f43,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f45,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f48,plain,
! [X0,X1] :
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f51,plain,
! [X0,X1] :
( ~ complement(X1,X0)
| addition(X0,X1) = one ),
inference(cnf_transformation,[],[f34]) ).
fof(f55,plain,
! [X0,X1] :
( ~ test(X0)
| c(X0) != X1
| complement(X0,X1) ),
inference(cnf_transformation,[],[f35]) ).
fof(f60,plain,
test(sK2),
inference(cnf_transformation,[],[f36]) ).
fof(f61,plain,
( ~ leq(addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)),sK1)
| ~ leq(sK1,addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1))) ),
inference(cnf_transformation,[],[f36]) ).
fof(f62,plain,
! [X0] :
( ~ test(X0)
| complement(X0,c(X0)) ),
inference(equality_resolution,[],[f55]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f37]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i] : addition(addition(X0,X1),X2) = addition(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f38]) ).
tcf(c_52,plain,
! [X0: $i] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f40]) ).
tcf(c_55,plain,
! [X0: $i] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f43]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i] : addition(multiplication(X0,X1),multiplication(X2,X1)) = multiplication(addition(X0,X2),X1),
inference(cnf_transformation,[],[f45]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] :
( leq(X0,X1)
| ( addition(X0,X1) != X1 ) ),
inference(cnf_transformation,[],[f48]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i] :
( ( addition(X1,X0) = one )
| ~ complement(X0,X1) ),
inference(cnf_transformation,[],[f51]) ).
tcf(c_68,plain,
! [X0: $i] :
( complement(X0,c(X0))
| ~ test(X0) ),
inference(cnf_transformation,[],[f62]) ).
tcf(c_72,negated_conjecture,
( ~ leq(sK1,addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)))
| ~ leq(addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)),sK1) ),
inference(cnf_transformation,[],[f61]) ).
tcf(c_73,negated_conjecture,
test(sK2),
inference(cnf_transformation,[],[f60]) ).
tcf(c_227,plain,
( ~ leq(sK1,multiplication(addition(c(sK2),sK2),sK1))
| ~ leq(multiplication(addition(c(sK2),sK2),sK1),sK1) ),
inference(ac_demodulation,[status(thm)],[c_72,c_57,c_57,c_50,c_49]) ).
tcf(c_228,plain,
( ~ leq(sK1,multiplication(addition(sK2,c(sK2)),sK1))
| ~ leq(multiplication(addition(sK2,c(sK2)),sK1),sK1) ),
inference(theory_normalisation,[status(thm)],[c_227,c_50,c_49]) ).
tcf(c_396,definition,
iPr_def_10 = c(sK2),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_397,definition,
iPr_def_11 = addition(sK2,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_398,definition,
iPr_def_12 = multiplication(iPr_def_11,sK1),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_399,plain,
( ~ leq(iPr_def_12,sK1)
| ~ leq(sK1,iPr_def_12) ),
inference(demodulation,[status(thm)],[c_228,c_396,c_397,c_398]) ).
tcf(c_400,negated_conjecture,
test(sK2),
inference(demodulation,[status(thm)],[c_73]) ).
tcf(c_705,plain,
addition(iPr_def_10,sK2) = iPr_def_11,
inference(theory_normalisation,[status(thm)],[c_397,c_50,c_49]) ).
tcf(c_719,plain,
( complement(sK2,iPr_def_10)
| ~ test(sK2) ),
inference(superposition,[status(thm)],[c_396,c_68]) ).
tcf(c_723,plain,
complement(sK2,iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_719,c_400]) ).
tcf(c_741,plain,
! [X0: $i] : leq(X0,X0),
inference(superposition,[status(thm)],[c_52,c_60]) ).
tcf(c_803,plain,
addition(iPr_def_10,sK2) = one,
inference(superposition,[status(thm)],[c_723,c_66]) ).
tcf(c_804,plain,
one = iPr_def_11,
inference(light_normalisation,[status(thm)],[c_803,c_705]) ).
tcf(c_811,plain,
! [X0: $i] : multiplication(iPr_def_11,X0) = X0,
inference(demodulation,[status(thm)],[c_55,c_804]) ).
tcf(c_813,plain,
sK1 = iPr_def_12,
inference(demodulation,[status(thm)],[c_398,c_811]) ).
tcf(c_814,plain,
~ leq(iPr_def_12,iPr_def_12),
inference(demodulation,[status(thm)],[c_399,c_813]) ).
tcf(c_815,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_814,c_741]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE021+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/10.39 % Computer : n017.cluster.edu
% 0.10/10.39 % Model : x86_64 x86_64
% 0.10/10.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.39 % Memory : 8046.5625MB
% 0.10/10.39 % OS : Linux 6.8.0-71-generic
% 0.10/10.39 % CPULimit : 300
% 0.10/10.39 % WCLimit : 300
% 0.10/10.39 % DateTime : Wed Sep 23 18:34:26 UTC 2026
% 0.10/10.39 % CPUTime :
% 0.10/10.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/10.43 Running first-order theorem proving
% 0.15/10.43 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/10.44
% 0.15/10.44 % ======== iProver multi-core TPTP/SMT =========
% 0.15/10.44
% 0.15/10.44 % Detected problem language: tptp
% 0.15/10.46 % Proving...
% 3.97/11.31 % SZS status Started for theBenchmark.p
% 3.97/11.31 % SZS status Theorem for theBenchmark.p
% 3.97/11.31
% 3.97/11.31 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.97/11.31
% 3.97/11.31 % ------ iProver source info
% 3.97/11.31
% 3.97/11.31 % git: date: 2026-07-19 20:42:38 +0200
% 3.97/11.31 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.97/11.31 % git: non_committed_changes: false
% 3.97/11.31
% 3.97/11.31 % ------ Parsing...
% 3.97/11.31 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.97/11.31
% 3.97/11.31 % ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.97/11.31
% 3.97/11.31 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.97/11.31
% 3.97/11.31 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.97/11.31 % ------ Proving...
% 3.97/11.31 % ------ Problem Properties
% 3.97/11.31
% 3.97/11.31 %
% 3.97/11.31 % clauses 28
% 3.97/11.31 % conjectures 1
% 3.97/11.31 % EPR 3
% 3.97/11.31 % Horn 27
% 3.97/11.31 % unary 15
% 3.97/11.31 % binary 9
% 3.97/11.31 % lits 46
% 3.97/11.31 % lits eq 25
% 3.97/11.31 % fd_pure 0
% 3.97/11.31 % fd_pseudo 0
% 3.97/11.31 % fd_cond 0
% 3.97/11.31 % fd_pseudo_cond 1
% 3.97/11.31 % AC symbols 1
% 3.97/11.31
% 3.97/11.31 % ------ Schedule dynamic 5 is on
% 3.97/11.31
% 3.97/11.31 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.97/11.31
% 3.97/11.31
% 3.97/11.31 % ------
% 3.97/11.31 % Current options:
% 3.97/11.31 % ------
% 3.97/11.31
% 3.97/11.31
% 3.97/11.31 %
% 3.97/11.31
% 3.97/11.31 % ------ Proving...
% 3.97/11.31 %
% 3.97/11.31
% 3.97/11.31 % SZS status Theorem for theBenchmark.p
% 3.97/11.31
% 3.97/11.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.97/11.31
% 3.97/11.31
%------------------------------------------------------------------------------