TSTP Solution File: NUM299+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM299+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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.14s 0.44s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 27 ( 14 unt; 0 def)
% Number of atoms : 57 ( 4 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 56 ( 26 ~; 19 |; 7 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-1 aty)
% Number of variables : 33 ( 0 sgn; 20 !; 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/sandbox/tmp/tmp.svZPkJjpf5/E---3.1_8637.p',rdn_positive_less_transitivity) ).
fof(rdn_positive_less34,axiom,
rdn_positive_less(rdnn(n3),rdnn(n4)),
file('/export/starexec/sandbox/tmp/tmp.svZPkJjpf5/E---3.1_8637.p',rdn_positive_less34) ).
fof(less_entry_point_neg_neg,axiom,
! [X1,X2,X10,X11] :
( ( rdn_translate(X1,rdn_neg(X10))
& rdn_translate(X2,rdn_neg(X11))
& rdn_positive_less(X11,X10) )
=> less(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.svZPkJjpf5/E---3.1_8637.p',less_entry_point_neg_neg) ).
fof(rdn_positive_less23,axiom,
rdn_positive_less(rdnn(n2),rdnn(n3)),
file('/export/starexec/sandbox/tmp/tmp.svZPkJjpf5/E---3.1_8637.p',rdn_positive_less23) ).
fof(less_property,axiom,
! [X1,X2] :
( less(X1,X2)
<=> ( ~ less(X2,X1)
& X2 != X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.svZPkJjpf5/E---3.1_8637.p',less_property) ).
fof(nn2_not_less_nn4,conjecture,
~ less(nn2,nn4),
file('/export/starexec/sandbox/tmp/tmp.svZPkJjpf5/E---3.1_8637.p',nn2_not_less_nn4) ).
fof(rdnn2,axiom,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
file('/export/starexec/sandbox/tmp/tmp.svZPkJjpf5/E---3.1_8637.p',rdnn2) ).
fof(rdnn4,axiom,
rdn_translate(nn4,rdn_neg(rdnn(n4))),
file('/export/starexec/sandbox/tmp/tmp.svZPkJjpf5/E---3.1_8637.p',rdnn4) ).
fof(c_0_8,plain,
! [X47,X48,X49] :
( ~ rdn_positive_less(rdnn(X47),rdnn(X48))
| ~ rdn_positive_less(rdnn(X48),rdnn(X49))
| rdn_positive_less(rdnn(X47),rdnn(X49)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdn_positive_less_transitivity])]) ).
cnf(c_0_9,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_8]) ).
cnf(c_0_10,plain,
rdn_positive_less(rdnn(n3),rdnn(n4)),
inference(split_conjunct,[status(thm)],[rdn_positive_less34]) ).
fof(c_0_11,plain,
! [X41,X42,X43,X44] :
( ~ rdn_translate(X41,rdn_neg(X43))
| ~ rdn_translate(X42,rdn_neg(X44))
| ~ rdn_positive_less(X44,X43)
| less(X41,X42) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_entry_point_neg_neg])]) ).
cnf(c_0_12,plain,
( rdn_positive_less(rdnn(X1),rdnn(n4))
| ~ rdn_positive_less(rdnn(X1),rdnn(n3)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(split_conjunct,[status(thm)],[rdn_positive_less23]) ).
fof(c_0_14,plain,
! [X1,X2] :
( less(X1,X2)
<=> ( ~ less(X2,X1)
& X2 != X1 ) ),
inference(fof_simplification,[status(thm)],[less_property]) ).
cnf(c_0_15,plain,
( less(X1,X3)
| ~ rdn_translate(X1,rdn_neg(X2))
| ~ rdn_translate(X3,rdn_neg(X4))
| ~ rdn_positive_less(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
rdn_positive_less(rdnn(n2),rdnn(n4)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_17,plain,
! [X45,X46] :
( ( ~ less(X46,X45)
| ~ less(X45,X46) )
& ( X46 != X45
| ~ less(X45,X46) )
& ( less(X46,X45)
| X46 = X45
| less(X45,X46) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
fof(c_0_18,negated_conjecture,
less(nn2,nn4),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[nn2_not_less_nn4])]) ).
cnf(c_0_19,plain,
( less(X1,X2)
| ~ rdn_translate(X2,rdn_neg(rdnn(n2)))
| ~ rdn_translate(X1,rdn_neg(rdnn(n4))) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(split_conjunct,[status(thm)],[rdnn2]) ).
cnf(c_0_21,plain,
( ~ less(X1,X2)
| ~ less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
less(nn2,nn4),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
( less(X1,nn2)
| ~ rdn_translate(X1,rdn_neg(rdnn(n4))) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
rdn_translate(nn4,rdn_neg(rdnn(n4))),
inference(split_conjunct,[status(thm)],[rdnn4]) ).
cnf(c_0_25,negated_conjecture,
~ less(nn4,nn2),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.10 % Problem : NUM299+1 : TPTP v8.1.2. Released v3.1.0.
% 0.04/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n029.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 2400
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon Oct 2 13:54:51 EDT 2023
% 0.09/0.29 % CPUTime :
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.svZPkJjpf5/E---3.1_8637.p
% 0.14/0.44 # Version: 3.1pre001
% 0.14/0.44 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.14/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.14/0.44 # Starting new_bool_3 with 600s (2) cores
% 0.14/0.44 # Starting new_bool_1 with 600s (2) cores
% 0.14/0.44 # Starting sh5l with 300s (1) cores
% 0.14/0.44 # new_bool_3 with pid 8716 completed with status 0
% 0.14/0.44 # Result found by new_bool_3
% 0.14/0.44 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.14/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.14/0.44 # Starting new_bool_3 with 600s (2) cores
% 0.14/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.44 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.14/0.44 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 0.14/0.44 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 325s (1) cores
% 0.14/0.44 # Starting new_bool_3 with 61s (1) cores
% 0.14/0.44 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 8719 completed with status 0
% 0.14/0.44 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.14/0.44 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.14/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.14/0.44 # Starting new_bool_3 with 600s (2) cores
% 0.14/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.44 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.14/0.44 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 0.14/0.44 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 325s (1) cores
% 0.14/0.44 # Preprocessing time : 0.002 s
% 0.14/0.44 # Presaturation interreduction done
% 0.14/0.44
% 0.14/0.44 # Proof found!
% 0.14/0.44 # SZS status Theorem
% 0.14/0.44 # SZS output start CNFRefutation
% See solution above
% 0.14/0.44 # Parsed axioms : 402
% 0.14/0.44 # Removed by relevancy pruning/SinE : 274
% 0.14/0.44 # Initial clauses : 130
% 0.14/0.44 # Removed in clause preprocessing : 0
% 0.14/0.44 # Initial clauses in saturation : 130
% 0.14/0.44 # Processed clauses : 530
% 0.14/0.44 # ...of these trivial : 0
% 0.14/0.44 # ...subsumed : 0
% 0.14/0.44 # ...remaining for further processing : 530
% 0.14/0.44 # Other redundant clauses eliminated : 1
% 0.14/0.44 # Clauses deleted for lack of memory : 0
% 0.14/0.44 # Backward-subsumed : 0
% 0.14/0.44 # Backward-rewritten : 0
% 0.14/0.44 # Generated clauses : 509
% 0.14/0.44 # ...of the previous two non-redundant : 374
% 0.14/0.44 # ...aggressively subsumed : 0
% 0.14/0.44 # Contextual simplify-reflections : 0
% 0.14/0.44 # Paramodulations : 506
% 0.14/0.44 # Factorizations : 2
% 0.14/0.44 # NegExts : 0
% 0.14/0.44 # Equation resolutions : 1
% 0.14/0.44 # Total rewrite steps : 130
% 0.14/0.44 # Propositional unsat checks : 0
% 0.14/0.44 # Propositional check models : 0
% 0.14/0.44 # Propositional check unsatisfiable : 0
% 0.14/0.44 # Propositional clauses : 0
% 0.14/0.44 # Propositional clauses after purity: 0
% 0.14/0.44 # Propositional unsat core size : 0
% 0.14/0.44 # Propositional preprocessing time : 0.000
% 0.14/0.44 # Propositional encoding time : 0.000
% 0.14/0.44 # Propositional solver time : 0.000
% 0.14/0.44 # Success case prop preproc time : 0.000
% 0.14/0.44 # Success case prop encoding time : 0.000
% 0.14/0.44 # Success case prop solver time : 0.000
% 0.14/0.44 # Current number of processed clauses : 399
% 0.14/0.44 # Positive orientable unit clauses : 211
% 0.14/0.44 # Positive unorientable unit clauses: 0
% 0.14/0.44 # Negative unit clauses : 46
% 0.14/0.44 # Non-unit-clauses : 142
% 0.14/0.44 # Current number of unprocessed clauses: 104
% 0.14/0.44 # ...number of literals in the above : 222
% 0.14/0.44 # Current number of archived formulas : 0
% 0.14/0.44 # Current number of archived clauses : 130
% 0.14/0.44 # Clause-clause subsumption calls (NU) : 3462
% 0.14/0.44 # Rec. Clause-clause subsumption calls : 3448
% 0.14/0.44 # Non-unit clause-clause subsumptions : 0
% 0.14/0.44 # Unit Clause-clause subsumption calls : 3545
% 0.14/0.44 # Rewrite failures with RHS unbound : 0
% 0.14/0.44 # BW rewrite match attempts : 36
% 0.14/0.44 # BW rewrite match successes : 0
% 0.14/0.44 # Condensation attempts : 0
% 0.14/0.44 # Condensation successes : 0
% 0.14/0.44 # Termbank termtop insertions : 14987
% 0.14/0.44
% 0.14/0.44 # -------------------------------------------------
% 0.14/0.44 # User time : 0.028 s
% 0.14/0.44 # System time : 0.003 s
% 0.14/0.44 # Total time : 0.031 s
% 0.14/0.44 # Maximum resident set size: 2700 pages
% 0.14/0.44
% 0.14/0.44 # -------------------------------------------------
% 0.14/0.44 # User time : 0.055 s
% 0.14/0.44 # System time : 0.005 s
% 0.14/0.44 # Total time : 0.060 s
% 0.14/0.44 # Maximum resident set size: 2032 pages
% 0.14/0.44 % E---3.1 exiting
% 0.14/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------