TSTP Solution File: NUM301+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM301+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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 : 600s
% DateTime : Mon Jul 18 08:24:09 EDT 2022
% Result : Theorem 9.25s 2.51s
% Output : CNFRefutation 9.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 16 ( 12 unt; 0 def)
% Number of atoms : 26 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 22 ( 12 ~; 7 |; 2 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 19 ( 3 sgn 9 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(something_less_nn2,conjecture,
? [X1] : less(X1,nn2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',something_less_nn2) ).
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/benchmark/Axioms/NUM005+1.ax',less_entry_point_neg_neg) ).
fof(rdnn2,axiom,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdnn2) ).
fof(rdn_positive_less23,axiom,
rdn_positive_less(rdnn(n2),rdnn(n3)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_positive_less23) ).
fof(rdnn3,axiom,
rdn_translate(nn3,rdn_neg(rdnn(n3))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdnn3) ).
fof(c_0_5,negated_conjecture,
~ ? [X1] : less(X1,nn2),
inference(assume_negation,[status(cth)],[something_less_nn2]) ).
fof(c_0_6,plain,
! [X57,X58,X59,X60] :
( ~ rdn_translate(X57,rdn_neg(X59))
| ~ rdn_translate(X58,rdn_neg(X60))
| ~ rdn_positive_less(X60,X59)
| less(X57,X58) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_entry_point_neg_neg])]) ).
fof(c_0_7,negated_conjecture,
! [X154] : ~ less(X154,nn2),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).
cnf(c_0_8,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_6]) ).
cnf(c_0_9,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(split_conjunct,[status(thm)],[rdnn2]) ).
cnf(c_0_10,negated_conjecture,
~ less(X1,nn2),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( ~ rdn_positive_less(rdnn(n2),X1)
| ~ rdn_translate(X2,rdn_neg(X1)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_12,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(split_conjunct,[status(thm)],[rdn_positive_less23]) ).
cnf(c_0_13,plain,
rdn_translate(nn3,rdn_neg(rdnn(n3))),
inference(split_conjunct,[status(thm)],[rdnn3]) ).
cnf(c_0_14,plain,
~ rdn_translate(X1,rdn_neg(rdnn(n3))),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
$false,
inference(sr,[status(thm)],[c_0_13,c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM301+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n018.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jul 8 02:20:27 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.25/2.51 # ENIGMATIC: Solved by autoschedule:
% 9.25/2.51 # No SInE strategy applied
% 9.25/2.51 # Trying AutoSched0 for 150 seconds
% 9.25/2.51 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 9.25/2.51 # and selection function SelectNewComplexAHP.
% 9.25/2.51 #
% 9.25/2.51 # Preprocessing time : 0.031 s
% 9.25/2.51 # Presaturation interreduction done
% 9.25/2.51
% 9.25/2.51 # Proof found!
% 9.25/2.51 # SZS status Theorem
% 9.25/2.51 # SZS output start CNFRefutation
% See solution above
% 9.25/2.51 # Training examples: 0 positive, 0 negative
% 9.25/2.51
% 9.25/2.51 # -------------------------------------------------
% 9.25/2.51 # User time : 0.064 s
% 9.25/2.51 # System time : 0.011 s
% 9.25/2.51 # Total time : 0.075 s
% 9.25/2.51 # Maximum resident set size: 7124 pages
% 9.25/2.51
%------------------------------------------------------------------------------