%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KLE013+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 : n018.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:09 PM UTC 2026
% Result : Theorem 4.26s 1.66s
% Output : CNFRefutation 4.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 11
% Syntax : Number of formulae : 73 ( 48 unt; 0 def)
% Number of atoms : 129 ( 73 equ)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 93 ( 37 ~; 29 |; 20 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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; 4 con; 0-2 aty)
% Number of variables : 99 ( 0 sgn 92 !; 7 ?; 35 :)
% 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(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
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(f13,axiom,
! [X0] :
( test(X0)
<=> ? [X1] : complement(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_1) ).
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(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(X0,X1),multiplication(c(X0),c(X1))) ),
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f19,plain,
? [X0,X1] :
( test(X0)
& test(X1)
& one != addition(addition(X0,X1),multiplication(c(X0),c(X1))) ),
inference(ennf_transformation,[],[f18]) ).
fof(f20,plain,
? [X0,X1] :
( test(X0)
& test(X1)
& one != addition(addition(X0,X1),multiplication(c(X0),c(X1))) ),
inference(flattening,[],[f19]) ).
fof(f22,plain,
! [X0,X1] :
( ~ test(X0)
| ( c(X0) = X1
<=> complement(X0,X1) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f23,plain,
( test(sK0)
& test(sK1)
& one != addition(addition(sK0,sK1),multiplication(c(sK0),c(sK1))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f20]) ).
fof(f24,plain,
! [X0,X1] :
( ~ test(X0)
| ( ( c(X0) != X1
| complement(X0,X1) )
& ( ~ complement(X0,X1)
| c(X0) = X1 ) ) ),
inference(nnf_transformation,[],[f22]) ).
fof(f25,plain,
! [X0] :
( ( ~ test(X0)
| ? [X1] : complement(X1,X0) )
& ( ! [X1] : ~ complement(X1,X0)
| test(X0) ) ),
inference(nnf_transformation,[],[f13]) ).
fof(f26,plain,
! [X0] :
( ( ~ test(X0)
| ? [X2] : complement(X2,X0) )
& ( ! [X1] : ~ complement(X1,X0)
| test(X0) ) ),
inference(rectify,[],[f25]) ).
fof(f27,plain,
! [X0] :
( ( ~ test(X0)
| complement(sK2(X0),X0) )
& ( ! [X1] : ~ complement(X1,X0)
| test(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X2,sK2(X0))],[f26]) ).
fof(f28,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(f29,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,[],[f28]) ).
fof(f30,plain,
test(sK0),
inference(cnf_transformation,[],[f23]) ).
fof(f31,plain,
test(sK1),
inference(cnf_transformation,[],[f23]) ).
fof(f32,plain,
one != addition(addition(sK0,sK1),multiplication(c(sK0),c(sK1))),
inference(cnf_transformation,[],[f23]) ).
fof(f33,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f34,plain,
! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
inference(cnf_transformation,[],[f8]) ).
fof(f35,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f36,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f2]) ).
fof(f37,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f39,plain,
! [X0,X1] :
( ~ test(X0)
| c(X0) != X1
| complement(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f41,plain,
! [X0] :
( ~ test(X0)
| complement(sK2(X0),X0) ),
inference(cnf_transformation,[],[f27]) ).
fof(f44,plain,
! [X0,X1] :
( ~ complement(X1,X0)
| addition(X0,X1) = one ),
inference(cnf_transformation,[],[f29]) ).
fof(f48,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f49,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f53,plain,
! [X0] :
( ~ test(X0)
| complement(X0,c(X0)) ),
inference(equality_resolution,[],[f39]) ).
tcf(c_49,negated_conjecture,
addition(addition(sK0,sK1),multiplication(c(sK0),c(sK1))) != one,
inference(cnf_transformation,[],[f32]) ).
tcf(c_50,negated_conjecture,
test(sK1),
inference(cnf_transformation,[],[f31]) ).
tcf(c_51,negated_conjecture,
test(sK0),
inference(cnf_transformation,[],[f30]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i,X2: $i] : addition(multiplication(X0,X1),multiplication(X2,X1)) = multiplication(addition(X0,X2),X1),
inference(cnf_transformation,[],[f33]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i] : addition(multiplication(X0,X1),multiplication(X0,X2)) = multiplication(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f34]) ).
tcf(c_54,plain,
! [X0: $i] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f35]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i] : addition(addition(X0,X1),X2) = addition(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f36]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f37]) ).
tcf(c_59,plain,
! [X0: $i] :
( complement(X0,c(X0))
| ~ test(X0) ),
inference(cnf_transformation,[],[f53]) ).
tcf(c_61,plain,
! [X0: $i] :
( complement(sK2(X0),X0)
| ~ test(X0) ),
inference(cnf_transformation,[],[f41]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i] :
( ( addition(X1,X0) = one )
| ~ complement(X0,X1) ),
inference(cnf_transformation,[],[f44]) ).
tcf(c_67,plain,
! [X0: $i] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f48]) ).
tcf(c_68,plain,
! [X0: $i] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f49]) ).
tcf(c_88,negated_conjecture,
addition(sK0,addition(sK1,multiplication(c(sK0),c(sK1)))) != one,
inference(theory_normalisation,[status(thm)],[c_49,c_55,c_56]) ).
tcf(c_700,plain,
! [X0: $i,X1: $i,X2: $i] : addition(X0,addition(X1,X2)) = addition(X1,addition(X0,X2)),
inference(superposition,[status(thm)],[c_55,c_56]) ).
tcf(c_708,plain,
! [X0: $i,X1: $i] : addition(X0,addition(X1,X0)) = addition(X1,X0),
inference(superposition,[status(thm)],[c_54,c_700]) ).
tcf(c_776,plain,
! [X0: $i] :
( ( addition(c(X0),X0) = one )
| ~ test(X0) ),
inference(superposition,[status(thm)],[c_59,c_66]) ).
tcf(c_777,plain,
! [X0: $i] :
( ( addition(X0,sK2(X0)) = one )
| ~ test(X0) ),
inference(superposition,[status(thm)],[c_61,c_66]) ).
tcf(c_780,plain,
! [X0: $i] :
( ( addition(X0,c(X0)) = one )
| ~ test(X0) ),
inference(theory_normalisation,[status(thm)],[c_776,c_55,c_56]) ).
tcf(c_786,plain,
! [X0: $i,X1: $i] : addition(X0,addition(X0,X1)) = addition(X0,X1),
inference(superposition,[status(thm)],[c_56,c_708]) ).
tcf(c_1246,plain,
addition(sK1,sK2(sK1)) = one,
inference(superposition,[status(thm)],[c_50,c_777]) ).
tcf(c_1266,plain,
addition(sK1,one) = one,
inference(superposition,[status(thm)],[c_1246,c_786]) ).
tcf(c_1273,plain,
addition(one,sK1) = one,
inference(theory_normalisation,[status(thm)],[c_1266,c_55,c_56]) ).
tcf(c_2479,plain,
addition(sK1,c(sK1)) = one,
inference(superposition,[status(thm)],[c_50,c_780]) ).
tcf(c_2480,plain,
addition(sK0,c(sK0)) = one,
inference(superposition,[status(thm)],[c_51,c_780]) ).
tcf(c_2514,plain,
! [X0: $i] : addition(multiplication(X0,sK1),multiplication(X0,c(sK1))) = multiplication(X0,one),
inference(superposition,[status(thm)],[c_2479,c_53]) ).
tcf(c_2519,plain,
! [X0: $i] : addition(multiplication(X0,sK1),multiplication(X0,c(sK1))) = X0,
inference(light_normalisation,[status(thm)],[c_2514,c_68]) ).
tcf(c_2535,plain,
! [X0: $i] : addition(sK0,addition(c(sK0),X0)) = addition(one,X0),
inference(superposition,[status(thm)],[c_2480,c_55]) ).
tcf(c_2540,plain,
addition(c(sK0),one) = one,
inference(superposition,[status(thm)],[c_2480,c_708]) ).
tcf(c_2542,plain,
addition(one,c(sK0)) = one,
inference(theory_normalisation,[status(thm)],[c_2540,c_55,c_56]) ).
tcf(c_2605,plain,
! [X0: $i] : addition(multiplication(one,X0),multiplication(c(sK0),X0)) = multiplication(one,X0),
inference(superposition,[status(thm)],[c_2542,c_52]) ).
tcf(c_2612,plain,
! [X0: $i] : addition(X0,multiplication(c(sK0),X0)) = X0,
inference(light_normalisation,[status(thm)],[c_2605,c_67]) ).
tcf(c_3212,plain,
! [X0: $i,X1: $i] : addition(X0,addition(multiplication(c(sK0),X0),X1)) = addition(X0,X1),
inference(superposition,[status(thm)],[c_2612,c_55]) ).
tcf(c_22485,plain,
addition(sK1,multiplication(c(sK0),c(sK1))) = addition(sK1,c(sK0)),
inference(superposition,[status(thm)],[c_2519,c_3212]) ).
tcf(c_22626,plain,
addition(sK1,multiplication(c(sK0),c(sK1))) = addition(c(sK0),sK1),
inference(theory_normalisation,[status(thm)],[c_22485,c_55,c_56]) ).
tcf(c_22738,plain,
addition(sK0,addition(c(sK0),sK1)) != one,
inference(demodulation,[status(thm)],[c_88,c_22626]) ).
tcf(c_22739,plain,
$false,
inference(ground_joinability,[status(thm)],[c_22738,c_1273,c_2535]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KLE013+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.36 % Computer : n018.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.37 % DateTime : Wed Sep 23 18:39:04 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 4.26/1.66 % SZS status Started for theBenchmark.p
% 4.26/1.66 % SZS status Theorem for theBenchmark.p
% 4.26/1.66
% 4.26/1.66 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.26/1.66
% 4.26/1.66 % ------ iProver source info
% 4.26/1.66
% 4.26/1.66 % git: date: 2026-07-19 20:42:38 +0200
% 4.26/1.66 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.26/1.66 % git: non_committed_changes: false
% 4.26/1.66
% 4.26/1.66 % ------ Parsing...
% 4.26/1.66 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.26/1.66
% 4.26/1.66 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 4.26/1.66
% 4.26/1.66 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.26/1.66
% 4.26/1.66 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.26/1.66 % ------ Proving...
% 4.26/1.66 % ------ Problem Properties
% 4.26/1.66
% 4.26/1.66 %
% 4.26/1.66 % clauses 23
% 4.26/1.66 % conjectures 3
% 4.26/1.66 % EPR 3
% 4.26/1.66 % Horn 22
% 4.26/1.66 % unary 14
% 4.26/1.66 % binary 7
% 4.26/1.66 % lits 35
% 4.26/1.66 % lits eq 20
% 4.26/1.66 % fd_pure 0
% 4.26/1.66 % fd_pseudo 0
% 4.26/1.66 % fd_cond 0
% 4.26/1.66 % fd_pseudo_cond 1
% 4.26/1.66 % AC symbols 1
% 4.26/1.66
% 4.26/1.66 % ------ Schedule dynamic 5 is on
% 4.26/1.66
% 4.26/1.66 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.26/1.66
% 4.26/1.66
% 4.26/1.66 % ------
% 4.26/1.66 % Current options:
% 4.26/1.66 % ------
% 4.26/1.66
% 4.26/1.66
% 4.26/1.66 %
% 4.26/1.66
% 4.26/1.66 % ------ Proving...
% 4.26/1.66 %
% 4.26/1.66
% 4.26/1.66 % SZS status Theorem for theBenchmark.p
% 4.26/1.66
% 4.26/1.66 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.26/1.66
% 4.26/1.66
%------------------------------------------------------------------------------