TSTP Solution File: NUM335+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM335+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:22 EDT 2023
% Result : Theorem 0.23s 0.61s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 36 ( 15 unt; 0 def)
% Number of atoms : 80 ( 8 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 78 ( 34 ~; 31 |; 7 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-1 aty)
% Number of variables : 70 ( 0 sgn; 38 !; 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/tmp/tmp.t8Yvqd1v7w/E---3.1_21673.p',add_digit_digit_digit) ).
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/tmp/tmp.t8Yvqd1v7w/E---3.1_21673.p',sum_entry_point_pos_pos) ).
fof(rdn_digit_add_n5_n0_n5_n0,axiom,
rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
file('/export/starexec/sandbox/tmp/tmp.t8Yvqd1v7w/E---3.1_21673.p',rdn_digit_add_n5_n0_n5_n0) ).
fof(diff_n5_n3_only_n2,conjecture,
! [X1] :
( difference(n5,n3,X1)
=> X1 = n2 ),
file('/export/starexec/sandbox/tmp/tmp.t8Yvqd1v7w/E---3.1_21673.p',diff_n5_n3_only_n2) ).
fof(rdn_digit_add_n3_n2_n5_n0,axiom,
rdn_digit_add(rdnn(n3),rdnn(n2),rdnn(n5),rdnn(n0)),
file('/export/starexec/sandbox/tmp/tmp.t8Yvqd1v7w/E---3.1_21673.p',rdn_digit_add_n3_n2_n5_n0) ).
fof(minus_entry_point,axiom,
! [X1,X2,X3] :
( sum(X2,X3,X1)
<=> difference(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.t8Yvqd1v7w/E---3.1_21673.p',minus_entry_point) ).
fof(rdn5,axiom,
rdn_translate(n5,rdn_pos(rdnn(n5))),
file('/export/starexec/sandbox/tmp/tmp.t8Yvqd1v7w/E---3.1_21673.p',rdn5) ).
fof(unique_RHS,axiom,
! [X1,X19,X20,X3] :
( ( sum(X1,X19,X3)
& sum(X1,X20,X3) )
=> X19 = X20 ),
file('/export/starexec/sandbox/tmp/tmp.t8Yvqd1v7w/E---3.1_21673.p',unique_RHS) ).
fof(rdn2,axiom,
rdn_translate(n2,rdn_pos(rdnn(n2))),
file('/export/starexec/sandbox/tmp/tmp.t8Yvqd1v7w/E---3.1_21673.p',rdn2) ).
fof(rdn3,axiom,
rdn_translate(n3,rdn_pos(rdnn(n3))),
file('/export/starexec/sandbox/tmp/tmp.t8Yvqd1v7w/E---3.1_21673.p',rdn3) ).
fof(c_0_10,plain,
! [X81,X82,X83,X84,X85] :
( ~ rdn_digit_add(rdnn(X82),rdnn(X83),rdnn(X85),rdnn(n0))
| ~ rdn_digit_add(rdnn(X85),rdnn(X81),rdnn(X84),rdnn(n0))
| rdn_add_with_carry(rdnn(X81),rdnn(X82),rdnn(X83),rdnn(X84)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[add_digit_digit_digit])]) ).
fof(c_0_11,plain,
! [X37,X38,X39,X40,X41,X42] :
( ~ rdn_translate(X37,rdn_pos(X40))
| ~ rdn_translate(X38,rdn_pos(X41))
| ~ rdn_add_with_carry(rdnn(n0),X40,X41,X42)
| ~ rdn_translate(X39,rdn_pos(X42))
| sum(X37,X38,X39) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sum_entry_point_pos_pos])]) ).
cnf(c_0_12,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_13,plain,
rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
inference(split_conjunct,[status(thm)],[rdn_digit_add_n5_n0_n5_n0]) ).
cnf(c_0_14,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_11]) ).
cnf(c_0_15,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_12,c_0_13]) ).
fof(c_0_16,negated_conjecture,
~ ! [X1] :
( difference(n5,n3,X1)
=> X1 = n2 ),
inference(assume_negation,[status(cth)],[diff_n5_n3_only_n2]) ).
cnf(c_0_17,plain,
( sum(X1,X2,X3)
| ~ rdn_digit_add(rdnn(X4),rdnn(X5),rdnn(n5),rdnn(n0))
| ~ rdn_translate(X3,rdn_pos(rdnn(n5)))
| ~ rdn_translate(X2,rdn_pos(rdnn(X5)))
| ~ rdn_translate(X1,rdn_pos(rdnn(X4))) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
rdn_digit_add(rdnn(n3),rdnn(n2),rdnn(n5),rdnn(n0)),
inference(split_conjunct,[status(thm)],[rdn_digit_add_n3_n2_n5_n0]) ).
fof(c_0_19,plain,
! [X34,X35,X36] :
( ( ~ sum(X35,X36,X34)
| difference(X34,X35,X36) )
& ( ~ difference(X34,X35,X36)
| sum(X35,X36,X34) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[minus_entry_point])]) ).
fof(c_0_20,negated_conjecture,
( difference(n5,n3,esk1_0)
& esk1_0 != n2 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])]) ).
cnf(c_0_21,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X3,rdn_pos(rdnn(n5)))
| ~ rdn_translate(X2,rdn_pos(rdnn(n2)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n3))) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
rdn_translate(n5,rdn_pos(rdnn(n5))),
inference(split_conjunct,[status(thm)],[rdn5]) ).
fof(c_0_23,plain,
! [X77,X78,X79,X80] :
( ~ sum(X77,X78,X80)
| ~ sum(X77,X79,X80)
| X78 = X79 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unique_RHS])]) ).
cnf(c_0_24,plain,
( sum(X2,X3,X1)
| ~ difference(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,negated_conjecture,
difference(n5,n3,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
( sum(X1,X2,n5)
| ~ rdn_translate(X2,rdn_pos(rdnn(n2)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n3))) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
inference(split_conjunct,[status(thm)],[rdn2]) ).
cnf(c_0_28,plain,
( X2 = X4
| ~ sum(X1,X2,X3)
| ~ sum(X1,X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,negated_conjecture,
sum(n3,esk1_0,n5),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
( sum(X1,n2,n5)
| ~ rdn_translate(X1,rdn_pos(rdnn(n3))) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
rdn_translate(n3,rdn_pos(rdnn(n3))),
inference(split_conjunct,[status(thm)],[rdn3]) ).
cnf(c_0_32,negated_conjecture,
( X1 = esk1_0
| ~ sum(n3,X1,n5) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
sum(n3,n2,n5),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
esk1_0 != n2,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.14 % Problem : NUM335+1 : TPTP v8.1.2. Released v3.1.0.
% 0.14/0.16 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n026.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 2400
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon Oct 2 13:52:44 EDT 2023
% 0.16/0.37 % CPUTime :
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 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/tmp/tmp.t8Yvqd1v7w/E---3.1_21673.p
% 0.23/0.61 # Version: 3.1pre001
% 0.23/0.61 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.23/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.61 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.23/0.61 # Starting new_bool_3 with 600s (2) cores
% 0.23/0.61 # Starting new_bool_1 with 600s (2) cores
% 0.23/0.61 # Starting sh5l with 300s (1) cores
% 0.23/0.61 # new_bool_1 with pid 21794 completed with status 0
% 0.23/0.61 # Result found by new_bool_1
% 0.23/0.61 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.23/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.61 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.23/0.61 # Starting new_bool_3 with 600s (2) cores
% 0.23/0.61 # Starting new_bool_1 with 600s (2) cores
% 0.23/0.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.61 # Search class: FHUSF-FFMM21-SFFFFFNN
% 0.23/0.61 # partial match(1): FHUNF-FFMM21-SFFFFFNN
% 0.23/0.61 # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.23/0.61 # Starting SAT001_MinMin_p005000_rr_RG with 361s (1) cores
% 0.23/0.61 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 61s (1) cores
% 0.23/0.61 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 21799 completed with status 0
% 0.23/0.61 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.23/0.61 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.23/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.61 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.23/0.61 # Starting new_bool_3 with 600s (2) cores
% 0.23/0.61 # Starting new_bool_1 with 600s (2) cores
% 0.23/0.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.61 # Search class: FHUSF-FFMM21-SFFFFFNN
% 0.23/0.61 # partial match(1): FHUNF-FFMM21-SFFFFFNN
% 0.23/0.61 # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.23/0.61 # Starting SAT001_MinMin_p005000_rr_RG with 361s (1) cores
% 0.23/0.61 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 61s (1) cores
% 0.23/0.61 # Preprocessing time : 0.003 s
% 0.23/0.61 # Presaturation interreduction done
% 0.23/0.61
% 0.23/0.61 # Proof found!
% 0.23/0.61 # SZS status Theorem
% 0.23/0.61 # SZS output start CNFRefutation
% See solution above
% 0.23/0.61 # Parsed axioms : 402
% 0.23/0.61 # Removed by relevancy pruning/SinE : 265
% 0.23/0.61 # Initial clauses : 139
% 0.23/0.61 # Removed in clause preprocessing : 0
% 0.23/0.61 # Initial clauses in saturation : 139
% 0.23/0.61 # Processed clauses : 856
% 0.23/0.61 # ...of these trivial : 0
% 0.23/0.61 # ...subsumed : 120
% 0.23/0.61 # ...remaining for further processing : 736
% 0.23/0.61 # Other redundant clauses eliminated : 0
% 0.23/0.61 # Clauses deleted for lack of memory : 0
% 0.23/0.61 # Backward-subsumed : 0
% 0.23/0.61 # Backward-rewritten : 0
% 0.23/0.61 # Generated clauses : 978
% 0.23/0.61 # ...of the previous two non-redundant : 976
% 0.23/0.61 # ...aggressively subsumed : 0
% 0.23/0.61 # Contextual simplify-reflections : 0
% 0.23/0.61 # Paramodulations : 978
% 0.23/0.61 # Factorizations : 0
% 0.23/0.61 # NegExts : 0
% 0.23/0.61 # Equation resolutions : 0
% 0.23/0.61 # Total rewrite steps : 0
% 0.23/0.61 # Propositional unsat checks : 0
% 0.23/0.61 # Propositional check models : 0
% 0.23/0.61 # Propositional check unsatisfiable : 0
% 0.23/0.61 # Propositional clauses : 0
% 0.23/0.61 # Propositional clauses after purity: 0
% 0.23/0.61 # Propositional unsat core size : 0
% 0.23/0.61 # Propositional preprocessing time : 0.000
% 0.23/0.61 # Propositional encoding time : 0.000
% 0.23/0.61 # Propositional solver time : 0.000
% 0.23/0.61 # Success case prop preproc time : 0.000
% 0.23/0.61 # Success case prop encoding time : 0.000
% 0.23/0.61 # Success case prop solver time : 0.000
% 0.23/0.61 # Current number of processed clauses : 597
% 0.23/0.61 # Positive orientable unit clauses : 159
% 0.23/0.61 # Positive unorientable unit clauses: 0
% 0.23/0.61 # Negative unit clauses : 1
% 0.23/0.61 # Non-unit-clauses : 437
% 0.23/0.61 # Current number of unprocessed clauses: 395
% 0.23/0.61 # ...number of literals in the above : 1859
% 0.23/0.61 # Current number of archived formulas : 0
% 0.23/0.61 # Current number of archived clauses : 139
% 0.23/0.61 # Clause-clause subsumption calls (NU) : 49934
% 0.23/0.61 # Rec. Clause-clause subsumption calls : 34062
% 0.23/0.61 # Non-unit clause-clause subsumptions : 120
% 0.23/0.61 # Unit Clause-clause subsumption calls : 149
% 0.23/0.61 # Rewrite failures with RHS unbound : 0
% 0.23/0.61 # BW rewrite match attempts : 0
% 0.23/0.61 # BW rewrite match successes : 0
% 0.23/0.61 # Condensation attempts : 0
% 0.23/0.61 # Condensation successes : 0
% 0.23/0.61 # Termbank termtop insertions : 36024
% 0.23/0.61
% 0.23/0.61 # -------------------------------------------------
% 0.23/0.61 # User time : 0.060 s
% 0.23/0.61 # System time : 0.010 s
% 0.23/0.61 # Total time : 0.069 s
% 0.23/0.61 # Maximum resident set size: 2980 pages
% 0.23/0.61
% 0.23/0.61 # -------------------------------------------------
% 0.23/0.61 # User time : 0.126 s
% 0.23/0.61 # System time : 0.018 s
% 0.23/0.61 # Total time : 0.144 s
% 0.23/0.61 # Maximum resident set size: 2036 pages
% 0.23/0.61 % E---3.1 exiting
% 0.23/0.61 % E---3.1 exiting
%------------------------------------------------------------------------------