TSTP Solution File: NUM315+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM315+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:46:19 EDT 2023
% Result : Theorem 0.61s 0.68s
% Output : CNFRefutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 25 ( 14 unt; 0 def)
% Number of atoms : 54 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 54 ( 25 ~; 23 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-1 aty)
% Number of variables : 46 ( 0 sgn; 22 !; 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/sandbox2/tmp/tmp.2ozitZJQco/E---3.1_16239.p',add_digit_digit_digit) ).
fof(sum_entry_point_neg_neg,axiom,
! [X1,X2,X3,X10,X11,X12] :
( ( rdn_translate(X1,rdn_neg(X10))
& rdn_translate(X2,rdn_neg(X11))
& rdn_add_with_carry(rdnn(n0),X10,X11,X12)
& rdn_translate(X3,rdn_neg(X12)) )
=> sum(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.2ozitZJQco/E---3.1_16239.p',sum_entry_point_neg_neg) ).
fof(rdn_digit_add_n7_n0_n7_n0,axiom,
rdn_digit_add(rdnn(n7),rdnn(n0),rdnn(n7),rdnn(n0)),
file('/export/starexec/sandbox2/tmp/tmp.2ozitZJQco/E---3.1_16239.p',rdn_digit_add_n7_n0_n7_n0) ).
fof(rdn_digit_add_n2_n5_n7_n0,axiom,
rdn_digit_add(rdnn(n2),rdnn(n5),rdnn(n7),rdnn(n0)),
file('/export/starexec/sandbox2/tmp/tmp.2ozitZJQco/E---3.1_16239.p',rdn_digit_add_n2_n5_n7_n0) ).
fof(rdnn7,axiom,
rdn_translate(nn7,rdn_neg(rdnn(n7))),
file('/export/starexec/sandbox2/tmp/tmp.2ozitZJQco/E---3.1_16239.p',rdnn7) ).
fof(rdnn5,axiom,
rdn_translate(nn5,rdn_neg(rdnn(n5))),
file('/export/starexec/sandbox2/tmp/tmp.2ozitZJQco/E---3.1_16239.p',rdnn5) ).
fof(sum_nn2_nn5_nn7,conjecture,
sum(nn2,nn5,nn7),
file('/export/starexec/sandbox2/tmp/tmp.2ozitZJQco/E---3.1_16239.p',sum_nn2_nn5_nn7) ).
fof(rdnn2,axiom,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
file('/export/starexec/sandbox2/tmp/tmp.2ozitZJQco/E---3.1_16239.p',rdnn2) ).
fof(c_0_8,plain,
! [X77,X78,X79,X80,X81] :
( ~ rdn_digit_add(rdnn(X78),rdnn(X79),rdnn(X81),rdnn(n0))
| ~ rdn_digit_add(rdnn(X81),rdnn(X77),rdnn(X80),rdnn(n0))
| rdn_add_with_carry(rdnn(X77),rdnn(X78),rdnn(X79),rdnn(X80)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[add_digit_digit_digit])]) ).
fof(c_0_9,plain,
! [X39,X40,X41,X42,X43,X44] :
( ~ rdn_translate(X39,rdn_neg(X42))
| ~ rdn_translate(X40,rdn_neg(X43))
| ~ rdn_add_with_carry(rdnn(n0),X42,X43,X44)
| ~ rdn_translate(X41,rdn_neg(X44))
| sum(X39,X40,X41) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sum_entry_point_neg_neg])]) ).
cnf(c_0_10,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_8]) ).
cnf(c_0_11,plain,
rdn_digit_add(rdnn(n7),rdnn(n0),rdnn(n7),rdnn(n0)),
inference(split_conjunct,[status(thm)],[rdn_digit_add_n7_n0_n7_n0]) ).
cnf(c_0_12,plain,
( sum(X1,X3,X6)
| ~ rdn_translate(X1,rdn_neg(X2))
| ~ rdn_translate(X3,rdn_neg(X4))
| ~ rdn_add_with_carry(rdnn(n0),X2,X4,X5)
| ~ rdn_translate(X6,rdn_neg(X5)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( rdn_add_with_carry(rdnn(n0),rdnn(X1),rdnn(X2),rdnn(n7))
| ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(n7),rdnn(n0)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( sum(X1,X2,X3)
| ~ rdn_digit_add(rdnn(X4),rdnn(X5),rdnn(n7),rdnn(n0))
| ~ rdn_translate(X3,rdn_neg(rdnn(n7)))
| ~ rdn_translate(X2,rdn_neg(rdnn(X5)))
| ~ rdn_translate(X1,rdn_neg(rdnn(X4))) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
rdn_digit_add(rdnn(n2),rdnn(n5),rdnn(n7),rdnn(n0)),
inference(split_conjunct,[status(thm)],[rdn_digit_add_n2_n5_n7_n0]) ).
cnf(c_0_16,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X3,rdn_neg(rdnn(n7)))
| ~ rdn_translate(X2,rdn_neg(rdnn(n5)))
| ~ rdn_translate(X1,rdn_neg(rdnn(n2))) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,plain,
rdn_translate(nn7,rdn_neg(rdnn(n7))),
inference(split_conjunct,[status(thm)],[rdnn7]) ).
cnf(c_0_18,plain,
( sum(X1,X2,nn7)
| ~ rdn_translate(X2,rdn_neg(rdnn(n5)))
| ~ rdn_translate(X1,rdn_neg(rdnn(n2))) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,plain,
rdn_translate(nn5,rdn_neg(rdnn(n5))),
inference(split_conjunct,[status(thm)],[rdnn5]) ).
fof(c_0_20,negated_conjecture,
~ sum(nn2,nn5,nn7),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[sum_nn2_nn5_nn7])]) ).
cnf(c_0_21,plain,
( sum(X1,nn5,nn7)
| ~ rdn_translate(X1,rdn_neg(rdnn(n2))) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(split_conjunct,[status(thm)],[rdnn2]) ).
cnf(c_0_23,negated_conjecture,
~ sum(nn2,nn5,nn7),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.16 % Problem : NUM315+1 : TPTP v8.1.2. Released v3.1.0.
% 0.08/0.17 % Command : run_E %s %d THM
% 0.17/0.39 % Computer : n014.cluster.edu
% 0.17/0.39 % Model : x86_64 x86_64
% 0.17/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.39 % Memory : 8042.1875MB
% 0.17/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.39 % CPULimit : 2400
% 0.17/0.39 % WCLimit : 300
% 0.17/0.39 % DateTime : Mon Oct 2 13:57:49 EDT 2023
% 0.17/0.39 % CPUTime :
% 0.25/0.56 Running first-order theorem proving
% 0.25/0.56 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.2ozitZJQco/E---3.1_16239.p
% 0.61/0.68 # Version: 3.1pre001
% 0.61/0.68 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.61/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.68 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.61/0.68 # Starting new_bool_3 with 600s (2) cores
% 0.61/0.68 # Starting new_bool_1 with 600s (2) cores
% 0.61/0.68 # Starting sh5l with 300s (1) cores
% 0.61/0.68 # new_bool_1 with pid 16319 completed with status 0
% 0.61/0.68 # Result found by new_bool_1
% 0.61/0.68 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.61/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.68 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.61/0.68 # Starting new_bool_3 with 600s (2) cores
% 0.61/0.68 # Starting new_bool_1 with 600s (2) cores
% 0.61/0.68 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.61/0.68 # Search class: FHUSF-FFMM21-SFFFFFNN
% 0.61/0.68 # partial match(1): FHUNF-FFMM21-SFFFFFNN
% 0.61/0.68 # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.61/0.68 # Starting SAT001_MinMin_p005000_rr_RG with 361s (1) cores
% 0.61/0.68 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 61s (1) cores
% 0.61/0.68 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 16324 completed with status 0
% 0.61/0.68 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.61/0.68 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.61/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.68 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.61/0.68 # Starting new_bool_3 with 600s (2) cores
% 0.61/0.68 # Starting new_bool_1 with 600s (2) cores
% 0.61/0.68 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.61/0.68 # Search class: FHUSF-FFMM21-SFFFFFNN
% 0.61/0.68 # partial match(1): FHUNF-FFMM21-SFFFFFNN
% 0.61/0.68 # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.61/0.68 # Starting SAT001_MinMin_p005000_rr_RG with 361s (1) cores
% 0.61/0.68 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 61s (1) cores
% 0.61/0.68 # Preprocessing time : 0.002 s
% 0.61/0.68 # Presaturation interreduction done
% 0.61/0.68
% 0.61/0.68 # Proof found!
% 0.61/0.68 # SZS status Theorem
% 0.61/0.68 # SZS output start CNFRefutation
% See solution above
% 0.61/0.68 # Parsed axioms : 402
% 0.61/0.68 # Removed by relevancy pruning/SinE : 259
% 0.61/0.68 # Initial clauses : 143
% 0.61/0.68 # Removed in clause preprocessing : 0
% 0.61/0.68 # Initial clauses in saturation : 143
% 0.61/0.68 # Processed clauses : 1364
% 0.61/0.68 # ...of these trivial : 0
% 0.61/0.68 # ...subsumed : 478
% 0.61/0.68 # ...remaining for further processing : 886
% 0.61/0.68 # Other redundant clauses eliminated : 0
% 0.61/0.68 # Clauses deleted for lack of memory : 0
% 0.61/0.68 # Backward-subsumed : 39
% 0.61/0.68 # Backward-rewritten : 0
% 0.61/0.68 # Generated clauses : 1860
% 0.61/0.68 # ...of the previous two non-redundant : 1859
% 0.61/0.68 # ...aggressively subsumed : 0
% 0.61/0.68 # Contextual simplify-reflections : 0
% 0.61/0.68 # Paramodulations : 1860
% 0.61/0.68 # Factorizations : 0
% 0.61/0.68 # NegExts : 0
% 0.61/0.68 # Equation resolutions : 0
% 0.61/0.68 # Total rewrite steps : 0
% 0.61/0.68 # Propositional unsat checks : 0
% 0.61/0.68 # Propositional check models : 0
% 0.61/0.68 # Propositional check unsatisfiable : 0
% 0.61/0.68 # Propositional clauses : 0
% 0.61/0.68 # Propositional clauses after purity: 0
% 0.61/0.68 # Propositional unsat core size : 0
% 0.61/0.68 # Propositional preprocessing time : 0.000
% 0.61/0.68 # Propositional encoding time : 0.000
% 0.61/0.68 # Propositional solver time : 0.000
% 0.61/0.68 # Success case prop preproc time : 0.000
% 0.61/0.68 # Success case prop encoding time : 0.000
% 0.61/0.68 # Success case prop solver time : 0.000
% 0.61/0.68 # Current number of processed clauses : 704
% 0.61/0.68 # Positive orientable unit clauses : 158
% 0.61/0.68 # Positive unorientable unit clauses: 0
% 0.61/0.68 # Negative unit clauses : 1
% 0.61/0.68 # Non-unit-clauses : 545
% 0.61/0.68 # Current number of unprocessed clauses: 781
% 0.61/0.68 # ...number of literals in the above : 3770
% 0.61/0.68 # Current number of archived formulas : 0
% 0.61/0.68 # Current number of archived clauses : 182
% 0.61/0.68 # Clause-clause subsumption calls (NU) : 102100
% 0.61/0.68 # Rec. Clause-clause subsumption calls : 59782
% 0.61/0.68 # Non-unit clause-clause subsumptions : 517
% 0.61/0.68 # Unit Clause-clause subsumption calls : 105
% 0.61/0.68 # Rewrite failures with RHS unbound : 0
% 0.61/0.68 # BW rewrite match attempts : 0
% 0.61/0.68 # BW rewrite match successes : 0
% 0.61/0.68 # Condensation attempts : 0
% 0.61/0.68 # Condensation successes : 0
% 0.61/0.68 # Termbank termtop insertions : 53493
% 0.61/0.68
% 0.61/0.68 # -------------------------------------------------
% 0.61/0.68 # User time : 0.083 s
% 0.61/0.68 # System time : 0.012 s
% 0.61/0.68 # Total time : 0.096 s
% 0.61/0.68 # Maximum resident set size: 2736 pages
% 0.61/0.68
% 0.61/0.68 # -------------------------------------------------
% 0.61/0.68 # User time : 0.147 s
% 0.61/0.68 # System time : 0.016 s
% 0.61/0.68 # Total time : 0.163 s
% 0.61/0.68 # Maximum resident set size: 2032 pages
% 0.61/0.68 % E---3.1 exiting
% 0.61/0.68 % E---3.1 exiting
%------------------------------------------------------------------------------