TSTP Solution File: NUM346+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM346+1 : TPTP v8.2.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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 1.07s 0.57s
% Output : CNFRefutation 1.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 43 ( 21 unt; 0 def)
% Number of atoms : 90 ( 5 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 83 ( 36 ~; 33 |; 8 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-1 aty)
% Number of variables : 71 ( 0 sgn 40 !; 0 ?)
% 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_n5_n0_n5_n0,axiom,
rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',rdn_digit_add_n5_n0_n5_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_n2_n3_n5_n0,axiom,
rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',rdn_digit_add_n2_n3_n5_n0) ).
fof(sum_n2_n3_greater_n4,conjecture,
! [X1] :
( sum(n2,n3,X1)
=> less(n4,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_n2_n3_greater_n4) ).
fof(rdn5,axiom,
rdn_translate(n5,rdn_pos(rdnn(n5))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn5) ).
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(unique_sum,axiom,
! [X1,X2,X15,X16] :
( ( sum(X1,X2,X15)
& sum(X1,X2,X16) )
=> X15 = X16 ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',unique_sum) ).
fof(rdn3,axiom,
rdn_translate(n3,rdn_pos(rdnn(n3))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn3) ).
fof(rdn_positive_less45,axiom,
rdn_positive_less(rdnn(n4),rdnn(n5)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_positive_less45) ).
fof(rdn2,axiom,
rdn_translate(n2,rdn_pos(rdnn(n2))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn2) ).
fof(rdn4,axiom,
rdn_translate(n4,rdn_pos(rdnn(n4))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn4) ).
fof(c_0_12,plain,
! [X99,X100,X101,X102,X103] :
( ~ rdn_digit_add(rdnn(X100),rdnn(X101),rdnn(X103),rdnn(n0))
| ~ rdn_digit_add(rdnn(X103),rdnn(X99),rdnn(X102),rdnn(n0))
| rdn_add_with_carry(rdnn(X99),rdnn(X100),rdnn(X101),rdnn(X102)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[add_digit_digit_digit])])]) ).
cnf(c_0_13,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_12]) ).
cnf(c_0_14,plain,
rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
inference(split_conjunct,[status(thm)],[rdn_digit_add_n5_n0_n5_n0]) ).
fof(c_0_15,plain,
! [X48,X49,X50,X51,X52,X53] :
( ~ rdn_translate(X48,rdn_pos(X51))
| ~ rdn_translate(X49,rdn_pos(X52))
| ~ rdn_add_with_carry(rdnn(n0),X51,X52,X53)
| ~ rdn_translate(X50,rdn_pos(X53))
| sum(X48,X49,X50) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sum_entry_point_pos_pos])])]) ).
cnf(c_0_16,plain,
( rdn_add_with_carry(rdnn(n0),rdnn(X1),rdnn(X2),rdnn(n5))
| ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(n5),rdnn(n0)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
inference(split_conjunct,[status(thm)],[rdn_digit_add_n2_n3_n5_n0]) ).
cnf(c_0_18,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_15]) ).
cnf(c_0_19,plain,
rdn_add_with_carry(rdnn(n0),rdnn(n2),rdnn(n3),rdnn(n5)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_20,negated_conjecture,
~ ! [X1] :
( sum(n2,n3,X1)
=> less(n4,X1) ),
inference(assume_negation,[status(cth)],[sum_n2_n3_greater_n4]) ).
cnf(c_0_21,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X3,rdn_pos(rdnn(n5)))
| ~ rdn_translate(X2,rdn_pos(rdnn(n3)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n2))) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
rdn_translate(n5,rdn_pos(rdnn(n5))),
inference(split_conjunct,[status(thm)],[rdn5]) ).
fof(c_0_23,plain,
! [X34,X35,X36,X37] :
( ~ rdn_translate(X34,rdn_pos(X36))
| ~ rdn_translate(X35,rdn_pos(X37))
| ~ rdn_positive_less(X36,X37)
| less(X34,X35) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_entry_point_pos_pos])])]) ).
fof(c_0_24,plain,
! [X80,X81,X82,X83] :
( ~ sum(X80,X81,X82)
| ~ sum(X80,X81,X83)
| X82 = X83 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unique_sum])])]) ).
fof(c_0_25,negated_conjecture,
( sum(n2,n3,esk1_0)
& ~ less(n4,esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])]) ).
cnf(c_0_26,plain,
( sum(X1,X2,n5)
| ~ rdn_translate(X2,rdn_pos(rdnn(n3)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n2))) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
rdn_translate(n3,rdn_pos(rdnn(n3))),
inference(split_conjunct,[status(thm)],[rdn3]) ).
cnf(c_0_28,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_23]) ).
cnf(c_0_29,plain,
rdn_positive_less(rdnn(n4),rdnn(n5)),
inference(split_conjunct,[status(thm)],[rdn_positive_less45]) ).
cnf(c_0_30,plain,
( X3 = X4
| ~ sum(X1,X2,X3)
| ~ sum(X1,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,negated_conjecture,
sum(n2,n3,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,plain,
( sum(X1,n3,n5)
| ~ rdn_translate(X1,rdn_pos(rdnn(n2))) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
inference(split_conjunct,[status(thm)],[rdn2]) ).
cnf(c_0_34,plain,
( less(X1,X2)
| ~ rdn_translate(X2,rdn_pos(rdnn(n5)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n4))) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,negated_conjecture,
( X1 = esk1_0
| ~ sum(n2,n3,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
sum(n2,n3,n5),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,plain,
( less(X1,n5)
| ~ rdn_translate(X1,rdn_pos(rdnn(n4))) ),
inference(spm,[status(thm)],[c_0_34,c_0_22]) ).
cnf(c_0_38,plain,
rdn_translate(n4,rdn_pos(rdnn(n4))),
inference(split_conjunct,[status(thm)],[rdn4]) ).
cnf(c_0_39,negated_conjecture,
~ less(n4,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_40,negated_conjecture,
esk1_0 = n5,
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,plain,
less(n4,n5),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : NUM346+1 : TPTP v8.2.0. Released v3.1.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n021.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 : 300
% 0.12/0.33 % DateTime : Mon May 20 07:30:23 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.17/0.45 Running first-order theorem proving
% 0.17/0.45 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
% 1.07/0.57 # Version: 3.1.0
% 1.07/0.57 # Preprocessing class: FSLMSMSLSSSNFFN.
% 1.07/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.07/0.57 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 1.07/0.57 # Starting new_bool_3 with 600s (2) cores
% 1.07/0.57 # Starting new_bool_1 with 600s (2) cores
% 1.07/0.57 # Starting sh5l with 300s (1) cores
% 1.07/0.57 # new_bool_3 with pid 27757 completed with status 0
% 1.07/0.57 # Result found by new_bool_3
% 1.07/0.57 # Preprocessing class: FSLMSMSLSSSNFFN.
% 1.07/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.07/0.57 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 1.07/0.57 # Starting new_bool_3 with 600s (2) cores
% 1.07/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.07/0.57 # Search class: FGHSF-FFMM21-SFFFFFNN
% 1.07/0.57 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 1.07/0.57 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 325s (1) cores
% 1.07/0.57 # Starting new_bool_3 with 61s (1) cores
% 1.07/0.57 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 27760 completed with status 0
% 1.07/0.57 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 1.07/0.57 # Preprocessing class: FSLMSMSLSSSNFFN.
% 1.07/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.07/0.57 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 1.07/0.57 # Starting new_bool_3 with 600s (2) cores
% 1.07/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.07/0.57 # Search class: FGHSF-FFMM21-SFFFFFNN
% 1.07/0.57 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 1.07/0.57 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 325s (1) cores
% 1.07/0.57 # Preprocessing time : 0.002 s
% 1.07/0.57 # Presaturation interreduction done
% 1.07/0.57
% 1.07/0.57 # Proof found!
% 1.07/0.57 # SZS status Theorem
% 1.07/0.57 # SZS output start CNFRefutation
% See solution above
% 1.07/0.57 # Parsed axioms : 402
% 1.07/0.57 # Removed by relevancy pruning/SinE : 258
% 1.07/0.57 # Initial clauses : 147
% 1.07/0.57 # Removed in clause preprocessing : 0
% 1.07/0.57 # Initial clauses in saturation : 147
% 1.07/0.57 # Processed clauses : 1167
% 1.07/0.57 # ...of these trivial : 1
% 1.07/0.57 # ...subsumed : 0
% 1.07/0.57 # ...remaining for further processing : 1166
% 1.07/0.57 # Other redundant clauses eliminated : 1
% 1.07/0.57 # Clauses deleted for lack of memory : 0
% 1.07/0.57 # Backward-subsumed : 9
% 1.07/0.57 # Backward-rewritten : 14
% 1.07/0.57 # Generated clauses : 1588
% 1.07/0.57 # ...of the previous two non-redundant : 1406
% 1.07/0.57 # ...aggressively subsumed : 0
% 1.07/0.57 # Contextual simplify-reflections : 0
% 1.07/0.57 # Paramodulations : 1585
% 1.07/0.57 # Factorizations : 2
% 1.07/0.57 # NegExts : 0
% 1.07/0.57 # Equation resolutions : 1
% 1.07/0.57 # Disequality decompositions : 0
% 1.07/0.57 # Total rewrite steps : 255
% 1.07/0.57 # ...of those cached : 154
% 1.07/0.57 # Propositional unsat checks : 0
% 1.07/0.57 # Propositional check models : 0
% 1.07/0.57 # Propositional check unsatisfiable : 0
% 1.07/0.57 # Propositional clauses : 0
% 1.07/0.57 # Propositional clauses after purity: 0
% 1.07/0.57 # Propositional unsat core size : 0
% 1.07/0.57 # Propositional preprocessing time : 0.000
% 1.07/0.57 # Propositional encoding time : 0.000
% 1.07/0.57 # Propositional solver time : 0.000
% 1.07/0.57 # Success case prop preproc time : 0.000
% 1.07/0.57 # Success case prop encoding time : 0.000
% 1.07/0.57 # Success case prop solver time : 0.000
% 1.07/0.57 # Current number of processed clauses : 995
% 1.07/0.57 # Positive orientable unit clauses : 392
% 1.07/0.57 # Positive unorientable unit clauses: 0
% 1.07/0.57 # Negative unit clauses : 46
% 1.07/0.57 # Non-unit-clauses : 557
% 1.07/0.57 # Current number of unprocessed clauses: 530
% 1.07/0.57 # ...number of literals in the above : 2004
% 1.07/0.57 # Current number of archived formulas : 0
% 1.07/0.57 # Current number of archived clauses : 170
% 1.07/0.57 # Clause-clause subsumption calls (NU) : 60150
% 1.07/0.57 # Rec. Clause-clause subsumption calls : 44983
% 1.07/0.57 # Non-unit clause-clause subsumptions : 9
% 1.07/0.57 # Unit Clause-clause subsumption calls : 8389
% 1.07/0.57 # Rewrite failures with RHS unbound : 0
% 1.07/0.57 # BW rewrite match attempts : 753
% 1.07/0.57 # BW rewrite match successes : 9
% 1.07/0.57 # Condensation attempts : 0
% 1.07/0.57 # Condensation successes : 0
% 1.07/0.57 # Termbank termtop insertions : 48410
% 1.07/0.57 # Search garbage collected termcells : 1851
% 1.07/0.57
% 1.07/0.57 # -------------------------------------------------
% 1.07/0.57 # User time : 0.092 s
% 1.07/0.57 # System time : 0.007 s
% 1.07/0.57 # Total time : 0.099 s
% 1.07/0.57 # Maximum resident set size: 2764 pages
% 1.07/0.57
% 1.07/0.57 # -------------------------------------------------
% 1.07/0.57 # User time : 0.189 s
% 1.07/0.57 # System time : 0.010 s
% 1.07/0.57 # Total time : 0.199 s
% 1.07/0.57 # Maximum resident set size: 2056 pages
% 1.07/0.57 % E---3.1 exiting
% 1.07/0.57 % E exiting
%------------------------------------------------------------------------------