%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM925+1 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 09:37:46 EDT 2022
% Result : Theorem 0.24s 1.40s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 29 ( 26 unt; 0 def)
% Number of atoms : 38 ( 31 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 22 ( 13 ~; 5 |; 3 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 2 avg)
% Maximal term depth : 6 ( 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 : 17 ( 3 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',conj_0) ).
fof(fact_83_Bit0__def,axiom,
! [X19] : bit0(X19) = plus_plus_int(X19,X19),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_83_Bit0__def) ).
fof(fact_99_Bit1__def,axiom,
! [X19] : bit1(X19) = plus_plus_int(plus_plus_int(one_one_int,X19),X19),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_99_Bit1__def) ).
fof(fact_78_Pls__def,axiom,
pls = zero_zero_int,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_78_Pls__def) ).
fof(fact_84_zadd__0__right,axiom,
! [X15] : plus_plus_int(X15,zero_zero_int) = X15,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',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
<=> ( X3 = zero_zero_int
& number_number_of_nat(X23) != zero_zero_nat ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_92_power__eq__0__iff__number__of) ).
fof(fact_62_bin__less__0__simps_I1_J,axiom,
~ ord_less_int(pls,zero_zero_int),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_0_n1pos) ).
fof(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]) ).
fof(c_0_9,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]) ).
fof(c_0_10,plain,
! [X20] : bit0(X20) = plus_plus_int(X20,X20),
inference(variable_rename,[status(thm)],[fact_83_Bit0__def]) ).
fof(c_0_11,plain,
! [X20] : bit1(X20) = plus_plus_int(plus_plus_int(one_one_int,X20),X20),
inference(variable_rename,[status(thm)],[fact_99_Bit1__def]) ).
cnf(c_0_12,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_9]) ).
cnf(c_0_13,plain,
bit0(X1) = plus_plus_int(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,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_15,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_12,c_0_13]),c_0_14]),c_0_14]) ).
cnf(c_0_16,plain,
pls = zero_zero_int,
inference(split_conjunct,[status(thm)],[fact_78_Pls__def]) ).
fof(c_0_17,plain,
! [X16] : plus_plus_int(X16,zero_zero_int) = X16,
inference(variable_rename,[status(thm)],[fact_84_zadd__0__right]) ).
fof(c_0_18,plain,
! [X24,X25,X24,X25] :
( ( X24 = zero_zero_int
| power_power_int(X24,number_number_of_nat(X25)) != zero_zero_int )
& ( number_number_of_nat(X25) != zero_zero_nat
| power_power_int(X24,number_number_of_nat(X25)) != zero_zero_int )
& ( X24 != zero_zero_int
| number_number_of_nat(X25) = zero_zero_nat
| power_power_int(X24,number_number_of_nat(X25)) = zero_zero_int ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_92_power__eq__0__iff__number__of])])])])]) ).
cnf(c_0_19,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,zero_zero_int),zero_zero_int),plus_plus_int(plus_plus_int(one_one_int,zero_zero_int),zero_zero_int)))) = zero_zero_int,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_16]),c_0_16]),c_0_16]) ).
cnf(c_0_20,plain,
plus_plus_int(X1,zero_zero_int) = X1,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_21,plain,
~ ord_less_int(pls,zero_zero_int),
inference(fof_simplification,[status(thm)],[fact_62_bin__less__0__simps_I1_J]) ).
cnf(c_0_22,plain,
( X1 = zero_zero_int
| power_power_int(X1,number_number_of_nat(X2)) != zero_zero_int ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,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))) = zero_zero_int,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_20]),c_0_20]),c_0_20]) ).
cnf(c_0_24,plain,
~ ord_less_int(pls,zero_zero_int),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(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]) ).
cnf(c_0_26,negated_conjecture,
plus_plus_int(one_one_int,semiri1621563631at_int(n)) = zero_zero_int,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
~ ord_less_int(zero_zero_int,zero_zero_int),
inference(rw,[status(thm)],[c_0_24,c_0_16]) ).
cnf(c_0_28,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : NUM925+1 : TPTP v8.1.0. Released v5.3.0.
% 0.07/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jul 5 07:01:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.24/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.40 # Preprocessing time : 0.020 s
% 0.24/1.40
% 0.24/1.40 # Proof found!
% 0.24/1.40 # SZS status Theorem
% 0.24/1.40 # SZS output start CNFRefutation
% See solution above
% 0.24/1.40 # Proof object total steps : 29
% 0.24/1.40 # Proof object clause steps : 14
% 0.24/1.40 # Proof object formula steps : 15
% 0.24/1.40 # Proof object conjectures : 8
% 0.24/1.40 # Proof object clause conjectures : 5
% 0.24/1.40 # Proof object formula conjectures : 3
% 0.24/1.40 # Proof object initial clauses used : 8
% 0.24/1.40 # Proof object initial formulas used : 8
% 0.24/1.40 # Proof object generating inferences : 1
% 0.24/1.40 # Proof object simplifying inferences : 14
% 0.24/1.40 # Training examples: 0 positive, 0 negative
% 0.24/1.40 # Parsed axioms : 107
% 0.24/1.40 # Removed by relevancy pruning/SinE : 17
% 0.24/1.40 # Initial clauses : 130
% 0.24/1.40 # Removed in clause preprocessing : 10
% 0.24/1.40 # Initial clauses in saturation : 120
% 0.24/1.40 # Processed clauses : 138
% 0.24/1.40 # ...of these trivial : 17
% 0.24/1.40 # ...subsumed : 33
% 0.24/1.40 # ...remaining for further processing : 88
% 0.24/1.40 # Other redundant clauses eliminated : 1
% 0.24/1.40 # Clauses deleted for lack of memory : 0
% 0.24/1.40 # Backward-subsumed : 0
% 0.24/1.40 # Backward-rewritten : 11
% 0.24/1.40 # Generated clauses : 730
% 0.24/1.40 # ...of the previous two non-trivial : 593
% 0.24/1.40 # Contextual simplify-reflections : 0
% 0.24/1.40 # Paramodulations : 723
% 0.24/1.40 # Factorizations : 2
% 0.24/1.40 # Equation resolutions : 5
% 0.24/1.40 # Current number of processed clauses : 76
% 0.24/1.40 # Positive orientable unit clauses : 16
% 0.24/1.40 # Positive unorientable unit clauses: 2
% 0.24/1.40 # Negative unit clauses : 9
% 0.24/1.40 # Non-unit-clauses : 49
% 0.24/1.40 # Current number of unprocessed clauses: 539
% 0.24/1.40 # ...number of literals in the above : 1149
% 0.24/1.40 # Current number of archived formulas : 0
% 0.24/1.40 # Current number of archived clauses : 13
% 0.24/1.40 # Clause-clause subsumption calls (NU) : 360
% 0.24/1.40 # Rec. Clause-clause subsumption calls : 356
% 0.24/1.40 # Non-unit clause-clause subsumptions : 21
% 0.24/1.40 # Unit Clause-clause subsumption calls : 40
% 0.24/1.40 # Rewrite failures with RHS unbound : 0
% 0.24/1.40 # BW rewrite match attempts : 29
% 0.24/1.40 # BW rewrite match successes : 29
% 0.24/1.40 # Condensation attempts : 0
% 0.24/1.40 # Condensation successes : 0
% 0.24/1.40 # Termbank termtop insertions : 13879
% 0.24/1.40
% 0.24/1.40 # -------------------------------------------------
% 0.24/1.40 # User time : 0.033 s
% 0.24/1.40 # System time : 0.000 s
% 0.24/1.40 # Total time : 0.033 s
% 0.24/1.40 # Maximum resident set size: 3536 pages
%------------------------------------------------------------------------------