TSTP Solution File: NUM300+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM300+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n015.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:08 EDT 2022
% Result : Theorem 9.82s 2.74s
% Output : CNFRefutation 9.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 13 ( 10 unt; 0 def)
% Number of atoms : 19 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 14 ( 8 ~; 4 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-1 aty)
% Number of variables : 18 ( 5 sgn 9 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(something_less_n0,conjecture,
? [X1] : less(X1,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',something_less_n0) ).
fof(less_entry_point_neg_pos,axiom,
! [X1,X2,X10,X11] :
( ( rdn_translate(X1,rdn_neg(X10))
& rdn_translate(X2,rdn_pos(X11)) )
=> less(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',less_entry_point_neg_pos) ).
fof(rdn0,axiom,
rdn_translate(n0,rdn_pos(rdnn(n0))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn0) ).
fof(rdnn1,axiom,
rdn_translate(nn1,rdn_neg(rdnn(n1))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdnn1) ).
fof(c_0_4,negated_conjecture,
~ ? [X1] : less(X1,n0),
inference(assume_negation,[status(cth)],[something_less_n0]) ).
fof(c_0_5,plain,
! [X53,X54,X55,X56] :
( ~ rdn_translate(X53,rdn_neg(X55))
| ~ rdn_translate(X54,rdn_pos(X56))
| less(X53,X54) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_entry_point_neg_pos])]) ).
fof(c_0_6,negated_conjecture,
! [X154] : ~ less(X154,n0),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).
cnf(c_0_7,plain,
( less(X1,X3)
| ~ rdn_translate(X1,rdn_neg(X2))
| ~ rdn_translate(X3,rdn_pos(X4)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
rdn_translate(n0,rdn_pos(rdnn(n0))),
inference(split_conjunct,[status(thm)],[rdn0]) ).
cnf(c_0_9,negated_conjecture,
~ less(X1,n0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
rdn_translate(nn1,rdn_neg(rdnn(n1))),
inference(split_conjunct,[status(thm)],[rdnn1]) ).
cnf(c_0_11,plain,
~ rdn_translate(X1,rdn_neg(X2)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
cnf(c_0_12,plain,
$false,
inference(sr,[status(thm)],[c_0_10,c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NUM300+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n015.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jul 7 08:57:06 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.47 # ENIGMATIC: Selected SinE mode:
% 0.21/0.49 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.49 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.49 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.49 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.82/2.74 # ENIGMATIC: Solved by autoschedule:
% 9.82/2.74 # No SInE strategy applied
% 9.82/2.74 # Trying AutoSched0 for 150 seconds
% 9.82/2.74 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 9.82/2.74 # and selection function SelectNewComplexAHP.
% 9.82/2.74 #
% 9.82/2.74 # Preprocessing time : 0.032 s
% 9.82/2.74 # Presaturation interreduction done
% 9.82/2.74
% 9.82/2.74 # Proof found!
% 9.82/2.74 # SZS status Theorem
% 9.82/2.74 # SZS output start CNFRefutation
% See solution above
% 9.82/2.74 # Training examples: 0 positive, 0 negative
% 9.82/2.74
% 9.82/2.74 # -------------------------------------------------
% 9.82/2.74 # User time : 0.075 s
% 9.82/2.74 # System time : 0.016 s
% 9.82/2.74 # Total time : 0.091 s
% 9.82/2.74 # Maximum resident set size: 7124 pages
% 9.82/2.74
%------------------------------------------------------------------------------