TSTP Solution File: NUM330+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM330+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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 : Sat May 4 08:48:09 EDT 2024
% Result : Theorem 0.65s 0.60s
% Output : CNFRefutation 0.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 25 ( 11 unt; 0 def)
% Number of atoms : 58 ( 8 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 60 ( 27 ~; 23 |; 8 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 49 ( 0 sgn 24 !; 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/sandbox2/tmp/tmp.PnLvoC46UT/E---3.1_28379.p',add_digit_digit_digit) ).
fof(rdn_digit_add_n8_n0_n8_n0,axiom,
rdn_digit_add(rdnn(n8),rdnn(n0),rdnn(n8),rdnn(n0)),
file('/export/starexec/sandbox2/tmp/tmp.PnLvoC46UT/E---3.1_28379.p',rdn_digit_add_n8_n0_n8_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/sandbox2/tmp/tmp.PnLvoC46UT/E---3.1_28379.p',sum_entry_point_pos_pos) ).
fof(rdn_digit_add_n4_n4_n8_n0,axiom,
rdn_digit_add(rdnn(n4),rdnn(n4),rdnn(n8),rdnn(n0)),
file('/export/starexec/sandbox2/tmp/tmp.PnLvoC46UT/E---3.1_28379.p',rdn_digit_add_n4_n4_n8_n0) ).
fof(sum_n4_n4_n8,conjecture,
? [X1,X2] :
( sum(X1,X2,n8)
& X1 = n4
& X2 = n4 ),
file('/export/starexec/sandbox2/tmp/tmp.PnLvoC46UT/E---3.1_28379.p',sum_n4_n4_n8) ).
fof(rdn8,axiom,
rdn_translate(n8,rdn_pos(rdnn(n8))),
file('/export/starexec/sandbox2/tmp/tmp.PnLvoC46UT/E---3.1_28379.p',rdn8) ).
fof(rdn4,axiom,
rdn_translate(n4,rdn_pos(rdnn(n4))),
file('/export/starexec/sandbox2/tmp/tmp.PnLvoC46UT/E---3.1_28379.p',rdn4) ).
fof(c_0_7,plain,
! [X79,X80,X81,X82,X83] :
( ~ rdn_digit_add(rdnn(X80),rdnn(X81),rdnn(X83),rdnn(n0))
| ~ rdn_digit_add(rdnn(X83),rdnn(X79),rdnn(X82),rdnn(n0))
| rdn_add_with_carry(rdnn(X79),rdnn(X80),rdnn(X81),rdnn(X82)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[add_digit_digit_digit])])]) ).
cnf(c_0_8,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_7]) ).
cnf(c_0_9,plain,
rdn_digit_add(rdnn(n8),rdnn(n0),rdnn(n8),rdnn(n0)),
inference(split_conjunct,[status(thm)],[rdn_digit_add_n8_n0_n8_n0]) ).
fof(c_0_10,plain,
! [X35,X36,X37,X38,X39,X40] :
( ~ rdn_translate(X35,rdn_pos(X38))
| ~ rdn_translate(X36,rdn_pos(X39))
| ~ rdn_add_with_carry(rdnn(n0),X38,X39,X40)
| ~ rdn_translate(X37,rdn_pos(X40))
| sum(X35,X36,X37) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sum_entry_point_pos_pos])])]) ).
cnf(c_0_11,plain,
( rdn_add_with_carry(rdnn(n0),rdnn(X1),rdnn(X2),rdnn(n8))
| ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(n8),rdnn(n0)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
rdn_digit_add(rdnn(n4),rdnn(n4),rdnn(n8),rdnn(n0)),
inference(split_conjunct,[status(thm)],[rdn_digit_add_n4_n4_n8_n0]) ).
cnf(c_0_13,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_10]) ).
cnf(c_0_14,plain,
rdn_add_with_carry(rdnn(n0),rdnn(n4),rdnn(n4),rdnn(n8)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_15,negated_conjecture,
~ ? [X1,X2] :
( sum(X1,X2,n8)
& X1 = n4
& X2 = n4 ),
inference(assume_negation,[status(cth)],[sum_n4_n4_n8]) ).
cnf(c_0_16,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X3,rdn_pos(rdnn(n8)))
| ~ rdn_translate(X2,rdn_pos(rdnn(n4)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n4))) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
rdn_translate(n8,rdn_pos(rdnn(n8))),
inference(split_conjunct,[status(thm)],[rdn8]) ).
fof(c_0_18,negated_conjecture,
! [X33,X34] :
( ~ sum(X33,X34,n8)
| X33 != n4
| X34 != n4 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
cnf(c_0_19,plain,
( sum(X1,X2,n8)
| ~ rdn_translate(X2,rdn_pos(rdnn(n4)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n4))) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
rdn_translate(n4,rdn_pos(rdnn(n4))),
inference(split_conjunct,[status(thm)],[rdn4]) ).
cnf(c_0_21,negated_conjecture,
( ~ sum(X1,X2,n8)
| X1 != n4
| X2 != n4 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
( sum(X1,n4,n8)
| ~ rdn_translate(X1,rdn_pos(rdnn(n4))) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
~ sum(n4,n4,n8),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_21])]) ).
cnf(c_0_24,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_20]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.14 % Problem : NUM330+1 : TPTP v8.1.2. Released v3.1.0.
% 0.10/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n017.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 09:05:51 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.22/0.53 Running first-order theorem proving
% 0.22/0.53 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/tmp/tmp.PnLvoC46UT/E---3.1_28379.p
% 0.65/0.60 # Version: 3.1.0
% 0.65/0.60 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.65/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.65/0.60 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.65/0.60 # Starting new_bool_3 with 600s (2) cores
% 0.65/0.60 # Starting new_bool_1 with 600s (2) cores
% 0.65/0.60 # Starting sh5l with 300s (1) cores
% 0.65/0.60 # new_bool_3 with pid 28466 completed with status 0
% 0.65/0.60 # Result found by new_bool_3
% 0.65/0.60 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.65/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.65/0.60 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.65/0.60 # Starting new_bool_3 with 600s (2) cores
% 0.65/0.60 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.65/0.60 # Search class: FHHSF-FFMM21-SFFFFFNN
% 0.65/0.60 # partial match(1): FGHSF-FFMM21-SFFFFFNN
% 0.65/0.60 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 0.65/0.60 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 325s (1) cores
% 0.65/0.60 # Starting new_bool_3 with 61s (1) cores
% 0.65/0.60 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 28470 completed with status 0
% 0.65/0.60 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.65/0.60 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.65/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.65/0.60 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.65/0.60 # Starting new_bool_3 with 600s (2) cores
% 0.65/0.60 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.65/0.60 # Search class: FHHSF-FFMM21-SFFFFFNN
% 0.65/0.60 # partial match(1): FGHSF-FFMM21-SFFFFFNN
% 0.65/0.60 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 0.65/0.60 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 325s (1) cores
% 0.65/0.60 # Preprocessing time : 0.002 s
% 0.65/0.60 # Presaturation interreduction done
% 0.65/0.60
% 0.65/0.60 # Proof found!
% 0.65/0.60 # SZS status Theorem
% 0.65/0.60 # SZS output start CNFRefutation
% See solution above
% 0.65/0.60 # Parsed axioms : 402
% 0.65/0.60 # Removed by relevancy pruning/SinE : 262
% 0.65/0.60 # Initial clauses : 140
% 0.65/0.60 # Removed in clause preprocessing : 0
% 0.65/0.60 # Initial clauses in saturation : 140
% 0.65/0.60 # Processed clauses : 604
% 0.65/0.60 # ...of these trivial : 0
% 0.65/0.60 # ...subsumed : 0
% 0.65/0.60 # ...remaining for further processing : 604
% 0.65/0.60 # Other redundant clauses eliminated : 2
% 0.65/0.60 # Clauses deleted for lack of memory : 0
% 0.65/0.60 # Backward-subsumed : 5
% 0.65/0.60 # Backward-rewritten : 5
% 0.65/0.60 # Generated clauses : 718
% 0.65/0.60 # ...of the previous two non-redundant : 628
% 0.65/0.60 # ...aggressively subsumed : 0
% 0.65/0.60 # Contextual simplify-reflections : 0
% 0.65/0.60 # Paramodulations : 717
% 0.65/0.60 # Factorizations : 0
% 0.65/0.60 # NegExts : 0
% 0.65/0.60 # Equation resolutions : 2
% 0.65/0.60 # Disequality decompositions : 0
% 0.65/0.60 # Total rewrite steps : 122
% 0.65/0.60 # ...of those cached : 80
% 0.65/0.60 # Propositional unsat checks : 0
% 0.65/0.60 # Propositional check models : 0
% 0.65/0.60 # Propositional check unsatisfiable : 0
% 0.65/0.60 # Propositional clauses : 0
% 0.65/0.60 # Propositional clauses after purity: 0
% 0.65/0.60 # Propositional unsat core size : 0
% 0.65/0.60 # Propositional preprocessing time : 0.000
% 0.65/0.60 # Propositional encoding time : 0.000
% 0.65/0.60 # Propositional solver time : 0.000
% 0.65/0.60 # Success case prop preproc time : 0.000
% 0.65/0.60 # Success case prop encoding time : 0.000
% 0.65/0.60 # Success case prop solver time : 0.000
% 0.65/0.60 # Current number of processed clauses : 453
% 0.65/0.60 # Positive orientable unit clauses : 235
% 0.65/0.60 # Positive unorientable unit clauses: 0
% 0.65/0.60 # Negative unit clauses : 1
% 0.65/0.60 # Non-unit-clauses : 217
% 0.65/0.60 # Current number of unprocessed clauses: 304
% 0.65/0.60 # ...number of literals in the above : 829
% 0.65/0.60 # Current number of archived formulas : 0
% 0.65/0.60 # Current number of archived clauses : 150
% 0.65/0.60 # Clause-clause subsumption calls (NU) : 6602
% 0.65/0.60 # Rec. Clause-clause subsumption calls : 4436
% 0.65/0.60 # Non-unit clause-clause subsumptions : 5
% 0.65/0.60 # Unit Clause-clause subsumption calls : 25
% 0.65/0.60 # Rewrite failures with RHS unbound : 0
% 0.65/0.60 # BW rewrite match attempts : 1001
% 0.65/0.60 # BW rewrite match successes : 5
% 0.65/0.60 # Condensation attempts : 0
% 0.65/0.60 # Condensation successes : 0
% 0.65/0.60 # Termbank termtop insertions : 26954
% 0.65/0.60 # Search garbage collected termcells : 1786
% 0.65/0.60
% 0.65/0.60 # -------------------------------------------------
% 0.65/0.60 # User time : 0.043 s
% 0.65/0.60 # System time : 0.004 s
% 0.65/0.60 # Total time : 0.047 s
% 0.65/0.60 # Maximum resident set size: 2852 pages
% 0.65/0.60
% 0.65/0.60 # -------------------------------------------------
% 0.65/0.60 # User time : 0.092 s
% 0.65/0.60 # System time : 0.006 s
% 0.65/0.60 # Total time : 0.097 s
% 0.65/0.60 # Maximum resident set size: 2052 pages
% 0.65/0.60 % E---3.1 exiting
% 0.65/0.60 % E exiting
%------------------------------------------------------------------------------