TSTP Solution File: NUM316+1 by E-SAT---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.2.0
% Problem : NUM316+1 : TPTP v8.2.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d SAT
% Computer : n001.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 : Mon Jun 24 12:40:07 EDT 2024
% Result : Theorem 1.37s 0.72s
% Output : CNFRefutation 1.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 39 ( 24 unt; 0 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 66 ( 30 ~; 27 |; 6 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-1 aty)
% Number of variables : 52 ( 0 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(rdn_positive_less_transitivity,axiom,
! [X1,X2,X3] :
( ( rdn_positive_less(rdnn(X1),rdnn(X2))
& rdn_positive_less(rdnn(X2),rdnn(X3)) )
=> rdn_positive_less(rdnn(X1),rdnn(X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.RSdi7EdqGE/E---3.1_24915.p',rdn_positive_less_transitivity) ).
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.RSdi7EdqGE/E---3.1_24915.p',add_digit_digit_digit) ).
fof(rdn_positive_less34,axiom,
rdn_positive_less(rdnn(n3),rdnn(n4)),
file('/export/starexec/sandbox2/tmp/tmp.RSdi7EdqGE/E---3.1_24915.p',rdn_positive_less34) ).
fof(rdn_digit_add_n5_n0_n5_n0,axiom,
rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
file('/export/starexec/sandbox2/tmp/tmp.RSdi7EdqGE/E---3.1_24915.p',rdn_digit_add_n5_n0_n5_n0) ).
fof(rdn_positive_less45,axiom,
rdn_positive_less(rdnn(n4),rdnn(n5)),
file('/export/starexec/sandbox2/tmp/tmp.RSdi7EdqGE/E---3.1_24915.p',rdn_positive_less45) ).
fof(rdn_positive_less23,axiom,
rdn_positive_less(rdnn(n2),rdnn(n3)),
file('/export/starexec/sandbox2/tmp/tmp.RSdi7EdqGE/E---3.1_24915.p',rdn_positive_less23) ).
fof(sum_entry_point_pos_neg_1,axiom,
! [X1,X2,X3,X10,X11,X12] :
( ( rdn_translate(X1,rdn_pos(X10))
& rdn_translate(X2,rdn_neg(X11))
& rdn_positive_less(X10,X11)
& rdn_add_with_carry(rdnn(n0),X10,X12,X11)
& rdn_translate(X3,rdn_neg(X12)) )
=> sum(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.RSdi7EdqGE/E---3.1_24915.p',sum_entry_point_pos_neg_1) ).
fof(rdn_digit_add_n2_n3_n5_n0,axiom,
rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
file('/export/starexec/sandbox2/tmp/tmp.RSdi7EdqGE/E---3.1_24915.p',rdn_digit_add_n2_n3_n5_n0) ).
fof(rdnn3,axiom,
rdn_translate(nn3,rdn_neg(rdnn(n3))),
file('/export/starexec/sandbox2/tmp/tmp.RSdi7EdqGE/E---3.1_24915.p',rdnn3) ).
fof(sum_n2_nn5_nn3,conjecture,
sum(n2,nn5,nn3),
file('/export/starexec/sandbox2/tmp/tmp.RSdi7EdqGE/E---3.1_24915.p',sum_n2_nn5_nn3) ).
fof(rdnn5,axiom,
rdn_translate(nn5,rdn_neg(rdnn(n5))),
file('/export/starexec/sandbox2/tmp/tmp.RSdi7EdqGE/E---3.1_24915.p',rdnn5) ).
fof(rdn2,axiom,
rdn_translate(n2,rdn_pos(rdnn(n2))),
file('/export/starexec/sandbox2/tmp/tmp.RSdi7EdqGE/E---3.1_24915.p',rdn2) ).
fof(c_0_12,plain,
! [X116,X117,X118] :
( ~ rdn_positive_less(rdnn(X116),rdnn(X117))
| ~ rdn_positive_less(rdnn(X117),rdnn(X118))
| rdn_positive_less(rdnn(X116),rdnn(X118)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdn_positive_less_transitivity])])]) ).
fof(c_0_13,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(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[add_digit_digit_digit])])]) ).
cnf(c_0_14,plain,
( rdn_positive_less(rdnn(X1),rdnn(X3))
| ~ rdn_positive_less(rdnn(X1),rdnn(X2))
| ~ rdn_positive_less(rdnn(X2),rdnn(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
rdn_positive_less(rdnn(n3),rdnn(n4)),
inference(split_conjunct,[status(thm)],[rdn_positive_less34]) ).
cnf(c_0_16,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_13]) ).
cnf(c_0_17,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_18,plain,
rdn_positive_less(rdnn(n4),rdnn(n5)),
inference(split_conjunct,[status(thm)],[rdn_positive_less45]) ).
cnf(c_0_19,plain,
( rdn_positive_less(rdnn(X1),rdnn(n4))
| ~ rdn_positive_less(rdnn(X1),rdnn(n3)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(split_conjunct,[status(thm)],[rdn_positive_less23]) ).
fof(c_0_21,plain,
! [X45,X46,X47,X48,X49,X50] :
( ~ rdn_translate(X45,rdn_pos(X48))
| ~ rdn_translate(X46,rdn_neg(X49))
| ~ rdn_positive_less(X48,X49)
| ~ rdn_add_with_carry(rdnn(n0),X48,X50,X49)
| ~ rdn_translate(X47,rdn_neg(X50))
| sum(X45,X46,X47) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sum_entry_point_pos_neg_1])])]) ).
cnf(c_0_22,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_16,c_0_17]) ).
cnf(c_0_23,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_24,plain,
( rdn_positive_less(rdnn(X1),rdnn(n5))
| ~ rdn_positive_less(rdnn(X1),rdnn(n4)) ),
inference(spm,[status(thm)],[c_0_14,c_0_18]) ).
cnf(c_0_25,plain,
rdn_positive_less(rdnn(n2),rdnn(n4)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
( sum(X1,X3,X6)
| ~ rdn_translate(X1,rdn_pos(X2))
| ~ rdn_translate(X3,rdn_neg(X4))
| ~ rdn_positive_less(X2,X4)
| ~ rdn_add_with_carry(rdnn(n0),X2,X5,X4)
| ~ rdn_translate(X6,rdn_neg(X5)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
rdn_add_with_carry(rdnn(n0),rdnn(n2),rdnn(n3),rdnn(n5)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
rdn_positive_less(rdnn(n2),rdnn(n5)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
( sum(X1,X2,X3)
| ~ rdn_translate(X3,rdn_neg(rdnn(n3)))
| ~ rdn_translate(X2,rdn_neg(rdnn(n5)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n2))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_30,plain,
rdn_translate(nn3,rdn_neg(rdnn(n3))),
inference(split_conjunct,[status(thm)],[rdnn3]) ).
fof(c_0_31,negated_conjecture,
~ sum(n2,nn5,nn3),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[sum_n2_nn5_nn3])]) ).
cnf(c_0_32,plain,
( sum(X1,X2,nn3)
| ~ rdn_translate(X2,rdn_neg(rdnn(n5)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n2))) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
rdn_translate(nn5,rdn_neg(rdnn(n5))),
inference(split_conjunct,[status(thm)],[rdnn5]) ).
fof(c_0_34,negated_conjecture,
~ sum(n2,nn5,nn3),
inference(fof_nnf,[status(thm)],[c_0_31]) ).
cnf(c_0_35,plain,
( sum(X1,nn5,nn3)
| ~ rdn_translate(X1,rdn_pos(rdnn(n2))) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
inference(split_conjunct,[status(thm)],[rdn2]) ).
cnf(c_0_37,negated_conjecture,
~ sum(n2,nn5,nn3),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_38,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM316+1 : TPTP v8.2.0. Released v3.1.0.
% 0.07/0.13 % Command : run_E %s %d SAT
% 0.13/0.34 % Computer : n001.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun Jun 23 01:05:09 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.21/0.56 Running first-order model finding
% 0.21/0.56 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.RSdi7EdqGE/E---3.1_24915.p
% 1.37/0.72 # Version: 3.2.0
% 1.37/0.72 # Preprocessing class: FSLMSMSLSSSNFFN.
% 1.37/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.37/0.72 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 1.37/0.72 # Starting new_bool_3 with 600s (2) cores
% 1.37/0.72 # Starting new_bool_1 with 600s (2) cores
% 1.37/0.72 # Starting sh5l with 300s (1) cores
% 1.37/0.72 # sh5l with pid 25037 completed with status 0
% 1.37/0.72 # Result found by sh5l
% 1.37/0.72 # Preprocessing class: FSLMSMSLSSSNFFN.
% 1.37/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.37/0.72 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 1.37/0.72 # Starting new_bool_3 with 600s (2) cores
% 1.37/0.72 # Starting new_bool_1 with 600s (2) cores
% 1.37/0.72 # Starting sh5l with 300s (1) cores
% 1.37/0.72 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.37/0.72 # Search class: FGHSF-FFLM21-SFFFFFNN
% 1.37/0.72 # partial match(1): FGHSF-FFMM21-SFFFFFNN
% 1.37/0.72 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.37/0.72 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 1.37/0.72 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 25045 completed with status 0
% 1.37/0.72 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 1.37/0.72 # Preprocessing class: FSLMSMSLSSSNFFN.
% 1.37/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.37/0.72 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 1.37/0.72 # Starting new_bool_3 with 600s (2) cores
% 1.37/0.72 # Starting new_bool_1 with 600s (2) cores
% 1.37/0.72 # Starting sh5l with 300s (1) cores
% 1.37/0.72 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.37/0.72 # Search class: FGHSF-FFLM21-SFFFFFNN
% 1.37/0.72 # partial match(1): FGHSF-FFMM21-SFFFFFNN
% 1.37/0.72 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.37/0.72 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 1.37/0.72 # Preprocessing time : 0.003 s
% 1.37/0.72 # Presaturation interreduction done
% 1.37/0.72
% 1.37/0.72 # Proof found!
% 1.37/0.72 # SZS status Theorem
% 1.37/0.72 # SZS output start CNFRefutation
% See solution above
% 1.37/0.72 # Parsed axioms : 402
% 1.37/0.72 # Removed by relevancy pruning/SinE : 245
% 1.37/0.72 # Initial clauses : 161
% 1.37/0.72 # Removed in clause preprocessing : 0
% 1.37/0.72 # Initial clauses in saturation : 161
% 1.37/0.72 # Processed clauses : 1742
% 1.37/0.72 # ...of these trivial : 0
% 1.37/0.72 # ...subsumed : 31
% 1.37/0.72 # ...remaining for further processing : 1711
% 1.37/0.72 # Other redundant clauses eliminated : 2
% 1.37/0.72 # Clauses deleted for lack of memory : 0
% 1.37/0.72 # Backward-subsumed : 21
% 1.37/0.72 # Backward-rewritten : 21
% 1.37/0.72 # Generated clauses : 2638
% 1.37/0.72 # ...of the previous two non-redundant : 2267
% 1.37/0.72 # ...aggressively subsumed : 0
% 1.37/0.72 # Contextual simplify-reflections : 0
% 1.37/0.72 # Paramodulations : 2634
% 1.37/0.72 # Factorizations : 2
% 1.37/0.72 # NegExts : 0
% 1.37/0.72 # Equation resolutions : 2
% 1.37/0.72 # Disequality decompositions : 0
% 1.37/0.72 # Total rewrite steps : 1250
% 1.37/0.72 # ...of those cached : 1058
% 1.37/0.72 # Propositional unsat checks : 0
% 1.37/0.72 # Propositional check models : 0
% 1.37/0.72 # Propositional check unsatisfiable : 0
% 1.37/0.72 # Propositional clauses : 0
% 1.37/0.72 # Propositional clauses after purity: 0
% 1.37/0.72 # Propositional unsat core size : 0
% 1.37/0.72 # Propositional preprocessing time : 0.000
% 1.37/0.72 # Propositional encoding time : 0.000
% 1.37/0.72 # Propositional solver time : 0.000
% 1.37/0.72 # Success case prop preproc time : 0.000
% 1.37/0.72 # Success case prop encoding time : 0.000
% 1.37/0.72 # Success case prop solver time : 0.000
% 1.37/0.72 # Current number of processed clauses : 1506
% 1.37/0.72 # Positive orientable unit clauses : 613
% 1.37/0.72 # Positive unorientable unit clauses: 0
% 1.37/0.72 # Negative unit clauses : 68
% 1.37/0.72 # Non-unit-clauses : 825
% 1.37/0.72 # Current number of unprocessed clauses: 847
% 1.37/0.72 # ...number of literals in the above : 2540
% 1.37/0.72 # Current number of archived formulas : 0
% 1.37/0.72 # Current number of archived clauses : 203
% 1.37/0.72 # Clause-clause subsumption calls (NU) : 148224
% 1.37/0.72 # Rec. Clause-clause subsumption calls : 111596
% 1.37/0.72 # Non-unit clause-clause subsumptions : 52
% 1.37/0.72 # Unit Clause-clause subsumption calls : 13470
% 1.37/0.72 # Rewrite failures with RHS unbound : 0
% 1.37/0.72 # BW rewrite match attempts : 1296
% 1.37/0.72 # BW rewrite match successes : 21
% 1.37/0.72 # Condensation attempts : 0
% 1.37/0.72 # Condensation successes : 0
% 1.37/0.72 # Termbank termtop insertions : 71877
% 1.37/0.72 # Search garbage collected termcells : 1839
% 1.37/0.72
% 1.37/0.72 # -------------------------------------------------
% 1.37/0.72 # User time : 0.128 s
% 1.37/0.72 # System time : 0.011 s
% 1.37/0.72 # Total time : 0.139 s
% 1.37/0.72 # Maximum resident set size: 2768 pages
% 1.37/0.72
% 1.37/0.72 # -------------------------------------------------
% 1.37/0.72 # User time : 0.135 s
% 1.37/0.72 # System time : 0.013 s
% 1.37/0.72 # Total time : 0.148 s
% 1.37/0.72 # Maximum resident set size: 2044 pages
% 1.37/0.72 % E---3.1 exiting
% 1.37/0.72 % E exiting
%------------------------------------------------------------------------------