TSTP Solution File: NUM344+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM344+1 : TPTP v8.2.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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 : 300s
% DateTime : Tue May 21 01:06:41 EDT 2024
% Result : Theorem 0.18s 0.54s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 35 ( 16 unt; 0 def)
% Number of atoms : 76 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 74 ( 33 ~; 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 : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 64 ( 0 sgn 32 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
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(rdn_digit_add_n9_n0_n9_n0,axiom,
rdn_digit_add(rdnn(n9),rdnn(n0),rdnn(n9),rdnn(n0)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',rdn_digit_add_n9_n0_n9_n0) ).
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_n8_n1_n9_n0,axiom,
rdn_digit_add(rdnn(n8),rdnn(n1),rdnn(n9),rdnn(n0)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',rdn_digit_add_n8_n1_n9_n0) ).
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(rdn9,axiom,
rdn_translate(n9,rdn_pos(rdnn(n9))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn9) ).
fof(rdn_positive_less89,axiom,
rdn_positive_less(rdnn(n8),rdnn(n9)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_positive_less89) ).
fof(exist_bigger_plus_one,conjecture,
? [X1,X2] :
( sum(X1,n1,X2)
& less(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',exist_bigger_plus_one) ).
fof(rdn1,axiom,
rdn_translate(n1,rdn_pos(rdnn(n1))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn1) ).
fof(rdn8,axiom,
rdn_translate(n8,rdn_pos(rdnn(n8))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn8) ).
fof(c_0_10,plain,
! [X100,X101,X102,X103,X104] :
( ~ rdn_digit_add(rdnn(X101),rdnn(X102),rdnn(X104),rdnn(n0))
| ~ rdn_digit_add(rdnn(X104),rdnn(X100),rdnn(X103),rdnn(n0))
| rdn_add_with_carry(rdnn(X100),rdnn(X101),rdnn(X102),rdnn(X103)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[add_digit_digit_digit])])]) ).
cnf(c_0_11,plain,
( rdn_add_with_carry(rdnn(X4),rdnn(X1),rdnn(X2),rdnn(X5))
| ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(X3),rdnn(n0))
| ~ rdn_digit_add(rdnn(X3),rdnn(X4),rdnn(X5),rdnn(n0)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_12,plain,
rdn_digit_add(rdnn(n9),rdnn(n0),rdnn(n9),rdnn(n0)),
inference(split_conjunct,[status(thm)],[rdn_digit_add_n9_n0_n9_n0]) ).
fof(c_0_13,plain,
! [X49,X50,X51,X52,X53,X54] :
( ~ rdn_translate(X49,rdn_pos(X52))
| ~ rdn_translate(X50,rdn_pos(X53))
| ~ rdn_add_with_carry(rdnn(n0),X52,X53,X54)
| ~ rdn_translate(X51,rdn_pos(X54))
| sum(X49,X50,X51) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sum_entry_point_pos_pos])])]) ).
cnf(c_0_14,plain,
( rdn_add_with_carry(rdnn(n0),rdnn(X1),rdnn(X2),rdnn(n9))
| ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(n9),rdnn(n0)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
rdn_digit_add(rdnn(n8),rdnn(n1),rdnn(n9),rdnn(n0)),
inference(split_conjunct,[status(thm)],[rdn_digit_add_n8_n1_n9_n0]) ).
cnf(c_0_16,plain,
( sum(X1,X3,X6)
| ~ rdn_translate(X1,rdn_pos(X2))
| ~ rdn_translate(X3,rdn_pos(X4))
| ~ rdn_add_with_carry(rdnn(n0),X2,X4,X5)
| ~ rdn_translate(X6,rdn_pos(X5)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
rdn_add_with_carry(rdnn(n0),rdnn(n8),rdnn(n1),rdnn(n9)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_18,plain,
! [X35,X36,X37,X38] :
( ~ rdn_translate(X35,rdn_pos(X37))
| ~ rdn_translate(X36,rdn_pos(X38))
| ~ rdn_positive_less(X37,X38)
| less(X35,X36) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_entry_point_pos_pos])])]) ).
cnf(c_0_19,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X3,rdn_pos(rdnn(n9)))
| ~ rdn_translate(X2,rdn_pos(rdnn(n1)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n8))) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
rdn_translate(n9,rdn_pos(rdnn(n9))),
inference(split_conjunct,[status(thm)],[rdn9]) ).
cnf(c_0_21,plain,
( less(X1,X3)
| ~ rdn_translate(X1,rdn_pos(X2))
| ~ rdn_translate(X3,rdn_pos(X4))
| ~ rdn_positive_less(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
rdn_positive_less(rdnn(n8),rdnn(n9)),
inference(split_conjunct,[status(thm)],[rdn_positive_less89]) ).
fof(c_0_23,negated_conjecture,
~ ? [X1,X2] :
( sum(X1,n1,X2)
& less(X1,X2) ),
inference(assume_negation,[status(cth)],[exist_bigger_plus_one]) ).
cnf(c_0_24,plain,
( sum(X1,X2,n9)
| ~ rdn_translate(X2,rdn_pos(rdnn(n1)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n8))) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
rdn_translate(n1,rdn_pos(rdnn(n1))),
inference(split_conjunct,[status(thm)],[rdn1]) ).
cnf(c_0_26,plain,
( less(X1,X2)
| ~ rdn_translate(X2,rdn_pos(rdnn(n9)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n8))) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_27,negated_conjecture,
! [X33,X34] :
( ~ sum(X33,n1,X34)
| ~ less(X33,X34) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])]) ).
cnf(c_0_28,plain,
( sum(X1,n1,n9)
| ~ rdn_translate(X1,rdn_pos(rdnn(n8))) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
rdn_translate(n8,rdn_pos(rdnn(n8))),
inference(split_conjunct,[status(thm)],[rdn8]) ).
cnf(c_0_30,plain,
( less(X1,n9)
| ~ rdn_translate(X1,rdn_pos(rdnn(n8))) ),
inference(spm,[status(thm)],[c_0_26,c_0_20]) ).
cnf(c_0_31,negated_conjecture,
( ~ sum(X1,n1,X2)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,plain,
sum(n8,n1,n9),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
less(n8,n9),
inference(spm,[status(thm)],[c_0_30,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM344+1 : TPTP v8.2.0. Released v3.1.0.
% 0.00/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n012.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon May 20 04:07:37 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 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.18/0.54 # Version: 3.1.0
% 0.18/0.54 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.18/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.54 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.18/0.54 # Starting new_bool_3 with 600s (2) cores
% 0.18/0.54 # Starting new_bool_1 with 600s (2) cores
% 0.18/0.54 # Starting sh5l with 300s (1) cores
% 0.18/0.54 # new_bool_3 with pid 8925 completed with status 0
% 0.18/0.54 # Result found by new_bool_3
% 0.18/0.54 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.18/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.54 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.18/0.54 # Starting new_bool_3 with 600s (2) cores
% 0.18/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.54 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.18/0.54 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 0.18/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 325s (1) cores
% 0.18/0.54 # Starting new_bool_3 with 61s (1) cores
% 0.18/0.54 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 8928 completed with status 0
% 0.18/0.54 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.18/0.54 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.18/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.54 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.18/0.54 # Starting new_bool_3 with 600s (2) cores
% 0.18/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.54 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.18/0.54 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 0.18/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 325s (1) cores
% 0.18/0.54 # Preprocessing time : 0.003 s
% 0.18/0.54 # Presaturation interreduction done
% 0.18/0.54
% 0.18/0.54 # Proof found!
% 0.18/0.54 # SZS status Theorem
% 0.18/0.54 # SZS output start CNFRefutation
% See solution above
% 0.18/0.54 # Parsed axioms : 402
% 0.18/0.54 # Removed by relevancy pruning/SinE : 258
% 0.18/0.54 # Initial clauses : 146
% 0.18/0.54 # Removed in clause preprocessing : 0
% 0.18/0.54 # Initial clauses in saturation : 146
% 0.18/0.54 # Processed clauses : 860
% 0.18/0.54 # ...of these trivial : 0
% 0.18/0.54 # ...subsumed : 0
% 0.18/0.54 # ...remaining for further processing : 860
% 0.18/0.54 # Other redundant clauses eliminated : 1
% 0.18/0.54 # Clauses deleted for lack of memory : 0
% 0.18/0.54 # Backward-subsumed : 0
% 0.18/0.54 # Backward-rewritten : 0
% 0.18/0.54 # Generated clauses : 1131
% 0.18/0.54 # ...of the previous two non-redundant : 952
% 0.18/0.54 # ...aggressively subsumed : 0
% 0.18/0.54 # Contextual simplify-reflections : 0
% 0.18/0.54 # Paramodulations : 1128
% 0.18/0.54 # Factorizations : 2
% 0.18/0.54 # NegExts : 0
% 0.18/0.54 # Equation resolutions : 1
% 0.18/0.54 # Disequality decompositions : 0
% 0.18/0.54 # Total rewrite steps : 191
% 0.18/0.54 # ...of those cached : 115
% 0.18/0.54 # Propositional unsat checks : 0
% 0.18/0.54 # Propositional check models : 0
% 0.18/0.54 # Propositional check unsatisfiable : 0
% 0.18/0.54 # Propositional clauses : 0
% 0.18/0.54 # Propositional clauses after purity: 0
% 0.18/0.54 # Propositional unsat core size : 0
% 0.18/0.54 # Propositional preprocessing time : 0.000
% 0.18/0.54 # Propositional encoding time : 0.000
% 0.18/0.54 # Propositional solver time : 0.000
% 0.18/0.54 # Success case prop preproc time : 0.000
% 0.18/0.54 # Success case prop encoding time : 0.000
% 0.18/0.54 # Success case prop solver time : 0.000
% 0.18/0.54 # Current number of processed clauses : 713
% 0.18/0.54 # Positive orientable unit clauses : 267
% 0.18/0.54 # Positive unorientable unit clauses: 0
% 0.18/0.54 # Negative unit clauses : 46
% 0.18/0.54 # Non-unit-clauses : 400
% 0.18/0.54 # Current number of unprocessed clauses: 380
% 0.18/0.54 # ...number of literals in the above : 1047
% 0.18/0.54 # Current number of archived formulas : 0
% 0.18/0.54 # Current number of archived clauses : 146
% 0.18/0.54 # Clause-clause subsumption calls (NU) : 36656
% 0.18/0.54 # Rec. Clause-clause subsumption calls : 24252
% 0.18/0.54 # Non-unit clause-clause subsumptions : 0
% 0.18/0.54 # Unit Clause-clause subsumption calls : 7486
% 0.18/0.54 # Rewrite failures with RHS unbound : 0
% 0.18/0.54 # BW rewrite match attempts : 994
% 0.18/0.54 # BW rewrite match successes : 0
% 0.18/0.54 # Condensation attempts : 0
% 0.18/0.54 # Condensation successes : 0
% 0.18/0.54 # Termbank termtop insertions : 35052
% 0.18/0.54 # Search garbage collected termcells : 1844
% 0.18/0.54
% 0.18/0.54 # -------------------------------------------------
% 0.18/0.54 # User time : 0.057 s
% 0.18/0.54 # System time : 0.006 s
% 0.18/0.54 # Total time : 0.063 s
% 0.18/0.54 # Maximum resident set size: 2764 pages
% 0.18/0.54
% 0.18/0.54 # -------------------------------------------------
% 0.18/0.54 # User time : 0.121 s
% 0.18/0.54 # System time : 0.007 s
% 0.18/0.54 # Total time : 0.128 s
% 0.18/0.54 # Maximum resident set size: 2060 pages
% 0.18/0.54 % E---3.1 exiting
% 0.18/0.55 % E exiting
%------------------------------------------------------------------------------