%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM926+1 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n026.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 02:27:20 PM UTC 2026
% Result : Theorem 3.76s 1.29s
% Output : CNFRefutation 3.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 16
% Syntax : Number of formulae : 75 ( 39 unt; 0 def)
% Number of atoms : 120 ( 57 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 93 ( 48 ~; 37 |; 3 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 7 ( 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 : 17 ( 17 usr; 8 con; 0-2 aty)
% Number of variables : 122 ( 0 sgn 110 !; 12 ?; 44 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
ord_less_eq_int(one_one_int,t),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_tpos) ).
fof(f2,axiom,
( t = one_one_int
=> ? [X0,X1] : plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06) ).
fof(f3,axiom,
( ord_less_int(one_one_int,t)
=> ? [X0,X1] : plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06) ).
fof(f30,axiom,
! [X0,X1] :
( ord_less_int(X1,X0)
| X0 = X1
| ord_less_int(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_29_zless__linear) ).
fof(f39,axiom,
! [X0,X1] :
( ord_less_eq_int(number_number_of_int(X0),number_number_of_int(X1))
<=> ~ ord_less_int(number_number_of_int(X1),number_number_of_int(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_38_le__number__of__eq__not__less) ).
fof(f59,axiom,
! [X0,X1] :
( ord_less_int(number_number_of_int(X0),number_number_of_int(X1))
<=> ord_less_int(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_58_less__number__of__int__code) ).
fof(f60,axiom,
! [X0,X1] :
( ord_less_eq_int(number_number_of_int(X0),number_number_of_int(X1))
<=> ord_less_eq_int(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_59_less__eq__number__of__int__code) ).
fof(f85,axiom,
! [X0,X1,X2] : times_times_int(times_times_int(X0,X1),X2) = times_times_int(X0,times_times_int(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_84_comm__semiring__1__class_Onormalizing__semiring__rules_I17_J) ).
fof(f86,axiom,
! [X0,X1,X2] : times_times_nat(times_times_nat(X0,X1),X2) = times_times_nat(X0,times_times_nat(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_85_comm__semiring__1__class_Onormalizing__semiring__rules_I17_J) ).
fof(f91,axiom,
! [X0,X1] : times_times_int(X0,X1) = times_times_int(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_90_comm__semiring__1__class_Onormalizing__semiring__rules_I7_J) ).
fof(f92,axiom,
! [X0,X1] : times_times_nat(X0,X1) = times_times_nat(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_91_comm__semiring__1__class_Onormalizing__semiring__rules_I7_J) ).
fof(f97,axiom,
! [X0,X1,X2] : plus_plus_int(plus_plus_int(X0,X1),X2) = plus_plus_int(X0,plus_plus_int(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_96_comm__semiring__1__class_Onormalizing__semiring__rules_I21_J) ).
fof(f98,axiom,
! [X0,X1,X2] : plus_plus_nat(plus_plus_nat(X0,X1),X2) = plus_plus_nat(X0,plus_plus_nat(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_97_comm__semiring__1__class_Onormalizing__semiring__rules_I21_J) ).
fof(f103,axiom,
! [X0,X1] : plus_plus_int(X0,X1) = plus_plus_int(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_102_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J) ).
fof(f104,axiom,
! [X0,X1] : plus_plus_nat(X0,X1) = plus_plus_nat(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_103_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J) ).
fof(f124,conjecture,
? [X0,X1] : plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
fof(f125,negated_conjecture,
~ ? [X0,X1] : plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),
inference(negated_conjecture,[status(cth)],[f124]) ).
fof(f128,plain,
( one_one_int != t
| ? [X0,X1] : plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ),
inference(ennf_transformation,[],[f2]) ).
fof(f129,plain,
( ~ ord_less_int(one_one_int,t)
| ? [X0,X1] : plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ),
inference(ennf_transformation,[],[f3]) ).
fof(f143,plain,
! [X0,X1] : plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) != plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),
inference(ennf_transformation,[],[f125]) ).
fof(f144,plain,
( one_one_int != t
| plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) = plus_plus_int(power_power_int(sK0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK1,number_number_of_nat(bit0(bit1(pls))))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f128]) ).
fof(f145,plain,
( ~ ord_less_int(one_one_int,t)
| plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) = plus_plus_int(power_power_int(sK2,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK3,number_number_of_nat(bit0(bit1(pls))))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X0,sK2),skolemize(X1,sK3)],[f129]) ).
fof(f150,plain,
! [X0,X1] :
( ( ~ ord_less_eq_int(number_number_of_int(X0),number_number_of_int(X1))
| ~ ord_less_int(number_number_of_int(X1),number_number_of_int(X0)) )
& ( ord_less_int(number_number_of_int(X1),number_number_of_int(X0))
| ord_less_eq_int(number_number_of_int(X0),number_number_of_int(X1)) ) ),
inference(nnf_transformation,[],[f39]) ).
fof(f161,plain,
! [X0,X1] :
( ( ~ ord_less_int(number_number_of_int(X0),number_number_of_int(X1))
| ord_less_int(X0,X1) )
& ( ~ ord_less_int(X0,X1)
| ord_less_int(number_number_of_int(X0),number_number_of_int(X1)) ) ),
inference(nnf_transformation,[],[f59]) ).
fof(f162,plain,
! [X0,X1] :
( ( ~ ord_less_eq_int(number_number_of_int(X0),number_number_of_int(X1))
| ord_less_eq_int(X0,X1) )
& ( ~ ord_less_eq_int(X0,X1)
| ord_less_eq_int(number_number_of_int(X0),number_number_of_int(X1)) ) ),
inference(nnf_transformation,[],[f60]) ).
fof(f184,plain,
ord_less_eq_int(one_one_int,t),
inference(cnf_transformation,[],[f1]) ).
fof(f185,plain,
( one_one_int != t
| plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) = plus_plus_int(power_power_int(sK0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK1,number_number_of_nat(bit0(bit1(pls))))) ),
inference(cnf_transformation,[],[f144]) ).
fof(f186,plain,
( ~ ord_less_int(one_one_int,t)
| plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) = plus_plus_int(power_power_int(sK2,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK3,number_number_of_nat(bit0(bit1(pls))))) ),
inference(cnf_transformation,[],[f145]) ).
fof(f214,plain,
! [X0,X1] :
( ord_less_int(X1,X0)
| X0 = X1
| ord_less_int(X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f224,plain,
! [X0,X1] :
( ~ ord_less_eq_int(number_number_of_int(X0),number_number_of_int(X1))
| ~ ord_less_int(number_number_of_int(X1),number_number_of_int(X0)) ),
inference(cnf_transformation,[],[f150]) ).
fof(f256,plain,
! [X0,X1] :
( ~ ord_less_int(X0,X1)
| ord_less_int(number_number_of_int(X0),number_number_of_int(X1)) ),
inference(cnf_transformation,[],[f161]) ).
fof(f258,plain,
! [X0,X1] :
( ~ ord_less_eq_int(X0,X1)
| ord_less_eq_int(number_number_of_int(X0),number_number_of_int(X1)) ),
inference(cnf_transformation,[],[f162]) ).
fof(f292,plain,
! [X2,X0,X1] : times_times_int(times_times_int(X0,X1),X2) = times_times_int(X0,times_times_int(X1,X2)),
inference(cnf_transformation,[],[f85]) ).
fof(f293,plain,
! [X2,X0,X1] : times_times_nat(times_times_nat(X0,X1),X2) = times_times_nat(X0,times_times_nat(X1,X2)),
inference(cnf_transformation,[],[f86]) ).
fof(f298,plain,
! [X0,X1] : times_times_int(X1,X0) = times_times_int(X0,X1),
inference(cnf_transformation,[],[f91]) ).
fof(f299,plain,
! [X0,X1] : times_times_nat(X0,X1) = times_times_nat(X1,X0),
inference(cnf_transformation,[],[f92]) ).
fof(f304,plain,
! [X2,X0,X1] : plus_plus_int(plus_plus_int(X0,X1),X2) = plus_plus_int(X0,plus_plus_int(X1,X2)),
inference(cnf_transformation,[],[f97]) ).
fof(f305,plain,
! [X2,X0,X1] : plus_plus_nat(plus_plus_nat(X0,X1),X2) = plus_plus_nat(X0,plus_plus_nat(X1,X2)),
inference(cnf_transformation,[],[f98]) ).
fof(f310,plain,
! [X0,X1] : plus_plus_int(X0,X1) = plus_plus_int(X1,X0),
inference(cnf_transformation,[],[f103]) ).
fof(f311,plain,
! [X0,X1] : plus_plus_nat(X0,X1) = plus_plus_nat(X1,X0),
inference(cnf_transformation,[],[f104]) ).
fof(f344,plain,
! [X0,X1] : plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) != plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),
inference(cnf_transformation,[],[f143]) ).
tcf(c_49,plain,
ord_less_eq_int(one_one_int,t),
inference(cnf_transformation,[],[f184]) ).
tcf(c_50,plain,
( ( plus_plus_int(power_power_int(sK0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) )
| ( one_one_int != t ) ),
inference(cnf_transformation,[],[f185]) ).
tcf(c_51,plain,
( ( plus_plus_int(power_power_int(sK2,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK3,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) )
| ~ ord_less_int(one_one_int,t) ),
inference(cnf_transformation,[],[f186]) ).
tcf(c_79,plain,
! [X0: $i,X1: $i] :
( ord_less_int(X1,X0)
| ord_less_int(X0,X1)
| ( X0 = X1 ) ),
inference(cnf_transformation,[],[f214]) ).
tcf(c_90,plain,
! [X0: $i,X1: $i] :
( ~ ord_less_int(number_number_of_int(X1),number_number_of_int(X0))
| ~ ord_less_eq_int(number_number_of_int(X0),number_number_of_int(X1)) ),
inference(cnf_transformation,[],[f224]) ).
tcf(c_120,plain,
! [X0: $i,X1: $i] :
( ord_less_int(number_number_of_int(X0),number_number_of_int(X1))
| ~ ord_less_int(X0,X1) ),
inference(cnf_transformation,[],[f256]) ).
tcf(c_122,plain,
! [X0: $i,X1: $i] :
( ord_less_eq_int(number_number_of_int(X0),number_number_of_int(X1))
| ~ ord_less_eq_int(X0,X1) ),
inference(cnf_transformation,[],[f258]) ).
tcf(c_157,plain,
! [X0: $i,X1: $i,X2: $i] : times_times_int(times_times_int(X0,X1),X2) = times_times_int(X0,times_times_int(X1,X2)),
inference(cnf_transformation,[],[f292]) ).
tcf(c_158,plain,
! [X0: $i,X1: $i,X2: $i] : times_times_nat(times_times_nat(X0,X1),X2) = times_times_nat(X0,times_times_nat(X1,X2)),
inference(cnf_transformation,[],[f293]) ).
tcf(c_163,plain,
! [X0: $i,X1: $i] : times_times_int(X0,X1) = times_times_int(X1,X0),
inference(cnf_transformation,[],[f298]) ).
tcf(c_164,plain,
! [X0: $i,X1: $i] : times_times_nat(X0,X1) = times_times_nat(X1,X0),
inference(cnf_transformation,[],[f299]) ).
tcf(c_169,plain,
! [X0: $i,X1: $i,X2: $i] : plus_plus_int(plus_plus_int(X0,X1),X2) = plus_plus_int(X0,plus_plus_int(X1,X2)),
inference(cnf_transformation,[],[f304]) ).
tcf(c_170,plain,
! [X0: $i,X1: $i,X2: $i] : plus_plus_nat(plus_plus_nat(X0,X1),X2) = plus_plus_nat(X0,plus_plus_nat(X1,X2)),
inference(cnf_transformation,[],[f305]) ).
tcf(c_175,plain,
! [X0: $i,X1: $i] : plus_plus_int(X0,X1) = plus_plus_int(X1,X0),
inference(cnf_transformation,[],[f310]) ).
tcf(c_176,plain,
! [X0: $i,X1: $i] : plus_plus_nat(X0,X1) = plus_plus_nat(X1,X0),
inference(cnf_transformation,[],[f311]) ).
tcf(c_202,negated_conjecture,
! [X0: $i,X1: $i] : plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) != plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),
inference(cnf_transformation,[],[f344]) ).
tcf(c_281,plain,
( ( plus_plus_int(power_power_int(sK0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(one_one_int,times_times_int(m,number_number_of_int(bit0(bit0(bit1(pls)))))) )
| ( one_one_int != t ) ),
inference(theory_normalisation,[status(thm)],[c_50,c_158,c_164,c_170,c_176,c_169,c_175,c_157,c_163]) ).
tcf(c_282,plain,
( ( plus_plus_int(power_power_int(sK2,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK3,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(one_one_int,times_times_int(m,number_number_of_int(bit0(bit0(bit1(pls)))))) )
| ~ ord_less_int(one_one_int,t) ),
inference(theory_normalisation,[status(thm)],[c_51,c_158,c_164,c_170,c_176,c_169,c_175,c_157,c_163]) ).
tcf(c_292,negated_conjecture,
! [X0: $i,X1: $i] : plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) != plus_plus_int(one_one_int,times_times_int(m,number_number_of_int(bit0(bit0(bit1(pls)))))),
inference(theory_normalisation,[status(thm)],[c_202,c_158,c_164,c_170,c_176,c_169,c_175,c_157,c_163]) ).
tcf(c_301,plain,
! [X0: $i,X1: $i] :
( ~ ord_less_int(number_number_of_int(X1),number_number_of_int(X0))
| ~ ord_less_eq_int(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_122,c_90]) ).
tcf(c_302,plain,
! [X0: $i,X1: $i] :
( ~ ord_less_eq_int(X1,X0)
| ~ ord_less_int(number_number_of_int(X0),number_number_of_int(X1)) ),
inference(renaming,[status(thm)],[c_301]) ).
tcf(c_307,plain,
! [X0: $i,X1: $i] :
( ord_less_int(number_number_of_int(X0),number_number_of_int(X1))
| ~ ord_less_int(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_120]) ).
tcf(c_373,plain,
( ( plus_plus_int(power_power_int(sK0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(one_one_int,times_times_int(m,number_number_of_int(bit0(bit0(bit1(pls)))))) )
| ( one_one_int != t ) ),
inference(prop_impl_just,[status(thm)],[c_281]) ).
tcf(c_375,plain,
( ( plus_plus_int(power_power_int(sK2,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK3,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(one_one_int,times_times_int(m,number_number_of_int(bit0(bit0(bit1(pls)))))) )
| ~ ord_less_int(one_one_int,t) ),
inference(prop_impl_just,[status(thm)],[c_282]) ).
tcf(c_571,plain,
! [X0: $i,X1: $i] :
( ~ ord_less_int(X1,X0)
| ~ ord_less_eq_int(X0,X1) ),
inference(bin_hyper_res,[status(thm)],[c_302,c_307]) ).
tcf(c_652,plain,
one_one_int != t,
inference(backward_subsumption_resolution,[status(thm)],[c_373,c_292]) ).
tcf(c_653,plain,
~ ord_less_int(one_one_int,t),
inference(backward_subsumption_resolution,[status(thm)],[c_375,c_292]) ).
tcf(c_2617,plain,
! [X0: $i,X1: $i] :
( ~ ord_less_eq_int(X0,X1)
| ~ ord_less_int(X1,X0) ),
inference(prop_impl_just,[status(thm)],[c_571]) ).
tcf(c_2618,plain,
! [X0: $i,X1: $i] :
( ~ ord_less_int(X1,X0)
| ~ ord_less_eq_int(X0,X1) ),
inference(renaming,[status(thm)],[c_2617]) ).
tcf(c_3321,plain,
~ ord_less_int(one_one_int,t),
inference(demodulation,[status(thm)],[c_653]) ).
tcf(c_3322,plain,
one_one_int != t,
inference(demodulation,[status(thm)],[c_652]) ).
tcf(c_4795,plain,
~ ord_less_int(t,one_one_int),
inference(superposition,[status(thm)],[c_49,c_2618]) ).
tcf(c_5225,plain,
( ord_less_int(one_one_int,t)
| ( one_one_int = t ) ),
inference(superposition,[status(thm)],[c_79,c_4795]) ).
tcf(c_5238,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5225,c_3321,c_3322]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM926+1 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n026.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 : Thu Sep 24 05:46:39 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/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.13/0.41
% 0.13/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.41
% 0.13/0.41 % Detected problem language: tptp
% 0.13/0.43 % Proving...
% 3.76/1.29 % SZS status Started for theBenchmark.p
% 3.76/1.29 % SZS status Theorem for theBenchmark.p
% 3.76/1.29
% 3.76/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.76/1.29
% 3.76/1.29 % ------ iProver source info
% 3.76/1.29
% 3.76/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 3.76/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.76/1.29 % git: non_committed_changes: false
% 3.76/1.29
% 3.76/1.29 % ------ Parsing...
% 3.76/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.76/1.29
% 3.76/1.29 % ------ Preprocessing... sup_sim: 30 sf_s rm: 8 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e %
% 3.76/1.29
% 3.76/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.76/1.29
% 3.76/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.76/1.29 % ------ Proving...
% 3.76/1.29 % ------ Problem Properties
% 3.76/1.29
% 3.76/1.29 %
% 3.76/1.29 % clauses 91
% 3.76/1.29 % conjectures 0
% 3.76/1.29 % EPR 10
% 3.76/1.29 % Horn 79
% 3.76/1.29 % unary 46
% 3.76/1.29 % binary 40
% 3.76/1.29 % lits 141
% 3.76/1.29 % lits eq 49
% 3.76/1.29 % fd_pure 0
% 3.76/1.29 % fd_pseudo 0
% 3.76/1.29 % fd_cond 0
% 3.76/1.29 % fd_pseudo_cond 3
% 3.76/1.29 % AC symbols 4
% 3.76/1.29
% 3.76/1.29 % ------ Schedule dynamic 5 is on
% 3.76/1.29
% 3.76/1.29 % ------ no conjectures: strip conj schedule
% 3.76/1.29
% 3.76/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 3.76/1.29
% 3.76/1.29
% 3.76/1.29 % ------
% 3.76/1.29 % Current options:
% 3.76/1.29 % ------
% 3.76/1.29
% 3.76/1.29
% 3.76/1.29 %
% 3.76/1.29
% 3.76/1.29 % ------ Proving...
% 3.76/1.29 %
% 3.76/1.29
% 3.76/1.29 % SZS status Theorem for theBenchmark.p
% 3.76/1.29
% 3.76/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.76/1.29
% 3.76/1.29
%------------------------------------------------------------------------------