TSTP Solution File: SWV150+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV150+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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 : Wed Jul 20 17:46:01 EDT 2022
% Result : Theorem 8.32s 2.37s
% Output : CNFRefutation 8.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 8 ( 5 unt; 0 def)
% Number of atoms : 11 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 9 ( 6 ~; 0 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 3 ( 0 sgn 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(gauss_array_0020,conjecture,
( ~ leq(tptp_float_0_001,tptp_float_0_001)
=> leq(s_worst7,n3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gauss_array_0020) ).
fof(reflexivity_leq,axiom,
! [X1] : leq(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',reflexivity_leq) ).
fof(c_0_2,negated_conjecture,
~ ( ~ leq(tptp_float_0_001,tptp_float_0_001)
=> leq(s_worst7,n3) ),
inference(assume_negation,[status(cth)],[gauss_array_0020]) ).
fof(c_0_3,negated_conjecture,
( ~ leq(tptp_float_0_001,tptp_float_0_001)
& ~ leq(s_worst7,n3) ),
inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_2])]) ).
fof(c_0_4,plain,
! [X34] : leq(X34,X34),
inference(variable_rename,[status(thm)],[reflexivity_leq]) ).
cnf(c_0_5,negated_conjecture,
~ leq(tptp_float_0_001,tptp_float_0_001),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
leq(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV150+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n005.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 : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 14 21:41:56 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox2/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
% 8.32/2.37 # ENIGMATIC: Solved by autoschedule:
% 8.32/2.37 # No SInE strategy applied
% 8.32/2.37 # Trying AutoSched0 for 150 seconds
% 8.32/2.37 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S059I
% 8.32/2.37 # and selection function SelectComplexExceptUniqMaxPosHorn.
% 8.32/2.37 #
% 8.32/2.37 # Preprocessing time : 0.019 s
% 8.32/2.37 # Presaturation interreduction done
% 8.32/2.37
% 8.32/2.37 # Proof found!
% 8.32/2.37 # SZS status Theorem
% 8.32/2.37 # SZS output start CNFRefutation
% See solution above
% 8.32/2.37 # Training examples: 0 positive, 0 negative
% 8.32/2.37
% 8.32/2.37 # -------------------------------------------------
% 8.32/2.37 # User time : 0.020 s
% 8.32/2.37 # System time : 0.005 s
% 8.32/2.37 # Total time : 0.025 s
% 8.32/2.37 # Maximum resident set size: 7120 pages
% 8.32/2.37
%------------------------------------------------------------------------------