%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM344+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n020.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:31:44 EDT 2022
% Result : Theorem 0.27s 1.44s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of formulae : 30 ( 13 unt; 0 def)
% Number of atoms : 71 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 75 ( 34 ~; 30 |; 8 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 65 ( 0 sgn 32 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(less_entry_point_pos_pos,axiom,
! [X1,X2,X10,X11] :
( ( rdn_translate(X1,rdn_pos(X10))
& rdn_translate(X2,rdn_pos(X11))
& rdn_positive_less(X10,X11) )
=> less(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',less_entry_point_pos_pos) ).
fof(add_digit_digit_digit,axiom,
! [X21,X22,X23,X24,X25] :
( ( rdn_digit_add(rdnn(X22),rdnn(X23),rdnn(X25),rdnn(n0))
& rdn_digit_add(rdnn(X25),rdnn(X21),rdnn(X24),rdnn(n0)) )
=> rdn_add_with_carry(rdnn(X21),rdnn(X22),rdnn(X23),rdnn(X24)) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',add_digit_digit_digit) ).
fof(exist_bigger_plus_one,conjecture,
? [X1,X2] :
( sum(X1,n1,X2)
& less(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',exist_bigger_plus_one) ).
fof(rdn2,axiom,
rdn_translate(n2,rdn_pos(rdnn(n2))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn2) ).
fof(sum_entry_point_pos_pos,axiom,
! [X1,X2,X3,X10,X11,X12] :
( ( rdn_translate(X1,rdn_pos(X10))
& rdn_translate(X2,rdn_pos(X11))
& rdn_add_with_carry(rdnn(n0),X10,X11,X12)
& rdn_translate(X3,rdn_pos(X12)) )
=> sum(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',sum_entry_point_pos_pos) ).
fof(rdn_digit_add_n2_n0_n2_n0,axiom,
rdn_digit_add(rdnn(n2),rdnn(n0),rdnn(n2),rdnn(n0)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',rdn_digit_add_n2_n0_n2_n0) ).
fof(rdn1,axiom,
rdn_translate(n1,rdn_pos(rdnn(n1))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn1) ).
fof(rdn_positive_less12,axiom,
rdn_positive_less(rdnn(n1),rdnn(n2)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_positive_less12) ).
fof(rdn_digit_add_n1_n1_n2_n0,axiom,
rdn_digit_add(rdnn(n1),rdnn(n1),rdnn(n2),rdnn(n0)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',rdn_digit_add_n1_n1_n2_n0) ).
fof(c_0_9,plain,
! [X12,X13,X14,X15] :
( ~ rdn_translate(X12,rdn_pos(X14))
| ~ rdn_translate(X13,rdn_pos(X15))
| ~ rdn_positive_less(X14,X15)
| less(X12,X13) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_entry_point_pos_pos])])])]) ).
fof(c_0_10,plain,
! [X26,X27,X28,X29,X30] :
( ~ rdn_digit_add(rdnn(X27),rdnn(X28),rdnn(X30),rdnn(n0))
| ~ rdn_digit_add(rdnn(X30),rdnn(X26),rdnn(X29),rdnn(n0))
| rdn_add_with_carry(rdnn(X26),rdnn(X27),rdnn(X28),rdnn(X29)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[add_digit_digit_digit])])])]) ).
fof(c_0_11,negated_conjecture,
~ ? [X1,X2] :
( sum(X1,n1,X2)
& less(X1,X2) ),
inference(assume_negation,[status(cth)],[exist_bigger_plus_one]) ).
cnf(c_0_12,plain,
( less(X1,X2)
| ~ rdn_positive_less(X3,X4)
| ~ rdn_translate(X2,rdn_pos(X4))
| ~ rdn_translate(X1,rdn_pos(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
inference(split_conjunct,[status(thm)],[rdn2]) ).
fof(c_0_14,plain,
! [X13,X14,X15,X16,X17,X18] :
( ~ rdn_translate(X13,rdn_pos(X16))
| ~ rdn_translate(X14,rdn_pos(X17))
| ~ rdn_add_with_carry(rdnn(n0),X16,X17,X18)
| ~ rdn_translate(X15,rdn_pos(X18))
| sum(X13,X14,X15) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sum_entry_point_pos_pos])])])]) ).
cnf(c_0_15,plain,
( rdn_add_with_carry(rdnn(X1),rdnn(X2),rdnn(X3),rdnn(X4))
| ~ rdn_digit_add(rdnn(X5),rdnn(X1),rdnn(X4),rdnn(n0))
| ~ rdn_digit_add(rdnn(X2),rdnn(X3),rdnn(X5),rdnn(n0)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
rdn_digit_add(rdnn(n2),rdnn(n0),rdnn(n2),rdnn(n0)),
inference(split_conjunct,[status(thm)],[rdn_digit_add_n2_n0_n2_n0]) ).
fof(c_0_17,negated_conjecture,
! [X3,X4] :
( ~ sum(X3,n1,X4)
| ~ less(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])]) ).
cnf(c_0_18,plain,
( less(X1,n2)
| ~ rdn_positive_less(X2,rdnn(n2))
| ~ rdn_translate(X1,rdn_pos(X2)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
rdn_translate(n1,rdn_pos(rdnn(n1))),
inference(split_conjunct,[status(thm)],[rdn1]) ).
cnf(c_0_20,plain,
rdn_positive_less(rdnn(n1),rdnn(n2)),
inference(split_conjunct,[status(thm)],[rdn_positive_less12]) ).
cnf(c_0_21,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X3,rdn_pos(X4))
| ~ rdn_add_with_carry(rdnn(n0),X5,X6,X4)
| ~ rdn_translate(X2,rdn_pos(X6))
| ~ rdn_translate(X1,rdn_pos(X5)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( rdn_add_with_carry(rdnn(n0),rdnn(X1),rdnn(X2),rdnn(n2))
| ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(n2),rdnn(n0)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,negated_conjecture,
( ~ less(X1,X2)
| ~ sum(X1,n1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
less(n1,n2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_25,plain,
( sum(X1,X2,X3)
| ~ rdn_digit_add(rdnn(X4),rdnn(X5),rdnn(n2),rdnn(n0))
| ~ rdn_translate(X3,rdn_pos(rdnn(n2)))
| ~ rdn_translate(X2,rdn_pos(rdnn(X5)))
| ~ rdn_translate(X1,rdn_pos(rdnn(X4))) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
rdn_digit_add(rdnn(n1),rdnn(n1),rdnn(n2),rdnn(n0)),
inference(split_conjunct,[status(thm)],[rdn_digit_add_n1_n1_n2_n0]) ).
cnf(c_0_27,negated_conjecture,
~ sum(n1,n1,n2),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X3,rdn_pos(rdnn(n2)))
| ~ rdn_translate(X2,rdn_pos(rdnn(n1)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n1))) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_13]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM344+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jul 5 11:36:44 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.27/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.27/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.27/1.44 # Preprocessing time : 0.023 s
% 0.27/1.44
% 0.27/1.44 # Proof found!
% 0.27/1.44 # SZS status Theorem
% 0.27/1.44 # SZS output start CNFRefutation
% See solution above
% 0.27/1.44 # Proof object total steps : 30
% 0.27/1.44 # Proof object clause steps : 16
% 0.27/1.44 # Proof object formula steps : 14
% 0.27/1.44 # Proof object conjectures : 6
% 0.27/1.44 # Proof object clause conjectures : 3
% 0.27/1.44 # Proof object formula conjectures : 3
% 0.27/1.44 # Proof object initial clauses used : 9
% 0.27/1.44 # Proof object initial formulas used : 9
% 0.27/1.44 # Proof object generating inferences : 7
% 0.27/1.44 # Proof object simplifying inferences : 5
% 0.27/1.44 # Training examples: 0 positive, 0 negative
% 0.27/1.44 # Parsed axioms : 402
% 0.27/1.44 # Removed by relevancy pruning/SinE : 301
% 0.27/1.44 # Initial clauses : 103
% 0.27/1.44 # Removed in clause preprocessing : 0
% 0.27/1.44 # Initial clauses in saturation : 103
% 0.27/1.44 # Processed clauses : 492
% 0.27/1.44 # ...of these trivial : 3
% 0.27/1.44 # ...subsumed : 117
% 0.27/1.44 # ...remaining for further processing : 372
% 0.27/1.44 # Other redundant clauses eliminated : 1
% 0.27/1.44 # Clauses deleted for lack of memory : 0
% 0.27/1.44 # Backward-subsumed : 3
% 0.27/1.44 # Backward-rewritten : 29
% 0.27/1.44 # Generated clauses : 497
% 0.27/1.44 # ...of the previous two non-trivial : 455
% 0.27/1.44 # Contextual simplify-reflections : 32
% 0.27/1.44 # Paramodulations : 494
% 0.27/1.44 # Factorizations : 2
% 0.27/1.44 # Equation resolutions : 1
% 0.27/1.44 # Current number of processed clauses : 339
% 0.27/1.44 # Positive orientable unit clauses : 125
% 0.27/1.44 # Positive unorientable unit clauses: 0
% 0.27/1.44 # Negative unit clauses : 46
% 0.27/1.44 # Non-unit-clauses : 168
% 0.27/1.44 # Current number of unprocessed clauses: 61
% 0.27/1.44 # ...number of literals in the above : 232
% 0.27/1.44 # Current number of archived formulas : 0
% 0.27/1.44 # Current number of archived clauses : 32
% 0.27/1.44 # Clause-clause subsumption calls (NU) : 6472
% 0.27/1.44 # Rec. Clause-clause subsumption calls : 5261
% 0.27/1.44 # Non-unit clause-clause subsumptions : 103
% 0.27/1.44 # Unit Clause-clause subsumption calls : 3255
% 0.27/1.44 # Rewrite failures with RHS unbound : 0
% 0.27/1.44 # BW rewrite match attempts : 12
% 0.27/1.44 # BW rewrite match successes : 12
% 0.27/1.44 # Condensation attempts : 0
% 0.27/1.44 # Condensation successes : 0
% 0.27/1.44 # Termbank termtop insertions : 15615
% 0.27/1.44
% 0.27/1.44 # -------------------------------------------------
% 0.27/1.44 # User time : 0.038 s
% 0.27/1.44 # System time : 0.011 s
% 0.27/1.44 # Total time : 0.049 s
% 0.27/1.44 # Maximum resident set size: 4804 pages
% 0.27/3.83 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/3.83 eprover: No such file or directory
% 0.27/3.83 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/3.83 eprover: No such file or directory
% 0.27/3.84 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/3.84 eprover: No such file or directory
% 0.27/3.85 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/3.85 eprover: No such file or directory
% 0.27/3.85 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/3.85 eprover: No such file or directory
% 0.27/3.86 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/3.86 eprover: No such file or directory
% 0.27/3.86 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/3.86 eprover: No such file or directory
% 0.27/3.87 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/3.87 eprover: No such file or directory
% 0.27/3.87 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/3.87 eprover: No such file or directory
% 0.27/3.88 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/3.88 eprover: No such file or directory
% 0.27/3.89 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/3.89 eprover: No such file or directory
% 0.27/23.44 eprover: CPU time limit exceeded, terminating
% 0.27/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.47 eprover: No such file or directory
% 0.27/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.47 eprover: No such file or directory
% 0.27/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.48 eprover: No such file or directory
% 0.27/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.48 eprover: No such file or directory
% 0.27/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.49 eprover: No such file or directory
% 0.27/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.49 eprover: No such file or directory
% 0.27/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.49 eprover: No such file or directory
% 0.27/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.50 eprover: No such file or directory
% 0.27/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.50 eprover: No such file or directory
% 0.27/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.51 eprover: No such file or directory
% 0.27/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.51 eprover: No such file or directory
%------------------------------------------------------------------------------