TSTP Solution File: NUM293+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM293+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:58:41 EDT 2023
% Result : Theorem 0.52s 0.55s
% Output : CNFRefutation 0.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 23 ( 13 unt; 0 def)
% Number of atoms : 39 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 32 ( 16 ~; 11 |; 2 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 30 ( 4 sgn; 17 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(something_less_n13,conjecture,
? [X1] : less(X1,n13),
file('/export/starexec/sandbox/tmp/tmp.AVLB0Fhwdl/E---3.1_27771.p',something_less_n13) ).
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/tmp/tmp.AVLB0Fhwdl/E---3.1_27771.p',less_entry_point_pos_pos) ).
fof(rdn13,axiom,
rdn_translate(n13,rdn_pos(rdn(rdnn(n3),rdnn(n1)))),
file('/export/starexec/sandbox/tmp/tmp.AVLB0Fhwdl/E---3.1_27771.p',rdn13) ).
fof(rdn_non_zero_by_digit,axiom,
! [X1] :
( rdn_non_zero_digit(rdnn(X1))
=> rdn_non_zero(rdnn(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.AVLB0Fhwdl/E---3.1_27771.p',rdn_non_zero_by_digit) ).
fof(rdn9,axiom,
rdn_translate(n9,rdn_pos(rdnn(n9))),
file('/export/starexec/sandbox/tmp/tmp.AVLB0Fhwdl/E---3.1_27771.p',rdn9) ).
fof(rdn_extra_digits_positive_less,axiom,
! [X9,X6,X7] :
( rdn_non_zero(X7)
=> rdn_positive_less(rdnn(X9),rdn(rdnn(X6),X7)) ),
file('/export/starexec/sandbox/tmp/tmp.AVLB0Fhwdl/E---3.1_27771.p',rdn_extra_digits_positive_less) ).
fof(rdn_digit1,axiom,
rdn_non_zero_digit(rdnn(n1)),
file('/export/starexec/sandbox/tmp/tmp.AVLB0Fhwdl/E---3.1_27771.p',rdn_digit1) ).
fof(c_0_7,negated_conjecture,
~ ? [X1] : less(X1,n13),
inference(assume_negation,[status(cth)],[something_less_n13]) ).
fof(c_0_8,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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_entry_point_pos_pos])]) ).
fof(c_0_9,negated_conjecture,
! [X33] : ~ less(X33,n13),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])]) ).
cnf(c_0_10,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_8]) ).
cnf(c_0_11,plain,
rdn_translate(n13,rdn_pos(rdn(rdnn(n3),rdnn(n1)))),
inference(split_conjunct,[status(thm)],[rdn13]) ).
cnf(c_0_12,negated_conjecture,
~ less(X1,n13),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X110] :
( ~ rdn_non_zero_digit(rdnn(X110))
| rdn_non_zero(rdnn(X110)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdn_non_zero_by_digit])]) ).
cnf(c_0_14,plain,
( ~ rdn_positive_less(X1,rdn(rdnn(n3),rdnn(n1)))
| ~ rdn_translate(X2,rdn_pos(X1)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_15,plain,
rdn_translate(n9,rdn_pos(rdnn(n9))),
inference(split_conjunct,[status(thm)],[rdn9]) ).
fof(c_0_16,plain,
! [X63,X64,X65] :
( ~ rdn_non_zero(X65)
| rdn_positive_less(rdnn(X63),rdn(rdnn(X64),X65)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdn_extra_digits_positive_less])]) ).
cnf(c_0_17,plain,
( rdn_non_zero(rdnn(X1))
| ~ rdn_non_zero_digit(rdnn(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
rdn_non_zero_digit(rdnn(n1)),
inference(split_conjunct,[status(thm)],[rdn_digit1]) ).
cnf(c_0_19,plain,
~ rdn_positive_less(rdnn(n9),rdn(rdnn(n3),rdnn(n1))),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( rdn_positive_less(rdnn(X2),rdn(rdnn(X3),X1))
| ~ rdn_non_zero(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
rdn_non_zero(rdnn(n1)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NUM293+1 : TPTP v8.1.2. Released v3.1.0.
% 0.04/0.13 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n023.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 13:54:37 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.50 Running first-order model finding
% 0.21/0.50 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.AVLB0Fhwdl/E---3.1_27771.p
% 0.52/0.55 # Version: 3.1pre001
% 0.52/0.55 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.52/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.52/0.55 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.52/0.55 # Starting new_bool_3 with 600s (2) cores
% 0.52/0.55 # Starting new_bool_1 with 600s (2) cores
% 0.52/0.55 # Starting sh5l with 300s (1) cores
% 0.52/0.55 # sh5l with pid 27851 completed with status 0
% 0.52/0.55 # Result found by sh5l
% 0.52/0.55 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.52/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.52/0.55 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.52/0.55 # Starting new_bool_3 with 600s (2) cores
% 0.52/0.55 # Starting new_bool_1 with 600s (2) cores
% 0.52/0.55 # Starting sh5l with 300s (1) cores
% 0.52/0.55 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.52/0.55 # Search class: FGHSF-FFLM21-MFFFFFNN
% 0.52/0.55 # partial match(1): FGHSF-FSLM21-MFFFFFNN
% 0.52/0.55 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.52/0.55 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 0.52/0.55 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 27856 completed with status 0
% 0.52/0.55 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 0.52/0.55 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.52/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.52/0.55 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.52/0.55 # Starting new_bool_3 with 600s (2) cores
% 0.52/0.55 # Starting new_bool_1 with 600s (2) cores
% 0.52/0.55 # Starting sh5l with 300s (1) cores
% 0.52/0.55 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.52/0.55 # Search class: FGHSF-FFLM21-MFFFFFNN
% 0.52/0.55 # partial match(1): FGHSF-FSLM21-MFFFFFNN
% 0.52/0.55 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.52/0.55 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 0.52/0.55 # Preprocessing time : 0.003 s
% 0.52/0.55 # Presaturation interreduction done
% 0.52/0.55
% 0.52/0.55 # Proof found!
% 0.52/0.55 # SZS status Theorem
% 0.52/0.55 # SZS output start CNFRefutation
% See solution above
% 0.52/0.55 # Parsed axioms : 402
% 0.52/0.55 # Removed by relevancy pruning/SinE : 246
% 0.52/0.55 # Initial clauses : 160
% 0.52/0.55 # Removed in clause preprocessing : 0
% 0.52/0.55 # Initial clauses in saturation : 160
% 0.52/0.55 # Processed clauses : 234
% 0.52/0.55 # ...of these trivial : 0
% 0.52/0.55 # ...subsumed : 7
% 0.52/0.55 # ...remaining for further processing : 227
% 0.52/0.55 # Other redundant clauses eliminated : 2
% 0.52/0.55 # Clauses deleted for lack of memory : 0
% 0.52/0.55 # Backward-subsumed : 2
% 0.52/0.55 # Backward-rewritten : 0
% 0.52/0.55 # Generated clauses : 67
% 0.52/0.55 # ...of the previous two non-redundant : 62
% 0.52/0.55 # ...aggressively subsumed : 0
% 0.52/0.55 # Contextual simplify-reflections : 0
% 0.52/0.55 # Paramodulations : 63
% 0.52/0.55 # Factorizations : 2
% 0.52/0.55 # NegExts : 0
% 0.52/0.55 # Equation resolutions : 2
% 0.52/0.55 # Total rewrite steps : 1
% 0.52/0.55 # Propositional unsat checks : 0
% 0.52/0.55 # Propositional check models : 0
% 0.52/0.55 # Propositional check unsatisfiable : 0
% 0.52/0.55 # Propositional clauses : 0
% 0.52/0.55 # Propositional clauses after purity: 0
% 0.52/0.55 # Propositional unsat core size : 0
% 0.52/0.55 # Propositional preprocessing time : 0.000
% 0.52/0.55 # Propositional encoding time : 0.000
% 0.52/0.55 # Propositional solver time : 0.000
% 0.52/0.55 # Success case prop preproc time : 0.000
% 0.52/0.55 # Success case prop encoding time : 0.000
% 0.52/0.55 # Success case prop solver time : 0.000
% 0.52/0.55 # Current number of processed clauses : 63
% 0.52/0.55 # Positive orientable unit clauses : 42
% 0.52/0.55 # Positive unorientable unit clauses: 0
% 0.52/0.55 # Negative unit clauses : 4
% 0.52/0.55 # Non-unit-clauses : 17
% 0.52/0.55 # Current number of unprocessed clauses: 138
% 0.52/0.55 # ...number of literals in the above : 200
% 0.52/0.55 # Current number of archived formulas : 0
% 0.52/0.55 # Current number of archived clauses : 162
% 0.52/0.55 # Clause-clause subsumption calls (NU) : 632
% 0.52/0.55 # Rec. Clause-clause subsumption calls : 285
% 0.52/0.55 # Non-unit clause-clause subsumptions : 4
% 0.52/0.55 # Unit Clause-clause subsumption calls : 24
% 0.52/0.55 # Rewrite failures with RHS unbound : 0
% 0.52/0.55 # BW rewrite match attempts : 0
% 0.52/0.55 # BW rewrite match successes : 0
% 0.52/0.55 # Condensation attempts : 0
% 0.52/0.55 # Condensation successes : 0
% 0.52/0.55 # Termbank termtop insertions : 11649
% 0.52/0.55
% 0.52/0.55 # -------------------------------------------------
% 0.52/0.55 # User time : 0.015 s
% 0.52/0.55 # System time : 0.006 s
% 0.52/0.55 # Total time : 0.020 s
% 0.52/0.55 # Maximum resident set size: 2768 pages
% 0.52/0.55
% 0.52/0.55 # -------------------------------------------------
% 0.52/0.55 # User time : 0.020 s
% 0.52/0.55 # System time : 0.010 s
% 0.52/0.55 # Total time : 0.030 s
% 0.52/0.55 # Maximum resident set size: 2036 pages
% 0.52/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------