%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM925+1 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:51:01 PM UTC 2026
% Result : Theorem 0.04s 5.36s
% Output : CNFRefutation 0.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 41 ( 36 unt; 0 def)
% Number of atoms : 53 ( 44 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 : 5 ( 2 avg)
% 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 : 31 ( 2 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fact_85_zadd__0,axiom,
! [X15] : plus_plus_int(zero_zero_int,X15) = X15,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_85_zadd__0) ).
fof(fact_99_Bit1__def,axiom,
! [X19] : bit1(X19) = plus_plus_int(plus_plus_int(one_one_int,X19),X19),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_99_Bit1__def) ).
fof(fact_52_zadd__commute,axiom,
! [X15,X12] : plus_plus_int(X15,X12) = plus_plus_int(X12,X15),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_52_zadd__commute) ).
fof(fact_84_zadd__0__right,axiom,
! [X15] : plus_plus_int(X15,zero_zero_int) = X15,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_84_zadd__0__right) ).
fof(fact_92_power__eq__0__iff__number__of,axiom,
! [X3,X23] :
( 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/sandbox2/benchmark/theBenchmark.p',fact_92_power__eq__0__iff__number__of) ).
fof(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/sandbox2/benchmark/theBenchmark.p',conj_0) ).
fof(fact_78_Pls__def,axiom,
pls = zero_zero_int,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_78_Pls__def) ).
fof(fact_83_Bit0__def,axiom,
! [X19] : bit0(X19) = plus_plus_int(X19,X19),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_83_Bit0__def) ).
fof(fact_62_bin__less__0__simps_I1_J,axiom,
~ ord_less_int(pls,zero_zero_int),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_62_bin__less__0__simps_I1_J) ).
fof(fact_0_n1pos,axiom,
ord_less_int(zero_zero_int,plus_plus_int(one_one_int,semiri1621563631at_int(n))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_n1pos) ).
fof(c_0_10,plain,
! [X49] : plus_plus_int(zero_zero_int,X49) = X49,
inference(variable_rename,[status(thm)],[fact_85_zadd__0]) ).
fof(c_0_11,plain,
! [X133] : bit1(X133) = plus_plus_int(plus_plus_int(one_one_int,X133),X133),
inference(variable_rename,[status(thm)],[fact_99_Bit1__def]) ).
fof(c_0_12,plain,
! [X111,X112] : plus_plus_int(X111,X112) = plus_plus_int(X112,X111),
inference(variable_rename,[status(thm)],[fact_52_zadd__commute]) ).
fof(c_0_13,plain,
! [X48] : plus_plus_int(X48,zero_zero_int) = X48,
inference(variable_rename,[status(thm)],[fact_84_zadd__0__right]) ).
fof(c_0_14,plain,
! [X3,X23] :
( 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]) ).
fof(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(assume_negation,[status(cth)],[conj_0]) ).
cnf(c_0_16,plain,
plus_plus_int(zero_zero_int,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
pls = zero_zero_int,
inference(split_conjunct,[status(thm)],[fact_78_Pls__def]) ).
cnf(c_0_18,plain,
bit1(X1) = plus_plus_int(plus_plus_int(one_one_int,X1),X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
plus_plus_int(X1,X2) = plus_plus_int(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
plus_plus_int(X1,zero_zero_int) = X1,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_21,plain,
! [X56,X57] :
( ( power_power_int(X56,number_number_of_nat(X57)) = zero_zero_int
| number_number_of_nat(X57) = zero_zero_nat
| X56 != zero_zero_int )
& ( power_power_int(X56,number_number_of_nat(X57)) != zero_zero_int
| number_number_of_nat(X57) != zero_zero_nat )
& ( power_power_int(X56,number_number_of_nat(X57)) != zero_zero_int
| X56 = zero_zero_int ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
fof(c_0_22,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_15]) ).
cnf(c_0_23,plain,
plus_plus_int(pls,X1) = X1,
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,plain,
plus_plus_int(X1,plus_plus_int(one_one_int,X1)) = bit1(X1),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
plus_plus_int(X1,pls) = X1,
inference(rw,[status(thm)],[c_0_20,c_0_17]) ).
fof(c_0_26,plain,
! [X84] : bit0(X84) = plus_plus_int(X84,X84),
inference(variable_rename,[status(thm)],[fact_83_Bit0__def]) ).
fof(c_0_27,plain,
~ ord_less_int(pls,zero_zero_int),
inference(fof_simplification,[status(thm)],[fact_62_bin__less__0__simps_I1_J]) ).
cnf(c_0_28,plain,
( power_power_int(X1,number_number_of_nat(X2)) != zero_zero_int
| X1 = zero_zero_int ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,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_22]) ).
cnf(c_0_30,plain,
bit1(pls) = one_one_int,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_31,plain,
bit0(X1) = plus_plus_int(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_32,plain,
~ ord_less_int(pls,zero_zero_int),
inference(fof_nnf,[status(thm)],[c_0_27]) ).
cnf(c_0_33,plain,
ord_less_int(zero_zero_int,plus_plus_int(one_one_int,semiri1621563631at_int(n))),
inference(split_conjunct,[status(thm)],[fact_0_n1pos]) ).
cnf(c_0_34,plain,
( power_power_int(X1,number_number_of_nat(X2)) != pls
| X1 = pls ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_17]),c_0_17]) ).
cnf(c_0_35,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)],[c_0_29,c_0_30]),c_0_31]),c_0_17]) ).
cnf(c_0_36,plain,
~ ord_less_int(pls,zero_zero_int),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_37,plain,
ord_less_int(pls,plus_plus_int(one_one_int,semiri1621563631at_int(n))),
inference(rw,[status(thm)],[c_0_33,c_0_17]) ).
cnf(c_0_38,negated_conjecture,
plus_plus_int(one_one_int,semiri1621563631at_int(n)) = pls,
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
~ ord_less_int(pls,pls),
inference(rw,[status(thm)],[c_0_36,c_0_17]) ).
cnf(c_0_40,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : NUM925+1 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/5.31 % Computer : n012.cluster.edu
% 0.04/5.31 % Model : x86_64 x86_64
% 0.04/5.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/5.31 % Memory : 8046.5625MB
% 0.04/5.31 % OS : Linux 6.8.0-71-generic
% 0.04/5.31 % CPULimit : 300
% 0.04/5.31 % WCLimit : 300
% 0.04/5.31 % DateTime : Mon Sep 21 03:17:28 UTC 2026
% 0.04/5.31 % CPUTime :
% 0.04/5.31 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/5.33 Running first-order theorem proving
% 0.04/5.33 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.04/5.36 % Version: 3.5.1
% 0.04/5.36 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.04/5.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/5.36 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.04/5.36 % Starting new_bool_3 with 300s (1) cores
% 0.04/5.36 % Starting new_bool_1 with 300s (1) cores
% 0.04/5.36 % Starting sh5l with 300s (1) cores
% 0.04/5.36 % new_bool_3 with pid 1448506 completed with status 0
% 0.04/5.36 % Result found by new_bool_3
% 0.04/5.36 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.04/5.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/5.36 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.04/5.36 % Starting new_bool_3 with 300s (1) cores
% 0.04/5.36 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.04/5.36 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.04/5.36 % Search class: FGHSM-FFMM21-MFFFFFNN
% 0.04/5.36 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.04/5.36 % Starting SubtermCWHack with 31s (1) cores
% 0.04/5.36 % SubtermCWHack with pid 1448509 completed with status 0
% 0.04/5.36 % Result found by SubtermCWHack
% 0.04/5.36 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.04/5.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/5.36 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.04/5.36 % Starting new_bool_3 with 300s (1) cores
% 0.04/5.36 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.04/5.36 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.04/5.36 % Search class: FGHSM-FFMM21-MFFFFFNN
% 0.04/5.36 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.04/5.36 % Starting SubtermCWHack with 31s (1) cores
% 0.04/5.36 % Preprocessing time : 0.001 s
% 0.04/5.36
% 0.04/5.36 % Proof found!
% 0.04/5.36 % SZS status Theorem
% 0.04/5.36 % SZS output start CNFRefutation
% See solution above
% 0.04/5.36 % Parsed axioms : 107
% 0.04/5.36 % Removed by relevancy pruning/SinE : 17
% 0.04/5.36 % Initial clauses : 130
% 0.04/5.36 % Removed in clause preprocessing : 8
% 0.04/5.36 % Initial clauses in saturation : 122
% 0.04/5.36 % Processed clauses : 266
% 0.04/5.36 % ...of these trivial : 18
% 0.04/5.36 % ...subsumed : 123
% 0.04/5.36 % ...remaining for further processing : 125
% 0.04/5.36 % Other redundant clauses eliminated : 7
% 0.04/5.36 % Clauses deleted for lack of memory : 0
% 0.04/5.36 % Backward-subsumed : 1
% 0.04/5.36 % Backward-rewritten : 10
% 0.04/5.36 % Generated clauses : 474
% 0.04/5.36 % ...of the previous two non-redundant : 329
% 0.04/5.36 % ...aggressively subsumed : 0
% 0.04/5.36 % Contextual simplify-reflections : 0
% 0.04/5.36 % Paramodulations : 461
% 0.04/5.36 % Factorizations : 2
% 0.04/5.36 % NegExts : 0
% 0.04/5.36 % Equation resolutions : 11
% 0.04/5.36 % Disequality decompositions : 0
% 0.04/5.36 % Total rewrite steps : 263
% 0.04/5.36 % ...of those cached : 214
% 0.04/5.36 % Propositional unsat checks : 0
% 0.04/5.36 % Propositional check models : 0
% 0.04/5.36 % Propositional check unsatisfiable : 0
% 0.04/5.36 % Propositional clauses : 0
% 0.04/5.36 % Propositional clauses after purity: 0
% 0.04/5.36 % Propositional unsat core size : 0
% 0.04/5.36 % Propositional preprocessing time : 0.000
% 0.04/5.36 % Propositional encoding time : 0.000
% 0.04/5.36 % Propositional solver time : 0.000
% 0.04/5.36 % Success case prop preproc time : 0.000
% 0.04/5.36 % Success case prop encoding time : 0.000
% 0.04/5.36 % Success case prop solver time : 0.000
% 0.04/5.36 % Current number of processed clauses : 107
% 0.04/5.36 % Positive orientable unit clauses : 29
% 0.04/5.36 % Positive unorientable unit clauses: 2
% 0.04/5.36 % Negative unit clauses : 19
% 0.04/5.36 % Non-unit-clauses : 57
% 0.04/5.36 % Current number of unprocessed clauses: 183
% 0.04/5.36 % ...number of literals in the above : 343
% 0.04/5.36 % Current number of archived formulas : 0
% 0.04/5.36 % Current number of archived clauses : 11
% 0.04/5.36 % Clause-clause subsumption calls (NU) : 766
% 0.04/5.36 % Rec. Clause-clause subsumption calls : 701
% 0.04/5.36 % Non-unit clause-clause subsumptions : 47
% 0.04/5.36 % Unit Clause-clause subsumption calls : 383
% 0.04/5.36 % Rewrite failures with RHS unbound : 0
% 0.04/5.36 % BW rewrite match attempts : 19
% 0.04/5.36 % BW rewrite match successes : 16
% 0.04/5.36 % Condensation attempts : 0
% 0.04/5.36 % Condensation successes : 0
% 0.04/5.36 % Termbank termtop insertions : 10047
% 0.04/5.36 % Search garbage collected termcells : 900
% 0.04/5.36
% 0.04/5.36 % -------------------------------------------------
% 0.04/5.36 % User time : 0.009 s
% 0.04/5.36 % System time : 0.002 s
% 0.04/5.36 % Total time : 0.011 s
% 0.04/5.36 % Maximum resident set size: 3992 pages
% 0.04/5.36
% 0.04/5.36 % -------------------------------------------------
% 0.04/5.36 % User time : 0.010 s
% 0.04/5.36 % System time : 0.005 s
% 0.04/5.36 % Total time : 0.015 s
% 0.04/5.36 % Maximum resident set size: 4864 pages
% 0.04/5.36 % E exiting
%------------------------------------------------------------------------------