%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM925_1 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.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 : Thu Sep 24 01:56:56 PM UTC 2026
% Result : Theorem 0.10s 0.44s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 33 ( 28 unt; 0 typ; 0 def)
% Number of atoms : 45 ( 36 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 28 ( 16 ~; 6 |; 4 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn 20 !; 0 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
int: $tType ).
tff(decl_sort2,type,
nat: $tType ).
tff(decl_23,type,
one_one_int: int ).
tff(decl_25,type,
plus_plus_int: ( int * int ) > int ).
tff(decl_27,type,
zero_zero_int: int ).
tff(decl_28,type,
zero_zero_nat: nat ).
tff(decl_29,type,
bit0: int > int ).
tff(decl_30,type,
bit1: int > int ).
tff(decl_31,type,
pls: int ).
tff(decl_33,type,
number_number_of_nat: int > nat ).
tff(decl_34,type,
semiri1621563631at_int: nat > int ).
tff(decl_36,type,
ord_less_int: ( int * int ) > $o ).
tff(decl_38,type,
power_power_int: ( nat * int ) > int ).
tff(decl_40,type,
n: nat ).
tff(conj_0,conjecture,
power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(bit0(bit1(pls)))) != zero_zero_int,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(fact_92_power__eq__0__iff__number__of,axiom,
! [X3: int,X23: int] :
( ( power_power_int(X3,number_number_of_nat(X23)) = zero_zero_int )
<=> ( ( number_number_of_nat(X23) != zero_zero_nat )
& ( X3 = zero_zero_int ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_92_power__eq__0__iff__number__of) ).
tff(fact_83_Bit0__def,axiom,
! [X19: int] : ( bit0(X19) = plus_plus_int(X19,X19) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_83_Bit0__def) ).
tff(fact_99_Bit1__def,axiom,
! [X19: int] : ( bit1(X19) = plus_plus_int(plus_plus_int(one_one_int,X19),X19) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_99_Bit1__def) ).
tff(fact_84_zadd__0__right,axiom,
! [X15: int] : ( plus_plus_int(X15,zero_zero_int) = X15 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_84_zadd__0__right) ).
tff(fact_78_Pls__def,axiom,
pls = zero_zero_int,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_78_Pls__def) ).
tff(fact_62_bin__less__0__simps_I1_J,axiom,
~ ord_less_int(pls,zero_zero_int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_62_bin__less__0__simps_I1_J) ).
tff(fact_0_n1pos,axiom,
ord_less_int(zero_zero_int,plus_plus_int(one_one_int,semiri1621563631at_int(n))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_n1pos) ).
tff(c_0_8,negated_conjecture,
~ ( ( power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(bit0(bit1(pls)))) != zero_zero_int ) ),
inference(assume_negation,[status(cth)],[conj_0]) ).
tff(c_0_9,plain,
! [X3: int,X23: int] :
( ( power_power_int(X3,number_number_of_nat(X23)) = zero_zero_int )
<=> ( ( number_number_of_nat(X23) != zero_zero_nat )
& ( X3 = zero_zero_int ) ) ),
inference(fof_simplification,[status(thm)],[fact_92_power__eq__0__iff__number__of]) ).
tff(c_0_10,negated_conjecture,
power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(bit0(bit1(pls)))) = zero_zero_int,
inference(fof_simplification,[status(thm)],[c_0_8]) ).
tff(c_0_11,plain,
! [X134: int] : ( bit0(X134) = plus_plus_int(X134,X134) ),
inference(variable_rename,[status(thm)],[fact_83_Bit0__def]) ).
tff(c_0_12,plain,
! [X154: int] : ( bit1(X154) = plus_plus_int(plus_plus_int(one_one_int,X154),X154) ),
inference(variable_rename,[status(thm)],[fact_99_Bit1__def]) ).
tff(c_0_13,plain,
! [X135: int] : ( plus_plus_int(X135,zero_zero_int) = X135 ),
inference(variable_rename,[status(thm)],[fact_84_zadd__0__right]) ).
tff(c_0_14,plain,
! [X139: int,X140: int] :
( ( ( power_power_int(X139,number_number_of_nat(X140)) = zero_zero_int )
| ( number_number_of_nat(X140) = zero_zero_nat )
| ( X139 != zero_zero_int ) )
& ( ( power_power_int(X139,number_number_of_nat(X140)) != zero_zero_int )
| ( number_number_of_nat(X140) != zero_zero_nat ) )
& ( ( power_power_int(X139,number_number_of_nat(X140)) != zero_zero_int )
| ( X139 = zero_zero_int ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
tcf(c_0_15,negated_conjecture,
power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(bit0(bit1(pls)))) = zero_zero_int,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tcf(c_0_16,plain,
! [X1: int] : bit0(X1) = plus_plus_int(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tcf(c_0_17,plain,
! [X1: int] : bit1(X1) = plus_plus_int(plus_plus_int(one_one_int,X1),X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
tcf(c_0_18,plain,
! [X1: int] : plus_plus_int(X1,zero_zero_int) = X1,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tcf(c_0_19,plain,
pls = zero_zero_int,
inference(split_conjunct,[status(thm)],[fact_78_Pls__def]) ).
tff(c_0_20,plain,
~ ord_less_int(pls,zero_zero_int),
inference(fof_simplification,[status(thm)],[fact_62_bin__less__0__simps_I1_J]) ).
tcf(c_0_21,plain,
! [X1: int,X2: int] :
( ( power_power_int(X1,number_number_of_nat(X2)) != zero_zero_int )
| ( X1 = zero_zero_int ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
tcf(c_0_22,negated_conjecture,
power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),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)))) = zero_zero_int,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_17]) ).
tcf(c_0_23,plain,
! [X1: int] : plus_plus_int(X1,pls) = X1,
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
tff(c_0_24,plain,
~ ord_less_int(pls,zero_zero_int),
inference(fof_nnf,[status(thm)],[c_0_20]) ).
tcf(c_0_25,plain,
ord_less_int(zero_zero_int,plus_plus_int(one_one_int,semiri1621563631at_int(n))),
inference(split_conjunct,[status(thm)],[fact_0_n1pos]) ).
tcf(c_0_26,plain,
! [X1: int,X2: int] :
( ( power_power_int(X1,number_number_of_nat(X2)) != pls )
| ( X1 = pls ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_19]),c_0_19]) ).
tcf(c_0_27,negated_conjecture,
power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(plus_plus_int(one_one_int,one_one_int))) = pls,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_23]),c_0_23]),c_0_23]),c_0_19]) ).
tcf(c_0_28,plain,
~ ord_less_int(pls,zero_zero_int),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
tcf(c_0_29,plain,
ord_less_int(pls,plus_plus_int(one_one_int,semiri1621563631at_int(n))),
inference(rw,[status(thm)],[c_0_25,c_0_19]) ).
tcf(c_0_30,negated_conjecture,
plus_plus_int(one_one_int,semiri1621563631at_int(n)) = pls,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
tcf(c_0_31,plain,
~ ord_less_int(pls,pls),
inference(rw,[status(thm)],[c_0_28,c_0_19]) ).
cnf(c_0_32,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM925_1 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n006.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.36 % DateTime : Mon Sep 21 03:17:27 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.44 % Version: 3.5.1
% 0.10/0.44 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.44 % Starting sh5l with 300s (1) cores
% 0.10/0.44 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1890600 completed with status 0
% 0.10/0.44 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.10/0.44 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.10/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.44 % No SInE strategy applied
% 0.10/0.44 % Search class: FGHSM-FFLM21-DFFFFFNN
% 0.10/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 169s (1) cores
% 0.10/0.44 % Starting new_bool_3 with 169s (1) cores
% 0.10/0.44 % Starting new_bool_1 with 169s (1) cores
% 0.10/0.44 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 1890609 completed with status 0
% 0.10/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.10/0.44 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.10/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.44 % No SInE strategy applied
% 0.10/0.44 % Search class: FGHSM-FFLM21-DFFFFFNN
% 0.10/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 169s (1) cores
% 0.10/0.44 % Preprocessing time : 0.002 s
% 0.10/0.44 % Presaturation interreduction done
% 0.10/0.44
% 0.10/0.44 % Proof found!
% 0.10/0.44 % SZS status Theorem
% 0.10/0.44 % SZS output start CNFRefutation
% See solution above
% 0.10/0.44 % Parsed axioms : 128
% 0.10/0.44 % Removed by relevancy pruning/SinE : 0
% 0.10/0.44 % Initial clauses : 173
% 0.10/0.44 % Removed in clause preprocessing : 32
% 0.10/0.44 % Initial clauses in saturation : 141
% 0.10/0.44 % Processed clauses : 288
% 0.10/0.44 % ...of these trivial : 21
% 0.10/0.44 % ...subsumed : 87
% 0.10/0.44 % ...remaining for further processing : 180
% 0.10/0.44 % Other redundant clauses eliminated : 13
% 0.10/0.44 % Clauses deleted for lack of memory : 0
% 0.10/0.44 % Backward-subsumed : 5
% 0.10/0.44 % Backward-rewritten : 8
% 0.10/0.44 % Generated clauses : 209
% 0.10/0.44 % ...of the previous two non-redundant : 173
% 0.10/0.44 % ...aggressively subsumed : 0
% 0.10/0.44 % Contextual simplify-reflections : 0
% 0.10/0.44 % Paramodulations : 196
% 0.10/0.44 % Factorizations : 0
% 0.10/0.44 % NegExts : 0
% 0.10/0.44 % Equation resolutions : 15
% 0.10/0.44 % Disequality decompositions : 0
% 0.10/0.44 % Total rewrite steps : 343
% 0.10/0.44 % ...of those cached : 290
% 0.10/0.44 % Propositional unsat checks : 0
% 0.10/0.44 % Propositional check models : 0
% 0.10/0.44 % Propositional check unsatisfiable : 0
% 0.10/0.44 % Propositional clauses : 0
% 0.10/0.44 % Propositional clauses after purity: 0
% 0.10/0.44 % Propositional unsat core size : 0
% 0.10/0.44 % Propositional preprocessing time : 0.000
% 0.10/0.44 % Propositional encoding time : 0.000
% 0.10/0.44 % Propositional solver time : 0.000
% 0.10/0.44 % Success case prop preproc time : 0.000
% 0.10/0.44 % Success case prop encoding time : 0.000
% 0.10/0.44 % Success case prop solver time : 0.000
% 0.10/0.44 % Current number of processed clauses : 71
% 0.10/0.44 % Positive orientable unit clauses : 28
% 0.10/0.44 % Positive unorientable unit clauses: 0
% 0.10/0.44 % Negative unit clauses : 26
% 0.10/0.44 % Non-unit-clauses : 17
% 0.10/0.44 % Current number of unprocessed clauses: 109
% 0.10/0.44 % ...number of literals in the above : 187
% 0.10/0.44 % Current number of archived formulas : 0
% 0.10/0.44 % Current number of archived clauses : 101
% 0.10/0.44 % Clause-clause subsumption calls (NU) : 761
% 0.10/0.44 % Rec. Clause-clause subsumption calls : 705
% 0.10/0.44 % Non-unit clause-clause subsumptions : 31
% 0.10/0.44 % Unit Clause-clause subsumption calls : 121
% 0.10/0.44 % Rewrite failures with RHS unbound : 0
% 0.10/0.44 % BW rewrite match attempts : 27
% 0.10/0.44 % BW rewrite match successes : 27
% 0.10/0.44 % Condensation attempts : 0
% 0.10/0.44 % Condensation successes : 0
% 0.10/0.44 % Termbank termtop insertions : 10313
% 0.10/0.44 % Search garbage collected termcells : 894
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.012 s
% 0.10/0.44 % System time : 0.005 s
% 0.10/0.44 % Total time : 0.017 s
% 0.10/0.44 % Maximum resident set size: 4004 pages
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.045 s
% 0.10/0.44 % System time : 0.016 s
% 0.10/0.44 % Total time : 0.061 s
% 0.10/0.44 % Maximum resident set size: 4608 pages
% 0.10/0.44 % E exiting
%------------------------------------------------------------------------------