%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : KLE005+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 : 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:06 PM UTC 2026
% Result : Theorem 2.08s 6.30s
% Output : CNFRefutation 2.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 38 ( 16 unt; 1 def)
% Number of atoms : 103 ( 54 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 77 ( 32 ~; 31 |; 9 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn 32 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
fof(f14,axiom,
! [X0,X1] :
( complement(X1,X0)
<=> ( addition(X0,X1) = one
& multiplication(X1,X0) = zero
& multiplication(X0,X1) = zero ) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_2) ).
fof(f15,axiom,
! [X0,X1] :
( test(X0)
=> ( c(X0) = X1
<=> complement(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_3) ).
fof(f16,axiom,
! [X0] :
( ~ test(X0)
=> c(X0) = zero ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_4) ).
fof(f17,conjecture,
c(one) = zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f18,negated_conjecture,
c(one) != zero,
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f19,plain,
zero != c(one),
inference(flattening,[],[f18]) ).
fof(f20,plain,
! [X0,X1] :
( ~ test(X0)
| ( c(X0) = X1
<=> complement(X0,X1) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f21,plain,
! [X0] :
( test(X0)
| c(X0) = zero ),
inference(ennf_transformation,[],[f16]) ).
fof(f25,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(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(flattening,[],[f25]) ).
fof(f27,plain,
! [X0,X1] :
( ~ test(X0)
| ( ( c(X0) != X1
| complement(X0,X1) )
& ( ~ complement(X0,X1)
| c(X0) = X1 ) ) ),
inference(nnf_transformation,[],[f20]) ).
fof(f33,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f43,plain,
! [X0,X1] :
( ~ complement(X1,X0)
| zero = multiplication(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f45,plain,
! [X0,X1] :
( ~ test(X0)
| c(X0) != X1
| complement(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f47,plain,
! [X0] :
( test(X0)
| zero = c(X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f48,plain,
zero != c(one),
inference(cnf_transformation,[],[f19]) ).
fof(f49,plain,
! [X0] :
( ~ test(X0)
| complement(X0,c(X0)) ),
inference(equality_resolution,[],[f45]) ).
tcf(c_54,plain,
! [X0: $i] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f33]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] :
( ( multiplication(X1,X0) = zero )
| ~ complement(X0,X1) ),
inference(cnf_transformation,[],[f43]) ).
tcf(c_67,plain,
! [X0: $i] :
( complement(X0,c(X0))
| ~ test(X0) ),
inference(cnf_transformation,[],[f49]) ).
tcf(c_68,plain,
! [X0: $i] :
( test(X0)
| ( c(X0) = zero ) ),
inference(cnf_transformation,[],[f47]) ).
tcf(c_69,negated_conjecture,
c(one) != zero,
inference(cnf_transformation,[],[f48]) ).
tcf(c_416,definition,
iPr_def_10 = c(one),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_417,negated_conjecture,
iPr_def_10 != zero,
inference(demodulation,[status(thm)],[c_69,c_416]) ).
tcf(c_418,plain,
! [X0: $i] : X0 = X0,
theory(equality) ).
tcf(c_420,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X2 = X0 )
| ( X2 != X1 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_658,plain,
( complement(one,iPr_def_10)
| ~ test(one) ),
inference(superposition,[status(thm)],[c_416,c_67]) ).
tcf(c_672,plain,
( complement(one,iPr_def_10)
| ( c(one) = zero ) ),
inference(superposition,[status(thm)],[c_68,c_658]) ).
tcf(c_673,plain,
( complement(one,iPr_def_10)
| ( zero = iPr_def_10 ) ),
inference(light_normalisation,[status(thm)],[c_672,c_416]) ).
tcf(c_720,plain,
( ( zero = iPr_def_10 )
| ( multiplication(iPr_def_10,one) = zero ) ),
inference(superposition,[status(thm)],[c_673,c_63]) ).
tcf(c_787,plain,
! [X0: $i] :
( ( iPr_def_10 = zero )
| ( iPr_def_10 != X0 )
| ( zero != X0 ) ),
inference(instantiation,[status(thm)],[c_420]) ).
tcf(c_850,plain,
( ( iPr_def_10 = zero )
| ( iPr_def_10 != iPr_def_10 )
| ( zero != iPr_def_10 ) ),
inference(instantiation,[status(thm)],[c_787]) ).
tcf(c_851,plain,
iPr_def_10 = iPr_def_10,
inference(instantiation,[status(thm)],[c_418]) ).
tcf(c_893,plain,
multiplication(iPr_def_10,one) = zero,
inference(global_subsumption_just,[status(thm)],[c_720,c_417,c_720,c_850,c_851]) ).
tcf(c_895,plain,
zero = iPr_def_10,
inference(demodulation,[status(thm)],[c_893,c_54]) ).
tcf(c_905,plain,
iPr_def_10 != iPr_def_10,
inference(demodulation,[status(thm)],[c_417,c_895]) ).
tcf(c_906,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_905]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE005+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.10/5.38 % Computer : n018.cluster.edu
% 0.10/5.38 % Model : x86_64 x86_64
% 0.10/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38 % Memory : 8046.5625MB
% 0.10/5.38 % OS : Linux 6.8.0-71-generic
% 0.10/5.38 % CPULimit : 300
% 0.10/5.38 % WCLimit : 300
% 0.10/5.38 % DateTime : Wed Sep 23 18:36:23 UTC 2026
% 0.10/5.39 % CPUTime :
% 0.10/5.39 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/5.42 Running first-order theorem proving
% 0.14/5.43 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.14/5.44
% 0.14/5.44 % ======== iProver multi-core TPTP/SMT =========
% 0.14/5.44
% 0.14/5.44 % Detected problem language: tptp
% 0.14/5.45 % Proving...
% 2.08/6.30 % SZS status Started for theBenchmark.p
% 2.08/6.30 % SZS status Theorem for theBenchmark.p
% 2.08/6.30
% 2.08/6.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.08/6.30
% 2.08/6.30 % ------ iProver source info
% 2.08/6.30
% 2.08/6.30 % git: date: 2026-07-19 20:42:38 +0200
% 2.08/6.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.08/6.30 % git: non_committed_changes: false
% 2.08/6.30
% 2.08/6.30 % ------ Parsing...
% 2.08/6.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.08/6.30
% 2.08/6.30 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 2.08/6.30
% 2.08/6.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.08/6.30
% 2.08/6.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.08/6.30 % ------ Proving...
% 2.08/6.30 % ------ Problem Properties
% 2.08/6.30
% 2.08/6.30 %
% 2.08/6.30 % clauses 22
% 2.08/6.30 % conjectures 1
% 2.08/6.30 % EPR 2
% 2.08/6.30 % Horn 21
% 2.08/6.30 % unary 13
% 2.08/6.30 % binary 7
% 2.08/6.30 % lits 34
% 2.08/6.30 % lits eq 21
% 2.08/6.30 % fd_pure 0
% 2.08/6.30 % fd_pseudo 0
% 2.08/6.30 % fd_cond 0
% 2.08/6.30 % fd_pseudo_cond 1
% 2.08/6.30 % AC symbols 1
% 2.08/6.30
% 2.08/6.30 % ------ Schedule dynamic 5 is on
% 2.08/6.30
% 2.08/6.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.08/6.30
% 2.08/6.30
% 2.08/6.30 % ------
% 2.08/6.30 % Current options:
% 2.08/6.30 % ------
% 2.08/6.30
% 2.08/6.30
% 2.08/6.30 %
% 2.08/6.30
% 2.08/6.30 % ------ Proving...
% 2.08/6.30 %
% 2.08/6.30
% 2.08/6.30 % SZS status Theorem for theBenchmark.p
% 2.08/6.30
% 2.08/6.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.08/6.30
% 2.08/6.30
%------------------------------------------------------------------------------