%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KLE009+1 : 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 : n004.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:07 PM UTC 2026
% Result : Theorem 2.31s 1.16s
% Output : CNFRefutation 2.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 66 ( 48 unt; 5 def)
% Number of atoms : 140 ( 66 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 76 ( 33 ~; 20 |; 17 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 9 ( 7 usr; 6 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 65 ( 0 sgn 61 !; 4 ?; 16 :)
% 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(f7,axiom,
! [X0] : multiplication(one,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',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/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/sandbox2/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).
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(f17,conjecture,
! [X0,X1] :
( ( test(X0)
& test(X1) )
=> one = addition(addition(addition(multiplication(X0,X1),multiplication(X0,c(X1))),multiplication(c(X0),X1)),multiplication(c(X0),c(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f18,negated_conjecture,
~ ! [X0,X1] :
( ( test(X0)
& test(X1) )
=> one = addition(addition(addition(multiplication(X0,X1),multiplication(X0,c(X1))),multiplication(c(X0),X1)),multiplication(c(X0),c(X1))) ),
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f19,plain,
! [X0,X1] :
( ~ test(X0)
| ( c(X0) = X1
<=> complement(X0,X1) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f21,plain,
? [X0,X1] :
( test(X0)
& test(X1)
& one != addition(addition(addition(multiplication(X0,X1),multiplication(X0,c(X1))),multiplication(c(X0),X1)),multiplication(c(X0),c(X1))) ),
inference(ennf_transformation,[],[f18]) ).
fof(f22,plain,
? [X0,X1] :
( test(X0)
& test(X1)
& one != addition(addition(addition(multiplication(X0,X1),multiplication(X0,c(X1))),multiplication(c(X0),X1)),multiplication(c(X0),c(X1))) ),
inference(flattening,[],[f21]) ).
fof(f26,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(f27,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,[],[f26]) ).
fof(f28,plain,
! [X0,X1] :
( ~ test(X0)
| ( ( c(X0) != X1
| complement(X0,X1) )
& ( ~ complement(X0,X1)
| c(X0) = X1 ) ) ),
inference(nnf_transformation,[],[f19]) ).
fof(f29,plain,
( test(sK1)
& test(sK2)
& one != addition(addition(addition(multiplication(sK1,sK2),multiplication(sK1,c(sK2))),multiplication(c(sK1),sK2)),multiplication(c(sK1),c(sK2))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X0,sK1),skolemize(X1,sK2)],[f22]) ).
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,[],[f2]) ).
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(f43,plain,
! [X0,X1] :
( ~ complement(X1,X0)
| addition(X0,X1) = one ),
inference(cnf_transformation,[],[f27]) ).
fof(f47,plain,
! [X0,X1] :
( ~ test(X0)
| c(X0) != X1
| complement(X0,X1) ),
inference(cnf_transformation,[],[f28]) ).
fof(f50,plain,
test(sK1),
inference(cnf_transformation,[],[f29]) ).
fof(f51,plain,
test(sK2),
inference(cnf_transformation,[],[f29]) ).
fof(f52,plain,
one != addition(addition(addition(multiplication(sK1,sK2),multiplication(sK1,c(sK2))),multiplication(c(sK1),sK2)),multiplication(c(sK1),c(sK2))),
inference(cnf_transformation,[],[f29]) ).
fof(f53,plain,
! [X0] :
( ~ test(X0)
| complement(X0,c(X0)) ),
inference(equality_resolution,[],[f47]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f30]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i] : addition(addition(X0,X1),X2) = addition(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f31]) ).
tcf(c_55,plain,
! [X0: $i] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f36]) ).
tcf(c_56,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,X1: $i,X2: $i] : addition(multiplication(X0,X1),multiplication(X2,X1)) = multiplication(addition(X0,X2),X1),
inference(cnf_transformation,[],[f38]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i] :
( ( addition(X1,X0) = one )
| ~ complement(X0,X1) ),
inference(cnf_transformation,[],[f43]) ).
tcf(c_67,plain,
! [X0: $i] :
( complement(X0,c(X0))
| ~ test(X0) ),
inference(cnf_transformation,[],[f53]) ).
tcf(c_69,negated_conjecture,
addition(addition(addition(multiplication(sK1,sK2),multiplication(sK1,c(sK2))),multiplication(c(sK1),sK2)),multiplication(c(sK1),c(sK2))) != one,
inference(cnf_transformation,[],[f52]) ).
tcf(c_70,negated_conjecture,
test(sK2),
inference(cnf_transformation,[],[f51]) ).
tcf(c_71,negated_conjecture,
test(sK1),
inference(cnf_transformation,[],[f50]) ).
tcf(c_88,negated_conjecture,
addition(multiplication(sK1,sK2),addition(multiplication(sK1,c(sK2)),addition(multiplication(c(sK1),sK2),multiplication(c(sK1),c(sK2))))) != one,
inference(theory_normalisation,[status(thm)],[c_69,c_50,c_49]) ).
tcf(c_191,plain,
addition(multiplication(sK1,sK2),addition(multiplication(sK1,c(sK2)),multiplication(c(sK1),addition(c(sK2),sK2)))) != one,
inference(ac_demodulation,[status(thm)],[c_88,c_56,c_50,c_49]) ).
tcf(c_192,plain,
addition(multiplication(c(sK1),addition(c(sK2),sK2)),multiplication(sK1,addition(c(sK2),sK2))) != one,
inference(ac_demodulation,[status(thm)],[c_191,c_56,c_50,c_49]) ).
tcf(c_193,plain,
multiplication(addition(c(sK1),sK1),addition(c(sK2),sK2)) != one,
inference(ac_demodulation,[status(thm)],[c_192,c_57,c_50,c_49]) ).
tcf(c_194,plain,
multiplication(addition(sK1,c(sK1)),addition(sK2,c(sK2))) != one,
inference(theory_normalisation,[status(thm)],[c_193,c_50,c_49]) ).
tcf(c_474,definition,
iPr_def_10 = c(sK1),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_475,definition,
iPr_def_11 = addition(sK1,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_476,definition,
iPr_def_12 = c(sK2),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_477,definition,
iPr_def_13 = addition(sK2,iPr_def_12),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_478,definition,
iPr_def_14 = multiplication(iPr_def_11,iPr_def_13),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_479,plain,
iPr_def_14 != one,
inference(demodulation,[status(thm)],[c_194,c_476,c_477,c_474,c_475,c_478]) ).
tcf(c_480,negated_conjecture,
test(sK1),
inference(demodulation,[status(thm)],[c_71]) ).
tcf(c_481,negated_conjecture,
test(sK2),
inference(demodulation,[status(thm)],[c_70]) ).
tcf(c_735,plain,
addition(iPr_def_10,sK1) = iPr_def_11,
inference(theory_normalisation,[status(thm)],[c_475,c_50,c_49]) ).
tcf(c_738,plain,
addition(iPr_def_12,sK2) = iPr_def_13,
inference(theory_normalisation,[status(thm)],[c_477,c_50,c_49]) ).
tcf(c_748,plain,
( complement(sK2,iPr_def_12)
| ~ test(sK2) ),
inference(superposition,[status(thm)],[c_476,c_67]) ).
tcf(c_749,plain,
( complement(sK1,iPr_def_10)
| ~ test(sK1) ),
inference(superposition,[status(thm)],[c_474,c_67]) ).
tcf(c_753,plain,
complement(sK1,iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_749,c_480]) ).
tcf(c_754,plain,
complement(sK2,iPr_def_12),
inference(forward_subsumption_resolution,[status(thm)],[c_748,c_481]) ).
tcf(c_831,plain,
addition(iPr_def_12,sK2) = one,
inference(superposition,[status(thm)],[c_754,c_65]) ).
tcf(c_832,plain,
addition(iPr_def_10,sK1) = one,
inference(superposition,[status(thm)],[c_753,c_65]) ).
tcf(c_833,plain,
one = iPr_def_11,
inference(light_normalisation,[status(thm)],[c_832,c_735]) ).
tcf(c_834,plain,
one = iPr_def_13,
inference(light_normalisation,[status(thm)],[c_831,c_738]) ).
tcf(c_841,plain,
! [X0: $i] : multiplication(iPr_def_11,X0) = X0,
inference(demodulation,[status(thm)],[c_55,c_833]) ).
tcf(c_843,plain,
iPr_def_11 != iPr_def_14,
inference(demodulation,[status(thm)],[c_479,c_833]) ).
tcf(c_844,plain,
iPr_def_13 = iPr_def_14,
inference(demodulation,[status(thm)],[c_478,c_841]) ).
tcf(c_862,plain,
iPr_def_11 = iPr_def_13,
inference(light_normalisation,[status(thm)],[c_834,c_833]) ).
tcf(c_864,plain,
iPr_def_11 = iPr_def_14,
inference(light_normalisation,[status(thm)],[c_844,c_862]) ).
tcf(c_865,plain,
$false,
inference(ground_joinability,[status(thm)],[c_843,c_864]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KLE009+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n004.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Wed Sep 23 18:34:20 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.14/0.41
% 0.14/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.41
% 0.14/0.41 % Detected problem language: tptp
% 0.14/0.42 % Proving...
% 2.31/1.16 % SZS status Started for theBenchmark.p
% 2.31/1.16 % SZS status Theorem for theBenchmark.p
% 2.31/1.16
% 2.31/1.16 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.31/1.16
% 2.31/1.16 % ------ iProver source info
% 2.31/1.16
% 2.31/1.16 % git: date: 2026-07-19 20:42:38 +0200
% 2.31/1.16 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.31/1.16 % git: non_committed_changes: false
% 2.31/1.16
% 2.31/1.16 % ------ Parsing...
% 2.31/1.16 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.31/1.16
% 2.31/1.16 % ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe_e %
% 2.31/1.16
% 2.31/1.16 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.31/1.16
% 2.31/1.16 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.31/1.16 % ------ Proving...
% 2.31/1.16 % ------ Problem Properties
% 2.31/1.16
% 2.31/1.16 %
% 2.31/1.16 % clauses 28
% 2.31/1.16 % conjectures 2
% 2.31/1.16 % EPR 4
% 2.31/1.16 % Horn 27
% 2.31/1.16 % unary 19
% 2.31/1.16 % binary 7
% 2.31/1.16 % lits 40
% 2.31/1.16 % lits eq 25
% 2.31/1.16 % fd_pure 0
% 2.31/1.16 % fd_pseudo 0
% 2.31/1.16 % fd_cond 0
% 2.31/1.16 % fd_pseudo_cond 1
% 2.31/1.16 % AC symbols 1
% 2.31/1.16
% 2.31/1.16 % ------ Schedule dynamic 5 is on
% 2.31/1.16
% 2.31/1.16 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.31/1.16
% 2.31/1.16
% 2.31/1.16 % ------
% 2.31/1.16 % Current options:
% 2.31/1.16 % ------
% 2.31/1.16
% 2.31/1.16
% 2.31/1.16 %
% 2.31/1.16
% 2.31/1.16 % ------ Proving...
% 2.31/1.16 %
% 2.31/1.16
% 2.31/1.16 % SZS status Theorem for theBenchmark.p
% 2.31/1.16
% 2.31/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.31/1.17
%------------------------------------------------------------------------------