TSTP Solution File: SWW102+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWW102+1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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 : Thu Jul 21 00:01:32 EDT 2022
% Result : Theorem 7.70s 2.45s
% Output : CNFRefutation 7.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 19
% Syntax : Number of formulae : 99 ( 34 unt; 0 def)
% Number of atoms : 279 ( 146 equ)
% Maximal formula atoms : 75 ( 2 avg)
% Number of connectives : 272 ( 92 ~; 134 |; 38 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 65 ( 4 sgn 33 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(not1_not2,conjecture,
! [X5] : not1(X5) = not2(X5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not1_not2) ).
fof(def_false2,axiom,
? [X5] :
( false2 = phi(f7(X5))
& ~ ? [X10] : forallprefers(f7(X10),f7(X5)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',def_false2) ).
fof(lazy_impl_axiom3,axiom,
! [X4] : lazy_impl(true,X4) = phi(X4),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',lazy_impl_axiom3) ).
fof(def_f7,axiom,
! [X5] : f7(X5) = lazy_impl(prop(X5),X5),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',def_f7) ).
fof(def_phi,axiom,
! [X1] :
( ( d(X1)
& phi(X1) = X1 )
| ( ~ d(X1)
& phi(X1) = err ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',def_phi) ).
fof(def_not2,axiom,
! [X5] : not2(X5) = impl(X5,false2),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',def_not2) ).
fof(not1_axiom1,axiom,
! [X3] :
( ~ bool(X3)
=> not1(X3) = phi(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',not1_axiom1) ).
fof(impl_axiom1,axiom,
! [X3,X4] :
( ~ bool(X3)
=> impl(X3,X4) = phi(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',impl_axiom1) ).
fof(prop_true,axiom,
! [X1] :
( prop(X1) = true
<=> bool(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',prop_true) ).
fof(prop_false,axiom,
! [X1] :
( prop(X1) = false
<=> ~ bool(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',prop_false) ).
fof(lazy_impl_axiom2,axiom,
! [X4] : lazy_impl(false,X4) = true,
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',lazy_impl_axiom2) ).
fof(def_bool,axiom,
! [X1] :
( bool(X1)
<=> ( X1 = false
| X1 = true ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',def_bool) ).
fof(false_true_err_in_d,axiom,
( d(true)
& d(false)
& d(err) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',false_true_err_in_d) ).
fof(not1_axiom2,axiom,
not1(false) = true,
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',not1_axiom2) ).
fof(impl_axiom3,axiom,
! [X4] :
( bool(X4)
=> impl(false,X4) = true ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',impl_axiom3) ).
fof(not1_axiom3,axiom,
not1(true) = false,
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',not1_axiom3) ).
fof(impl_axiom4,axiom,
! [X4] :
( bool(X4)
=> impl(true,X4) = X4 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',impl_axiom4) ).
fof(def_forallprefers,axiom,
! [X1,X2] :
( forallprefers(X1,X2)
<=> ( ( ~ d(X1)
& d(X2) )
| ( d(X1)
& d(X2)
& ~ bool(X1)
& bool(X2) )
| ( X1 = false
& X2 = true ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',def_forallprefers) ).
fof(distinct_false_true_err,axiom,
( true != false
& true != err
& false != err ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV012+0.ax',distinct_false_true_err) ).
fof(c_0_19,negated_conjecture,
~ ! [X5] : not1(X5) = not2(X5),
inference(assume_negation,[status(cth)],[not1_not2]) ).
fof(c_0_20,plain,
! [X83] :
( false2 = phi(f7(esk7_0))
& ~ forallprefers(f7(X83),f7(esk7_0)) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[def_false2])])])]) ).
fof(c_0_21,plain,
! [X28] : lazy_impl(true,X28) = phi(X28),
inference(variable_rename,[status(thm)],[lazy_impl_axiom3]) ).
fof(c_0_22,plain,
! [X81] : f7(X81) = lazy_impl(prop(X81),X81),
inference(variable_rename,[status(thm)],[def_f7]) ).
fof(c_0_23,plain,
! [X16] :
( ( ~ d(X16)
| d(X16) )
& ( phi(X16) = err
| d(X16) )
& ( ~ d(X16)
| phi(X16) = X16 )
& ( phi(X16) = err
| phi(X16) = X16 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[def_phi])])]) ).
fof(c_0_24,negated_conjecture,
not1(esk8_0) != not2(esk8_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])]) ).
fof(c_0_25,plain,
! [X85] : not2(X85) = impl(X85,false2),
inference(variable_rename,[status(thm)],[def_not2]) ).
fof(c_0_26,plain,
! [X84] :
( bool(X84)
| not1(X84) = phi(X84) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[not1_axiom1])])]) ).
fof(c_0_27,plain,
! [X19,X20] :
( bool(X19)
| impl(X19,X20) = phi(X19) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[impl_axiom1])])]) ).
cnf(c_0_28,plain,
false2 = phi(f7(esk7_0)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,plain,
lazy_impl(true,X1) = phi(X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,plain,
f7(X1) = lazy_impl(prop(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,plain,
( phi(X1) = err
| phi(X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,plain,
( phi(X1) = X1
| ~ d(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_33,negated_conjecture,
not1(esk8_0) != not2(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_34,plain,
not2(X1) = impl(X1,false2),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_35,plain,
( bool(X1)
| not1(X1) = phi(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_36,plain,
( bool(X1)
| impl(X1,X2) = phi(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_37,plain,
false2 = lazy_impl(true,lazy_impl(prop(esk7_0),esk7_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_38,plain,
( lazy_impl(true,X1) = X1
| lazy_impl(true,X1) = err ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_29]),c_0_29]) ).
fof(c_0_39,plain,
! [X17] :
( ( prop(X17) != true
| bool(X17) )
& ( ~ bool(X17)
| prop(X17) = true ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[prop_true])]) ).
fof(c_0_40,plain,
! [X18] :
( ( prop(X18) != false
| ~ bool(X18) )
& ( bool(X18)
| prop(X18) = false ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[prop_false])])]) ).
fof(c_0_41,plain,
! [X27] : lazy_impl(false,X27) = true,
inference(variable_rename,[status(thm)],[lazy_impl_axiom2]) ).
cnf(c_0_42,plain,
( lazy_impl(true,X1) = X1
| ~ d(X1) ),
inference(rw,[status(thm)],[c_0_32,c_0_29]) ).
fof(c_0_43,plain,
! [X11] :
( ( ~ bool(X11)
| X11 = false
| X11 = true )
& ( X11 != false
| bool(X11) )
& ( X11 != true
| bool(X11) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[def_bool])])]) ).
cnf(c_0_44,negated_conjecture,
impl(esk8_0,false2) != not1(esk8_0),
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_45,plain,
( not1(X1) = lazy_impl(true,X1)
| bool(X1) ),
inference(rw,[status(thm)],[c_0_35,c_0_29]) ).
cnf(c_0_46,plain,
( impl(X1,X2) = lazy_impl(true,X1)
| bool(X1) ),
inference(rw,[status(thm)],[c_0_36,c_0_29]) ).
cnf(c_0_47,plain,
( lazy_impl(prop(esk7_0),esk7_0) = false2
| false2 = err ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_37]) ).
cnf(c_0_48,plain,
( prop(X1) = true
| ~ bool(X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_49,plain,
( bool(X1)
| prop(X1) = false ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_50,plain,
lazy_impl(false,X1) = true,
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_51,plain,
( lazy_impl(prop(esk7_0),esk7_0) = false2
| ~ d(lazy_impl(prop(esk7_0),esk7_0)) ),
inference(spm,[status(thm)],[c_0_42,c_0_37]) ).
cnf(c_0_52,plain,
d(true),
inference(split_conjunct,[status(thm)],[false_true_err_in_d]) ).
cnf(c_0_53,plain,
( X1 = false
| X1 = true
| ~ bool(X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_54,negated_conjecture,
bool(esk8_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]) ).
cnf(c_0_55,plain,
( lazy_impl(true,esk7_0) = false2
| false2 = err
| ~ bool(esk7_0) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_56,plain,
( false2 = err
| false2 = true
| bool(esk7_0) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_49]),c_0_50]) ).
cnf(c_0_57,plain,
( lazy_impl(true,lazy_impl(true,esk7_0)) = false2
| ~ bool(esk7_0) ),
inference(spm,[status(thm)],[c_0_37,c_0_48]) ).
cnf(c_0_58,plain,
( false2 = true
| bool(esk7_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_49]),c_0_50]),c_0_50]),c_0_52])]) ).
cnf(c_0_59,negated_conjecture,
( esk8_0 = true
| esk8_0 = false ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_60,plain,
not1(false) = true,
inference(split_conjunct,[status(thm)],[not1_axiom2]) ).
fof(c_0_61,plain,
! [X23] :
( ~ bool(X23)
| impl(false,X23) = true ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[impl_axiom3])]) ).
cnf(c_0_62,plain,
( lazy_impl(true,esk7_0) = false2
| false2 = true
| false2 = err ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_63,plain,
( lazy_impl(true,lazy_impl(true,esk7_0)) = false2
| false2 = true ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_64,negated_conjecture,
( esk8_0 = true
| impl(false,false2) != true ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_59]),c_0_60]) ).
cnf(c_0_65,plain,
( impl(false,X1) = true
| ~ bool(X1) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_66,plain,
( false2 = true
| esk7_0 = false2
| false2 = err ),
inference(spm,[status(thm)],[c_0_38,c_0_62]) ).
cnf(c_0_67,plain,
( bool(X1)
| X1 != true ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_68,plain,
( lazy_impl(true,esk7_0) = false2
| false2 = true
| ~ d(esk7_0) ),
inference(spm,[status(thm)],[c_0_63,c_0_42]) ).
cnf(c_0_69,plain,
( false2 = true
| esk7_0 = true
| esk7_0 = false ),
inference(spm,[status(thm)],[c_0_53,c_0_58]) ).
cnf(c_0_70,plain,
d(false),
inference(split_conjunct,[status(thm)],[false_true_err_in_d]) ).
cnf(c_0_71,plain,
~ forallprefers(f7(X1),f7(esk7_0)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_72,negated_conjecture,
( esk8_0 = true
| ~ bool(false2) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_73,plain,
( false2 = err
| bool(false2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_66]),c_0_67]) ).
cnf(c_0_74,plain,
( lazy_impl(true,false) = false2
| esk7_0 = true
| false2 = true ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70])]) ).
cnf(c_0_75,plain,
~ forallprefers(lazy_impl(prop(X1),X1),lazy_impl(prop(esk7_0),esk7_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_30]),c_0_30]) ).
cnf(c_0_76,negated_conjecture,
( false2 = err
| esk8_0 = true ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_77,plain,
not1(true) = false,
inference(split_conjunct,[status(thm)],[not1_axiom3]) ).
fof(c_0_78,plain,
! [X24] :
( ~ bool(X24)
| impl(true,X24) = X24 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[impl_axiom4])]) ).
cnf(c_0_79,plain,
( false2 = true
| esk7_0 = true
| false2 = false ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_74]),c_0_70])]) ).
cnf(c_0_80,plain,
( false2 = err
| ~ forallprefers(lazy_impl(prop(X1),X1),false2) ),
inference(spm,[status(thm)],[c_0_75,c_0_47]) ).
cnf(c_0_81,negated_conjecture,
( false2 = err
| impl(true,false2) != false ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_76]),c_0_77]) ).
cnf(c_0_82,plain,
( impl(true,X1) = X1
| ~ bool(X1) ),
inference(split_conjunct,[status(thm)],[c_0_78]) ).
cnf(c_0_83,plain,
( bool(X1)
| X1 != false ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_84,plain,
( lazy_impl(true,true) = false2
| false2 = false
| false2 = true ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_79]),c_0_52])]) ).
fof(c_0_85,plain,
! [X12,X13] :
( ( X12 = false
| d(X12)
| ~ d(X12)
| ~ forallprefers(X12,X13) )
& ( X13 = true
| d(X12)
| ~ d(X12)
| ~ forallprefers(X12,X13) )
& ( X12 = false
| d(X13)
| ~ d(X12)
| ~ forallprefers(X12,X13) )
& ( X13 = true
| d(X13)
| ~ d(X12)
| ~ forallprefers(X12,X13) )
& ( X12 = false
| ~ bool(X12)
| ~ d(X12)
| ~ forallprefers(X12,X13) )
& ( X13 = true
| ~ bool(X12)
| ~ d(X12)
| ~ forallprefers(X12,X13) )
& ( X12 = false
| bool(X13)
| ~ d(X12)
| ~ forallprefers(X12,X13) )
& ( X13 = true
| bool(X13)
| ~ d(X12)
| ~ forallprefers(X12,X13) )
& ( X12 = false
| d(X12)
| d(X13)
| ~ forallprefers(X12,X13) )
& ( X13 = true
| d(X12)
| d(X13)
| ~ forallprefers(X12,X13) )
& ( X12 = false
| d(X13)
| d(X13)
| ~ forallprefers(X12,X13) )
& ( X13 = true
| d(X13)
| d(X13)
| ~ forallprefers(X12,X13) )
& ( X12 = false
| ~ bool(X12)
| d(X13)
| ~ forallprefers(X12,X13) )
& ( X13 = true
| ~ bool(X12)
| d(X13)
| ~ forallprefers(X12,X13) )
& ( X12 = false
| bool(X13)
| d(X13)
| ~ forallprefers(X12,X13) )
& ( X13 = true
| bool(X13)
| d(X13)
| ~ forallprefers(X12,X13) )
& ( d(X12)
| ~ d(X13)
| forallprefers(X12,X13) )
& ( ~ d(X12)
| ~ d(X13)
| bool(X12)
| ~ bool(X13)
| forallprefers(X12,X13) )
& ( X12 != false
| X13 != true
| forallprefers(X12,X13) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[def_forallprefers])])])]) ).
cnf(c_0_86,plain,
( false2 = err
| ~ forallprefers(lazy_impl(true,X1),false2)
| ~ bool(X1) ),
inference(spm,[status(thm)],[c_0_80,c_0_48]) ).
cnf(c_0_87,negated_conjecture,
( false2 = err
| false2 != false ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_83]) ).
cnf(c_0_88,plain,
( false2 = false
| false2 = true ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_84]),c_0_52])]) ).
cnf(c_0_89,plain,
false != err,
inference(split_conjunct,[status(thm)],[distinct_false_true_err]) ).
cnf(c_0_90,plain,
( forallprefers(X1,X2)
| X1 != false
| X2 != true ),
inference(split_conjunct,[status(thm)],[c_0_85]) ).
cnf(c_0_91,plain,
( false2 = err
| ~ forallprefers(X1,false2)
| ~ d(X1)
| ~ bool(X1) ),
inference(spm,[status(thm)],[c_0_86,c_0_42]) ).
cnf(c_0_92,negated_conjecture,
false2 = true,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_89]) ).
cnf(c_0_93,plain,
true != err,
inference(split_conjunct,[status(thm)],[distinct_false_true_err]) ).
cnf(c_0_94,plain,
( forallprefers(X1,true)
| X1 != false ),
inference(er,[status(thm)],[c_0_90]) ).
cnf(c_0_95,plain,
( ~ forallprefers(X1,true)
| ~ d(X1)
| ~ bool(X1) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_92]),c_0_92]),c_0_93]) ).
cnf(c_0_96,plain,
forallprefers(false,true),
inference(er,[status(thm)],[c_0_94]) ).
cnf(c_0_97,plain,
bool(false),
inference(er,[status(thm)],[c_0_83]) ).
cnf(c_0_98,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_70]),c_0_97])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWW102+1 : TPTP v8.1.0. Released v5.2.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n024.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sun Jun 5 10:15:37 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.44 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.70/2.45 # ENIGMATIC: Solved by autoschedule:
% 7.70/2.45 # No SInE strategy applied
% 7.70/2.45 # Trying AutoSched0 for 150 seconds
% 7.70/2.45 # AutoSched0-Mode selected heuristic G_E___042_C45_F1_PI_AE_Q4_CS_SP_PS_S4S
% 7.70/2.45 # and selection function SelectNewComplexAHPNS.
% 7.70/2.45 #
% 7.70/2.45 # Preprocessing time : 0.015 s
% 7.70/2.45 # Presaturation interreduction done
% 7.70/2.45
% 7.70/2.45 # Proof found!
% 7.70/2.45 # SZS status Theorem
% 7.70/2.45 # SZS output start CNFRefutation
% See solution above
% 7.70/2.45 # Training examples: 0 positive, 0 negative
% 7.70/2.45
% 7.70/2.45 # -------------------------------------------------
% 7.70/2.45 # User time : 0.024 s
% 7.70/2.45 # System time : 0.003 s
% 7.70/2.45 # Total time : 0.027 s
% 7.70/2.45 # Maximum resident set size: 7124 pages
% 7.70/2.45
%------------------------------------------------------------------------------