TSTP Solution File: NUM303+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM303+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:46:17 EDT 2023
% Result : Theorem 0.82s 0.58s
% Output : CNFRefutation 0.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 25 ( 14 unt; 0 def)
% Number of atoms : 50 ( 8 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 48 ( 23 ~; 15 |; 6 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 37 ( 4 sgn; 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(n31_not_n12,conjecture,
n31 != n21,
file('/export/starexec/sandbox2/tmp/tmp.wGXeJ8jnYT/E---3.1_2066.p',n31_not_n12) ).
fof(less_property,axiom,
! [X1,X2] :
( less(X1,X2)
<=> ( ~ less(X2,X1)
& X2 != X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.wGXeJ8jnYT/E---3.1_2066.p',less_property) ).
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/sandbox2/tmp/tmp.wGXeJ8jnYT/E---3.1_2066.p',less_entry_point_pos_pos) ).
fof(rdn31,axiom,
rdn_translate(n31,rdn_pos(rdn(rdnn(n1),rdnn(n3)))),
file('/export/starexec/sandbox2/tmp/tmp.wGXeJ8jnYT/E---3.1_2066.p',rdn31) ).
fof(rdn_positive_less_multi_digit_high,axiom,
! [X4,X5,X6,X7] :
( rdn_positive_less(X5,X7)
=> rdn_positive_less(rdn(rdnn(X4),X5),rdn(rdnn(X6),X7)) ),
file('/export/starexec/sandbox2/tmp/tmp.wGXeJ8jnYT/E---3.1_2066.p',rdn_positive_less_multi_digit_high) ).
fof(rdn21,axiom,
rdn_translate(n21,rdn_pos(rdn(rdnn(n1),rdnn(n2)))),
file('/export/starexec/sandbox2/tmp/tmp.wGXeJ8jnYT/E---3.1_2066.p',rdn21) ).
fof(rdn_positive_less23,axiom,
rdn_positive_less(rdnn(n2),rdnn(n3)),
file('/export/starexec/sandbox2/tmp/tmp.wGXeJ8jnYT/E---3.1_2066.p',rdn_positive_less23) ).
fof(c_0_7,negated_conjecture,
n31 = n21,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[n31_not_n12])]) ).
fof(c_0_8,plain,
! [X1,X2] :
( less(X1,X2)
<=> ( ~ less(X2,X1)
& X2 != X1 ) ),
inference(fof_simplification,[status(thm)],[less_property]) ).
fof(c_0_9,plain,
! [X46,X47,X48,X49] :
( ~ rdn_translate(X46,rdn_pos(X48))
| ~ rdn_translate(X47,rdn_pos(X49))
| ~ rdn_positive_less(X48,X49)
| less(X46,X47) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_entry_point_pos_pos])]) ).
cnf(c_0_10,plain,
rdn_translate(n31,rdn_pos(rdn(rdnn(n1),rdnn(n3)))),
inference(split_conjunct,[status(thm)],[rdn31]) ).
cnf(c_0_11,negated_conjecture,
n31 = n21,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,plain,
! [X94,X95] :
( ( ~ less(X95,X94)
| ~ less(X94,X95) )
& ( X95 != X94
| ~ less(X94,X95) )
& ( less(X95,X94)
| X95 = X94
| less(X94,X95) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
cnf(c_0_13,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_9]) ).
cnf(c_0_14,plain,
rdn_translate(n21,rdn_pos(rdn(rdnn(n1),rdnn(n3)))),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( X1 != X2
| ~ less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X36,X37,X38,X39] :
( ~ rdn_positive_less(X37,X39)
| rdn_positive_less(rdn(rdnn(X36),X37),rdn(rdnn(X38),X39)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdn_positive_less_multi_digit_high])]) ).
cnf(c_0_17,plain,
( less(X1,n21)
| ~ rdn_positive_less(X2,rdn(rdnn(n1),rdnn(n3)))
| ~ rdn_translate(X1,rdn_pos(X2)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
rdn_translate(n21,rdn_pos(rdn(rdnn(n1),rdnn(n2)))),
inference(split_conjunct,[status(thm)],[rdn21]) ).
cnf(c_0_19,plain,
~ less(X1,X1),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( rdn_positive_less(rdn(rdnn(X3),X1),rdn(rdnn(X4),X2))
| ~ rdn_positive_less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(split_conjunct,[status(thm)],[rdn_positive_less23]) ).
cnf(c_0_22,plain,
~ rdn_positive_less(rdn(rdnn(n1),rdnn(n2)),rdn(rdnn(n1),rdnn(n3))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_23,plain,
rdn_positive_less(rdn(rdnn(X1),rdnn(n2)),rdn(rdnn(X2),rdnn(n3))),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.12 % Problem : NUM303+1 : TPTP v8.1.2. Released v3.1.0.
% 0.13/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n023.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 : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 14:42:22 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.49 Running first-order theorem proving
% 0.19/0.49 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.wGXeJ8jnYT/E---3.1_2066.p
% 0.82/0.58 # Version: 3.1pre001
% 0.82/0.58 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.82/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.82/0.58 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.82/0.58 # Starting new_bool_3 with 600s (2) cores
% 0.82/0.58 # Starting new_bool_1 with 600s (2) cores
% 0.82/0.58 # Starting sh5l with 300s (1) cores
% 0.82/0.58 # sh5l with pid 2156 completed with status 0
% 0.82/0.58 # Result found by sh5l
% 0.82/0.58 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.82/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.82/0.58 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.82/0.58 # Starting new_bool_3 with 600s (2) cores
% 0.82/0.58 # Starting new_bool_1 with 600s (2) cores
% 0.82/0.58 # Starting sh5l with 300s (1) cores
% 0.82/0.58 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.82/0.58 # Search class: FGHSF-FFLM21-MFFFFFNN
% 0.82/0.58 # partial match(1): FGHSF-FSLM21-MFFFFFNN
% 0.82/0.58 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.82/0.58 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 0.82/0.58 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 2161 completed with status 0
% 0.82/0.58 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 0.82/0.58 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.82/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.82/0.58 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.82/0.58 # Starting new_bool_3 with 600s (2) cores
% 0.82/0.58 # Starting new_bool_1 with 600s (2) cores
% 0.82/0.58 # Starting sh5l with 300s (1) cores
% 0.82/0.58 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.82/0.58 # Search class: FGHSF-FFLM21-MFFFFFNN
% 0.82/0.58 # partial match(1): FGHSF-FSLM21-MFFFFFNN
% 0.82/0.58 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.82/0.58 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 0.82/0.58 # Preprocessing time : 0.003 s
% 0.82/0.58 # Presaturation interreduction done
% 0.82/0.58
% 0.82/0.58 # Proof found!
% 0.82/0.58 # SZS status Theorem
% 0.82/0.58 # SZS output start CNFRefutation
% See solution above
% 0.82/0.58 # Parsed axioms : 402
% 0.82/0.58 # Removed by relevancy pruning/SinE : 254
% 0.82/0.58 # Initial clauses : 152
% 0.82/0.58 # Removed in clause preprocessing : 0
% 0.82/0.58 # Initial clauses in saturation : 152
% 0.82/0.58 # Processed clauses : 699
% 0.82/0.58 # ...of these trivial : 0
% 0.82/0.58 # ...subsumed : 4
% 0.82/0.58 # ...remaining for further processing : 695
% 0.82/0.58 # Other redundant clauses eliminated : 2
% 0.82/0.58 # Clauses deleted for lack of memory : 0
% 0.82/0.58 # Backward-subsumed : 0
% 0.82/0.58 # Backward-rewritten : 1
% 0.82/0.58 # Generated clauses : 1128
% 0.82/0.58 # ...of the previous two non-redundant : 904
% 0.82/0.58 # ...aggressively subsumed : 0
% 0.82/0.58 # Contextual simplify-reflections : 0
% 0.82/0.58 # Paramodulations : 1124
% 0.82/0.58 # Factorizations : 2
% 0.82/0.58 # NegExts : 0
% 0.82/0.58 # Equation resolutions : 2
% 0.82/0.58 # Total rewrite steps : 266
% 0.82/0.58 # Propositional unsat checks : 0
% 0.82/0.58 # Propositional check models : 0
% 0.82/0.58 # Propositional check unsatisfiable : 0
% 0.82/0.58 # Propositional clauses : 0
% 0.82/0.58 # Propositional clauses after purity: 0
% 0.82/0.58 # Propositional unsat core size : 0
% 0.82/0.58 # Propositional preprocessing time : 0.000
% 0.82/0.58 # Propositional encoding time : 0.000
% 0.82/0.58 # Propositional solver time : 0.000
% 0.82/0.58 # Success case prop preproc time : 0.000
% 0.82/0.58 # Success case prop encoding time : 0.000
% 0.82/0.58 # Success case prop solver time : 0.000
% 0.82/0.58 # Current number of processed clauses : 540
% 0.82/0.58 # Positive orientable unit clauses : 256
% 0.82/0.58 # Positive unorientable unit clauses: 0
% 0.82/0.58 # Negative unit clauses : 104
% 0.82/0.58 # Non-unit-clauses : 180
% 0.82/0.58 # Current number of unprocessed clauses: 509
% 0.82/0.58 # ...number of literals in the above : 2041
% 0.82/0.58 # Current number of archived formulas : 0
% 0.82/0.58 # Current number of archived clauses : 153
% 0.82/0.58 # Clause-clause subsumption calls (NU) : 3509
% 0.82/0.58 # Rec. Clause-clause subsumption calls : 2799
% 0.82/0.58 # Non-unit clause-clause subsumptions : 4
% 0.82/0.58 # Unit Clause-clause subsumption calls : 9922
% 0.82/0.58 # Rewrite failures with RHS unbound : 0
% 0.82/0.58 # BW rewrite match attempts : 51
% 0.82/0.58 # BW rewrite match successes : 1
% 0.82/0.58 # Condensation attempts : 0
% 0.82/0.58 # Condensation successes : 0
% 0.82/0.58 # Termbank termtop insertions : 31459
% 0.82/0.58
% 0.82/0.58 # -------------------------------------------------
% 0.82/0.58 # User time : 0.049 s
% 0.82/0.58 # System time : 0.006 s
% 0.82/0.58 # Total time : 0.056 s
% 0.82/0.58 # Maximum resident set size: 2764 pages
% 0.82/0.58
% 0.82/0.58 # -------------------------------------------------
% 0.82/0.58 # User time : 0.057 s
% 0.82/0.58 # System time : 0.009 s
% 0.82/0.58 # Total time : 0.065 s
% 0.82/0.58 # Maximum resident set size: 2036 pages
% 0.82/0.58 % E---3.1 exiting
% 0.82/0.58 % E---3.1 exiting
%------------------------------------------------------------------------------