%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM926+6 : 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 : n003.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:31 PM UTC 2026
% Result : Theorem 15.76s 3.67s
% Output : CNFRefutation 15.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of formulae : 67 ( 41 unt; 2 def)
% Number of atoms : 122 ( 62 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 74 ( 37 ~; 31 |; 0 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 3 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 9 con; 0-3 aty)
% Number of variables : 48 ( 0 sgn 36 !; 12 ?; 9 :)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0] :
( zero_neq_one(X0)
=> ti(X0,one_one(X0)) = one_one(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tsy_c_Groups_Oone__class_Oone_0_res) ).
fof(f70,axiom,
ti(int,t) = t,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tsy_v_t_____res) ).
fof(f71,axiom,
ord_less_eq(int,one_one(int),t),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_tpos) ).
fof(f72,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(f73,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(f157,axiom,
! [X0] : number_number_of(int,X0) = ti(int,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_86_number__of__is__id) ).
fof(f197,axiom,
! [X0] : bit0(X0) = plus_plus(int,X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_126_Bit0__def) ).
fof(f222,axiom,
! [X0] : bit1(X0) = plus_plus(int,plus_plus(int,one_one(int),X0),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_151_Bit1__def) ).
fof(f398,axiom,
! [X0] :
( order(X0)
=> ! [X1,X2] :
( ord_less_eq(X0,X1,X2)
=> ( ti(X0,X1) != ti(X0,X2)
=> ord_less(X0,X1,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_327_order__le__neq__implies__less) ).
fof(f584,axiom,
zero_neq_one(int),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',arity_Int_Oint___Rings_Ozero__neq__one) ).
fof(f591,axiom,
order(int),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',arity_Int_Oint___Orderings_Oorder) ).
fof(f653,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(f654,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)],[f653]) ).
fof(f658,plain,
! [X0] :
( ~ zero_neq_one(X0)
| ti(X0,one_one(X0)) = one_one(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f696,plain,
( 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)) ),
inference(ennf_transformation,[],[f72]) ).
fof(f697,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,[],[f73]) ).
fof(f938,plain,
! [X0] :
( ~ order(X0)
| ! [X1,X2] :
( ~ ord_less_eq(X0,X1,X2)
| ti(X0,X1) = ti(X0,X2)
| ord_less(X0,X1,X2) ) ),
inference(ennf_transformation,[],[f398]) ).
fof(f939,plain,
! [X0] :
( ~ order(X0)
| ! [X1,X2] :
( ~ ord_less_eq(X0,X1,X2)
| ti(X0,X1) = ti(X0,X2)
| ord_less(X0,X1,X2) ) ),
inference(flattening,[],[f938]) ).
fof(f1117,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,[],[f654]) ).
fof(f1131,plain,
( t != one_one(int)
| 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)],[f696]) ).
fof(f1132,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)],[f697]) ).
fof(f1305,plain,
! [X0] :
( ~ zero_neq_one(X0)
| one_one(X0) = ti(X0,one_one(X0)) ),
inference(cnf_transformation,[],[f658]) ).
fof(f1381,plain,
t = ti(int,t),
inference(cnf_transformation,[],[f70]) ).
fof(f1382,plain,
ord_less_eq(int,one_one(int),t),
inference(cnf_transformation,[],[f71]) ).
fof(f1383,plain,
( t != one_one(int)
| 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,[],[f1131]) ).
fof(f1384,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,[],[f1132]) ).
fof(f1497,plain,
! [X0] : ti(int,X0) = number_number_of(int,X0),
inference(cnf_transformation,[],[f157]) ).
fof(f1559,plain,
! [X0] : bit0(X0) = plus_plus(int,X0,X0),
inference(cnf_transformation,[],[f197]) ).
fof(f1584,plain,
! [X0] : bit1(X0) = plus_plus(int,plus_plus(int,one_one(int),X0),X0),
inference(cnf_transformation,[],[f222]) ).
fof(f1841,plain,
! [X2,X0,X1] :
( ~ order(X0)
| ~ ord_less_eq(X0,X1,X2)
| ti(X0,X1) = ti(X0,X2)
| ord_less(X0,X1,X2) ),
inference(cnf_transformation,[],[f939]) ).
fof(f2083,plain,
zero_neq_one(int),
inference(cnf_transformation,[],[f584]) ).
fof(f2090,plain,
order(int),
inference(cnf_transformation,[],[f591]) ).
fof(f2152,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,[],[f1117]) ).
fof(f2157,plain,
( t != one_one(int)
| plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int)) = plus_plus(int,power_power(int,sK0,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),power_power(int,sK1,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls))))) ),
inference(definition_unfolding,[],[f1383,f1559,f1559,f1584,f1559,f1584,f1559,f1584]) ).
fof(f2158,plain,
( ~ ord_less(int,one_one(int),t)
| plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int)) = plus_plus(int,power_power(int,sK2,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),power_power(int,sK3,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls))))) ),
inference(definition_unfolding,[],[f1384,f1559,f1559,f1584,f1559,f1584,f1559,f1584]) ).
fof(f2375,plain,
! [X0,X1] : plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int)) != plus_plus(int,power_power(int,X0,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),power_power(int,X1,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls))))),
inference(definition_unfolding,[],[f2152,f1559,f1584,f1559,f1584,f1559,f1559,f1584]) ).
tcf(c_55,plain,
! [X0: $i] :
( ( ti(X0,one_one(X0)) = one_one(X0) )
| ~ zero_neq_one(X0) ),
inference(cnf_transformation,[],[f1305]) ).
tcf(c_131,plain,
ti(int,t) = t,
inference(cnf_transformation,[],[f1381]) ).
tcf(c_132,plain,
ord_less_eq(int,one_one(int),t),
inference(cnf_transformation,[],[f1382]) ).
tcf(c_133,plain,
( ( plus_plus(int,power_power(int,sK0,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),power_power(int,sK1,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls))))) = plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int)) )
| ( one_one(int) != t ) ),
inference(cnf_transformation,[],[f2157]) ).
tcf(c_134,plain,
( ( plus_plus(int,power_power(int,sK2,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),power_power(int,sK3,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls))))) = plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int)) )
| ~ ord_less(int,one_one(int),t) ),
inference(cnf_transformation,[],[f2158]) ).
tcf(c_245,plain,
! [X0: $i] : ti(int,X0) = number_number_of(int,X0),
inference(cnf_transformation,[],[f1497]) ).
tcf(c_585,plain,
! [X0: $i,X1: $i,X2: $i] :
( ord_less(X0,X1,X2)
| ( ti(X0,X1) = ti(X0,X2) )
| ~ order(X0)
| ~ ord_less_eq(X0,X1,X2) ),
inference(cnf_transformation,[],[f1841]) ).
tcf(c_825,plain,
zero_neq_one(int),
inference(cnf_transformation,[],[f2083]) ).
tcf(c_832,plain,
order(int),
inference(cnf_transformation,[],[f2090]) ).
tcf(c_894,negated_conjecture,
! [X0: $i,X1: $i] : plus_plus(int,power_power(int,X0,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),power_power(int,X1,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls))))) != plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int)),
inference(cnf_transformation,[],[f2375]) ).
tcf(c_1613,plain,
! [X0: $i] :
( ( ti(X0,one_one(X0)) = one_one(X0) )
| ~ zero_neq_one(X0) ),
inference(prop_impl_just,[status(thm)],[c_55]) ).
tcf(c_1703,plain,
( ( plus_plus(int,power_power(int,sK0,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),power_power(int,sK1,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls))))) = plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int)) )
| ( one_one(int) != t ) ),
inference(prop_impl_just,[status(thm)],[c_133]) ).
tcf(c_1705,plain,
( ( plus_plus(int,power_power(int,sK2,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),power_power(int,sK3,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls))))) = plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int)) )
| ~ ord_less(int,one_one(int),t) ),
inference(prop_impl_just,[status(thm)],[c_134]) ).
tcf(c_3913,plain,
~ ord_less(int,one_one(int),t),
inference(backward_subsumption_resolution,[status(thm)],[c_1705,c_894]) ).
tcf(c_3914,plain,
one_one(int) != t,
inference(backward_subsumption_resolution,[status(thm)],[c_1703,c_894]) ).
tcf(c_6878,plain,
number_number_of(int,t) = t,
inference(demodulation,[status(thm)],[c_131,c_245]) ).
tcf(c_13043,plain,
! [X0: $i] :
( ( ti(X0,one_one(X0)) = one_one(X0) )
| ( X0 != int ) ),
inference(resolution_lifted,[status(thm)],[c_1613,c_825]) ).
tcf(c_13044,plain,
ti(int,one_one(int)) = one_one(int),
inference(unflattening,[status(thm)],[c_13043]) ).
tcf(c_16955,definition,
iPr_def_10 = one_one(int),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_16956,definition,
iPr_def_11 = number_number_of(int,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_16971,plain,
iPr_def_10 != t,
inference(demodulation,[status(thm)],[c_3914]) ).
tcf(c_16972,plain,
~ ord_less(int,iPr_def_10,t),
inference(demodulation,[status(thm)],[c_3913]) ).
tcf(c_40945,plain,
ord_less_eq(int,iPr_def_10,t),
inference(light_normalisation,[status(thm)],[c_132,c_16955]) ).
tcf(c_41119,plain,
ti(int,iPr_def_10) = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_13044,c_16955]) ).
tcf(c_41120,plain,
iPr_def_10 = iPr_def_11,
inference(demodulation,[status(thm)],[c_41119,c_245,c_16956]) ).
tcf(c_41126,plain,
number_number_of(int,iPr_def_10) = iPr_def_10,
inference(demodulation,[status(thm)],[c_16956,c_41120]) ).
tcf(c_54836,plain,
( ord_less(int,iPr_def_10,t)
| ( ti(int,t) = ti(int,iPr_def_10) )
| ~ order(int) ),
inference(superposition,[status(thm)],[c_40945,c_585]) ).
tcf(c_54894,plain,
ti(int,t) = ti(int,iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_54836,c_16972,c_832]) ).
tcf(c_55966,plain,
t = iPr_def_10,
inference(demodulation,[status(thm)],[c_54894,c_245,c_6878,c_41126]) ).
tcf(c_55986,plain,
iPr_def_10 != iPr_def_10,
inference(demodulation,[status(thm)],[c_16971,c_55966]) ).
tcf(c_55987,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_55986]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM926+6 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.34 % Computer : n003.cluster.edu
% 0.10/0.34 % Model : x86_64 x86_64
% 0.10/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.34 % Memory : 8046.5625MB
% 0.10/0.34 % OS : Linux 6.8.0-71-generic
% 0.10/0.34 % CPULimit : 300
% 0.10/0.34 % WCLimit : 300
% 0.10/0.34 % DateTime : Thu Sep 24 05:46:50 UTC 2026
% 0.10/0.34 % CPUTime :
% 0.10/0.34 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.38 Running first-order theorem proving
% 0.14/0.38 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.39
% 0.14/0.39 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.39
% 0.14/0.39 % Detected problem language: tptp
% 0.14/0.41 % Proving...
% 15.76/3.67 % SZS status Started for theBenchmark.p
% 15.76/3.67 % SZS status Theorem for theBenchmark.p
% 15.76/3.67
% 15.76/3.67 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 15.76/3.67
% 15.76/3.67 % ------ iProver source info
% 15.76/3.67
% 15.76/3.67 % git: date: 2026-07-19 20:42:38 +0200
% 15.76/3.67 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 15.76/3.67 % git: non_committed_changes: false
% 15.76/3.67
% 15.76/3.67 % ------ Parsing...
% 15.76/3.67 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 15.76/3.67
% 15.76/3.67 % ------ Preprocessing... sup_sim: 288 sf_s rm: 6 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe:16:0s pe_e %
% 15.76/3.67
% 15.76/3.67 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 15.76/3.67
% 15.76/3.67 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e sf_s rm: 0 0s sf_e sf_s rm: 0 0s sf_e
% 15.76/3.67 % ------ Proving...
% 15.76/3.67 % ------ Problem Properties
% 15.76/3.67
% 15.76/3.67 %
% 15.76/3.67 % clauses 922
% 15.76/3.67 % conjectures 0
% 15.76/3.67 % EPR 49
% 15.76/3.67 % Horn 831
% 15.76/3.67 % unary 372
% 15.76/3.67 % binary 323
% 15.76/3.67 % lits 1772
% 15.76/3.67 % lits eq 633
% 15.76/3.67 % fd_pure 0
% 15.76/3.67 % fd_pseudo 0
% 15.76/3.67 % fd_cond 24
% 15.76/3.67 % fd_pseudo_cond 9
% 15.76/3.67 % AC symbols 0
% 15.76/3.67
% 15.76/3.67 % ------ Schedule dynamic 5 is on
% 15.76/3.67
% 15.76/3.67 % ------ no conjectures: strip conj schedule
% 15.76/3.67
% 15.76/3.67 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 15.76/3.67
% 15.76/3.67
% 15.76/3.67 % ------
% 15.76/3.67 % Current options:
% 15.76/3.67 % ------
% 15.76/3.67
% 15.76/3.67
% 15.76/3.67 %
% 15.76/3.67
% 15.76/3.67 % ------ Proving...
% 15.76/3.67 %
% 15.76/3.67
% 15.76/3.67 % SZS status Theorem for theBenchmark.p
% 15.76/3.67
% 15.76/3.67 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 15.76/3.67
% 15.76/3.67
%------------------------------------------------------------------------------