TSTP Solution File: SWC031+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC031+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n032.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 : Tue Jul 19 20:13:10 EDT 2022
% Result : Theorem 9.16s 2.68s
% Output : CNFRefutation 9.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 38
% Number of leaves : 28
% Syntax : Number of formulae : 153 ( 40 unt; 0 def)
% Number of atoms : 549 ( 154 equ)
% Maximal formula atoms : 21 ( 3 avg)
% Number of connectives : 670 ( 274 ~; 279 |; 47 &)
% ( 6 <=>; 64 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 5 con; 0-2 aty)
% Number of variables : 203 ( 0 sgn 109 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ frontsegP(X4,X3)
| ~ totalorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& frontsegP(X4,X5)
& segmentP(X5,X3)
& totalorderedP(X5) )
| ( ( nil != X2
| nil = X1 )
& ( nil != X1
| nil = X2 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax41,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( ( frontsegP(X1,X2)
& frontsegP(X2,X1) )
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax41) ).
fof(ax45,axiom,
! [X1] :
( ssList(X1)
=> frontsegP(X1,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax45) ).
fof(ax5,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X2,X3) = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax5) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax82,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax50,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( rearsegP(X1,X2)
=> rearsegP(app(X3,X1),X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax50) ).
fof(ax51,axiom,
! [X1] :
( ssList(X1)
=> rearsegP(X1,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax51) ).
fof(ax6,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( rearsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax6) ).
fof(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(ax85,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> hd(app(X1,X2)) = hd(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax85) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(ax86,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> tl(app(X1,X2)) = app(tl(X1),X2) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax86) ).
fof(ax19,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssItem(X4)
=> ( cons(X3,X1) = cons(X4,X2)
=> ( X3 = X4
& X2 = X1 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax19) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax20) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(ax23,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> hd(cons(X2,X1)) = X2 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax23) ).
fof(ax44,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( frontsegP(cons(X1,X3),cons(X2,X4))
<=> ( X1 = X2
& frontsegP(X3,X4) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax44) ).
fof(ax57,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax57) ).
fof(ax65,axiom,
! [X1] :
( ssItem(X1)
=> totalorderedP(cons(X1,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax65) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(c_0_28,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ frontsegP(X4,X3)
| ~ totalorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& frontsegP(X4,X5)
& segmentP(X5,X3)
& totalorderedP(X5) )
| ( ( nil != X2
| nil = X1 )
& ( nil != X1
| nil = X2 ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_29,negated_conjecture,
! [X255] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& frontsegP(esk51_0,esk50_0)
& totalorderedP(esk50_0)
& ( ~ ssList(X255)
| ~ neq(esk50_0,X255)
| ~ frontsegP(esk51_0,X255)
| ~ segmentP(X255,esk50_0)
| ~ totalorderedP(X255) )
& ( nil = esk48_0
| nil = esk49_0 )
& ( nil != esk49_0
| nil = esk49_0 )
& ( nil = esk48_0
| nil != esk48_0 )
& ( nil != esk49_0
| nil != esk48_0 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_28])])])])])]) ).
fof(c_0_30,plain,
! [X161,X162] :
( ~ ssList(X161)
| ~ ssList(X162)
| ~ frontsegP(X161,X162)
| ~ frontsegP(X162,X161)
| X161 = X162 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax41])])]) ).
cnf(c_0_31,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_32,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_33,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_34,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_35,plain,
( X1 = X2
| ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| ~ frontsegP(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,negated_conjecture,
frontsegP(esk51_0,esk50_0),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_37,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( nil = esk48_0
| nil = esk49_0 ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_40,negated_conjecture,
( esk51_0 = esk50_0
| ~ frontsegP(esk50_0,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_38])]) ).
cnf(c_0_41,negated_conjecture,
( esk51_0 = nil
| esk50_0 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_34]),c_0_32]) ).
fof(c_0_42,plain,
! [X171] :
( ~ ssList(X171)
| frontsegP(X171,nil) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax45])]) ).
cnf(c_0_43,negated_conjecture,
( esk50_0 = nil
| ~ frontsegP(esk50_0,nil) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
fof(c_0_45,plain,
! [X20,X21,X23] :
( ( ssList(esk6_2(X20,X21))
| ~ frontsegP(X20,X21)
| ~ ssList(X21)
| ~ ssList(X20) )
& ( app(X21,esk6_2(X20,X21)) = X20
| ~ frontsegP(X20,X21)
| ~ ssList(X21)
| ~ ssList(X20) )
& ( ~ ssList(X23)
| app(X21,X23) != X20
| frontsegP(X20,X21)
| ~ ssList(X21)
| ~ ssList(X20) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax5])])])])]) ).
cnf(c_0_46,negated_conjecture,
esk50_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_38])]) ).
fof(c_0_47,plain,
! [X135] :
( ~ ssList(X135)
| app(nil,X135) = X135 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
cnf(c_0_48,plain,
( app(X1,esk6_2(X2,X1)) = X2
| ~ frontsegP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_49,negated_conjecture,
frontsegP(esk51_0,nil),
inference(rw,[status(thm)],[c_0_36,c_0_46]) ).
cnf(c_0_50,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_51,plain,
( ssList(esk6_2(X1,X2))
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
fof(c_0_52,plain,
! [X28,X29,X32,X33] :
( ( ssList(esk8_2(X28,X29))
| ~ segmentP(X28,X29)
| ~ ssList(X29)
| ~ ssList(X28) )
& ( ssList(esk9_2(X28,X29))
| ~ segmentP(X28,X29)
| ~ ssList(X29)
| ~ ssList(X28) )
& ( app(app(esk8_2(X28,X29),X29),esk9_2(X28,X29)) = X28
| ~ segmentP(X28,X29)
| ~ ssList(X29)
| ~ ssList(X28) )
& ( ~ ssList(X32)
| ~ ssList(X33)
| app(app(X32,X29),X33) != X28
| segmentP(X28,X29)
| ~ ssList(X29)
| ~ ssList(X28) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax7])])])])]) ).
cnf(c_0_53,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_54,negated_conjecture,
app(nil,esk6_2(esk51_0,nil)) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_37]),c_0_50])]) ).
cnf(c_0_55,negated_conjecture,
ssList(esk6_2(esk51_0,nil)),
inference(cn,[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_37])]) ).
cnf(c_0_56,plain,
( segmentP(X4,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,X3),X2) != X4
| ~ ssList(X3)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_57,negated_conjecture,
esk6_2(esk51_0,nil) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55])]) ).
cnf(c_0_58,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_56]) ).
cnf(c_0_59,negated_conjecture,
app(nil,esk51_0) = esk51_0,
inference(rw,[status(thm)],[c_0_54,c_0_57]) ).
fof(c_0_60,plain,
! [X227] :
( ~ ssList(X227)
| app(X227,nil) = X227 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
cnf(c_0_61,negated_conjecture,
( segmentP(app(esk51_0,X1),esk51_0)
| ~ ssList(app(esk51_0,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_37]),c_0_50])]) ).
cnf(c_0_62,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
fof(c_0_63,plain,
! [X130,X131] :
( ~ ssList(X130)
| ~ ssList(X131)
| ssList(app(X130,X131)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
fof(c_0_64,plain,
! [X222,X223,X224] :
( ~ ssList(X222)
| ~ ssList(X223)
| ~ ssList(X224)
| app(app(X222,X223),X224) = app(X222,app(X223,X224)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])]) ).
cnf(c_0_65,plain,
( app(app(esk8_2(X1,X2),X2),esk9_2(X1,X2)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_66,negated_conjecture,
segmentP(esk51_0,esk51_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_37]),c_0_50])]) ).
cnf(c_0_67,plain,
( ssList(esk9_2(X1,X2))
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_68,plain,
( ssList(esk8_2(X1,X2))
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_69,plain,
( frontsegP(X3,X2)
| ~ ssList(X1)
| app(X2,X1) != X3
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_70,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_71,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_72,negated_conjecture,
app(app(esk8_2(esk51_0,esk51_0),esk51_0),esk9_2(esk51_0,esk51_0)) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_37])]) ).
cnf(c_0_73,negated_conjecture,
ssList(esk9_2(esk51_0,esk51_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_66]),c_0_37])]) ).
cnf(c_0_74,negated_conjecture,
ssList(esk8_2(esk51_0,esk51_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_66]),c_0_37])]) ).
cnf(c_0_75,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_69]),c_0_70]) ).
cnf(c_0_76,negated_conjecture,
app(esk8_2(esk51_0,esk51_0),app(esk51_0,esk9_2(esk51_0,esk51_0))) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_73]),c_0_37]),c_0_74])]) ).
fof(c_0_77,plain,
! [X179,X180,X181] :
( ~ ssList(X179)
| ~ ssList(X180)
| ~ ssList(X181)
| ~ rearsegP(X179,X180)
| rearsegP(app(X181,X179),X180) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax50])])]) ).
fof(c_0_78,plain,
! [X182] :
( ~ ssList(X182)
| rearsegP(X182,nil) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax51])]) ).
cnf(c_0_79,negated_conjecture,
( frontsegP(esk51_0,esk8_2(esk51_0,esk51_0))
| ~ ssList(app(esk51_0,esk9_2(esk51_0,esk51_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_74])]) ).
cnf(c_0_80,plain,
( rearsegP(app(X3,X1),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ rearsegP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_77]) ).
cnf(c_0_81,plain,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_78]) ).
cnf(c_0_82,negated_conjecture,
frontsegP(esk51_0,esk8_2(esk51_0,esk51_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_70]),c_0_73]),c_0_37])]) ).
fof(c_0_83,plain,
! [X24,X25,X27] :
( ( ssList(esk7_2(X24,X25))
| ~ rearsegP(X24,X25)
| ~ ssList(X25)
| ~ ssList(X24) )
& ( app(esk7_2(X24,X25),X25) = X24
| ~ rearsegP(X24,X25)
| ~ ssList(X25)
| ~ ssList(X24) )
& ( ~ ssList(X27)
| app(X27,X25) != X24
| rearsegP(X24,X25)
| ~ ssList(X25)
| ~ ssList(X24) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax6])])])])]) ).
cnf(c_0_84,plain,
( rearsegP(app(X1,X2),nil)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_50])]) ).
cnf(c_0_85,negated_conjecture,
app(esk8_2(esk51_0,esk51_0),esk6_2(esk51_0,esk8_2(esk51_0,esk51_0))) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_82]),c_0_37]),c_0_74])]) ).
cnf(c_0_86,negated_conjecture,
ssList(esk6_2(esk51_0,esk8_2(esk51_0,esk51_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_82]),c_0_74]),c_0_37])]) ).
cnf(c_0_87,plain,
( app(esk7_2(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_83]) ).
cnf(c_0_88,negated_conjecture,
rearsegP(esk51_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_74]),c_0_86])]) ).
cnf(c_0_89,plain,
( ssList(esk7_2(X1,X2))
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_83]) ).
cnf(c_0_90,negated_conjecture,
app(esk7_2(esk51_0,nil),nil) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_50]),c_0_37])]) ).
cnf(c_0_91,negated_conjecture,
ssList(esk7_2(esk51_0,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_88]),c_0_50]),c_0_37])]) ).
cnf(c_0_92,negated_conjecture,
( nil != esk49_0
| nil != esk48_0 ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_93,plain,
! [X213] :
( ~ ssList(X213)
| nil = X213
| cons(hd(X213),tl(X213)) = X213 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])]) ).
fof(c_0_94,plain,
! [X228,X229] :
( ~ ssList(X228)
| ~ ssList(X229)
| nil = X228
| hd(app(X228,X229)) = hd(X228) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax85])])]) ).
fof(c_0_95,plain,
! [X225,X226] :
( ( nil = X226
| nil != app(X225,X226)
| ~ ssList(X226)
| ~ ssList(X225) )
& ( nil = X225
| nil != app(X225,X226)
| ~ ssList(X226)
| ~ ssList(X225) )
& ( nil != X226
| nil != X225
| nil = app(X225,X226)
| ~ ssList(X226)
| ~ ssList(X225) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])]) ).
fof(c_0_96,plain,
! [X127] :
( ~ ssList(X127)
| nil = X127
| ssList(tl(X127)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax24])]) ).
fof(c_0_97,plain,
! [X230,X231] :
( ~ ssList(X230)
| ~ ssList(X231)
| nil = X230
| tl(app(X230,X231)) = app(tl(X230),X231) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax86])])]) ).
cnf(c_0_98,negated_conjecture,
esk7_2(esk51_0,nil) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_90]),c_0_91])]) ).
cnf(c_0_99,negated_conjecture,
( esk50_0 != nil
| esk51_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_92,c_0_34]),c_0_32]) ).
fof(c_0_100,plain,
! [X115,X116,X117,X118] :
( ( X117 = X118
| cons(X117,X115) != cons(X118,X116)
| ~ ssItem(X118)
| ~ ssItem(X117)
| ~ ssList(X116)
| ~ ssList(X115) )
& ( X116 = X115
| cons(X117,X115) != cons(X118,X116)
| ~ ssItem(X118)
| ~ ssItem(X117)
| ~ ssList(X116)
| ~ ssList(X115) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax19])])])]) ).
fof(c_0_101,plain,
! [X119] :
( ( ssList(esk44_1(X119))
| nil = X119
| ~ ssList(X119) )
& ( ssItem(esk45_1(X119))
| nil = X119
| ~ ssList(X119) )
& ( cons(esk45_1(X119),esk44_1(X119)) = X119
| nil = X119
| ~ ssList(X119) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])]) ).
fof(c_0_102,plain,
! [X111,X112] :
( ~ ssList(X111)
| ~ ssItem(X112)
| ssList(cons(X112,X111)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
fof(c_0_103,plain,
! [X122,X123] :
( ~ ssList(X122)
| ~ ssItem(X123)
| nil != cons(X123,X122) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax21])])]) ).
cnf(c_0_104,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_93]) ).
cnf(c_0_105,plain,
( nil = X1
| hd(app(X1,X2)) = hd(X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_94]) ).
cnf(c_0_106,plain,
( nil = X1
| nil != app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_95]) ).
cnf(c_0_107,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_96]) ).
cnf(c_0_108,plain,
( nil = X1
| tl(app(X1,X2)) = app(tl(X1),X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_97]) ).
cnf(c_0_109,negated_conjecture,
app(esk51_0,nil) = esk51_0,
inference(rw,[status(thm)],[c_0_90,c_0_98]) ).
cnf(c_0_110,negated_conjecture,
esk51_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_46])]) ).
cnf(c_0_111,plain,
( X1 = X2
| cons(X3,X2) != cons(X4,X1)
| ~ ssItem(X4)
| ~ ssItem(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_100]) ).
cnf(c_0_112,plain,
( cons(esk45_1(X1),esk44_1(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_101]) ).
cnf(c_0_113,plain,
( ssItem(esk45_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_101]) ).
cnf(c_0_114,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_102]) ).
cnf(c_0_115,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| nil != cons(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_103]) ).
cnf(c_0_116,plain,
( cons(hd(X1),tl(app(X1,X2))) = app(X1,X2)
| nil = X1
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_70]),c_0_106]) ).
cnf(c_0_117,plain,
( nil = X1
| ssList(app(tl(X1),X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_70]),c_0_106]) ).
cnf(c_0_118,negated_conjecture,
app(tl(esk51_0),nil) = tl(esk51_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_109]),c_0_50]),c_0_37])]),c_0_110]) ).
cnf(c_0_119,plain,
( esk44_1(cons(X1,X2)) = X2
| ~ ssList(esk44_1(cons(X1,X2)))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112])]),c_0_113]),c_0_114]),c_0_115]) ).
cnf(c_0_120,negated_conjecture,
cons(hd(esk51_0),tl(esk51_0)) = esk51_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_109]),c_0_50]),c_0_37])]),c_0_110]) ).
cnf(c_0_121,negated_conjecture,
ssList(tl(esk51_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_50]),c_0_37])]),c_0_110]) ).
cnf(c_0_122,negated_conjecture,
( esk44_1(esk51_0) = tl(esk51_0)
| ~ ssList(esk44_1(esk51_0))
| ~ ssItem(hd(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_120]),c_0_121])]) ).
cnf(c_0_123,plain,
( ssList(esk44_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_101]) ).
fof(c_0_124,plain,
! [X124] :
( ~ ssList(X124)
| nil = X124
| ssItem(hd(X124)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax22])]) ).
cnf(c_0_125,negated_conjecture,
( esk44_1(esk51_0) = tl(esk51_0)
| ~ ssItem(hd(esk51_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_123]),c_0_37])]),c_0_110]) ).
cnf(c_0_126,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_124]) ).
fof(c_0_127,plain,
! [X125,X126] :
( ~ ssList(X125)
| ~ ssItem(X126)
| hd(cons(X126,X125)) = X126 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax23])])]) ).
cnf(c_0_128,negated_conjecture,
esk44_1(esk51_0) = tl(esk51_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_126]),c_0_37])]),c_0_110]) ).
fof(c_0_129,plain,
! [X167,X168,X169,X170] :
( ( X167 = X168
| ~ frontsegP(cons(X167,X169),cons(X168,X170))
| ~ ssList(X170)
| ~ ssList(X169)
| ~ ssItem(X168)
| ~ ssItem(X167) )
& ( frontsegP(X169,X170)
| ~ frontsegP(cons(X167,X169),cons(X168,X170))
| ~ ssList(X170)
| ~ ssList(X169)
| ~ ssItem(X168)
| ~ ssItem(X167) )
& ( X167 != X168
| ~ frontsegP(X169,X170)
| frontsegP(cons(X167,X169),cons(X168,X170))
| ~ ssList(X170)
| ~ ssList(X169)
| ~ ssItem(X168)
| ~ ssItem(X167) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax44])])])]) ).
cnf(c_0_130,plain,
( hd(cons(X2,X1)) = X2
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_127]) ).
cnf(c_0_131,negated_conjecture,
cons(esk45_1(esk51_0),tl(esk51_0)) = esk51_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_128]),c_0_37])]),c_0_110]) ).
cnf(c_0_132,plain,
( frontsegP(cons(X1,X3),cons(X2,X4))
| X1 != X2
| ~ frontsegP(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_129]) ).
cnf(c_0_133,negated_conjecture,
( esk45_1(esk51_0) = hd(esk51_0)
| ~ ssItem(esk45_1(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_131]),c_0_121])]) ).
fof(c_0_134,plain,
! [X194] :
( ~ ssList(X194)
| segmentP(X194,nil) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])]) ).
cnf(c_0_135,plain,
( frontsegP(cons(X1,X2),cons(X1,X3))
| ~ frontsegP(X2,X3)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_132]) ).
cnf(c_0_136,negated_conjecture,
esk45_1(esk51_0) = hd(esk51_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_133,c_0_113]),c_0_37])]),c_0_110]) ).
cnf(c_0_137,negated_conjecture,
( ~ ssList(X1)
| ~ neq(esk50_0,X1)
| ~ frontsegP(esk51_0,X1)
| ~ segmentP(X1,esk50_0)
| ~ totalorderedP(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_138,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_134]) ).
cnf(c_0_139,plain,
( frontsegP(cons(X1,X2),cons(X1,nil))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_44]),c_0_50])]) ).
cnf(c_0_140,negated_conjecture,
ssItem(hd(esk51_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_136]),c_0_37])]),c_0_110]) ).
cnf(c_0_141,negated_conjecture,
( ~ totalorderedP(X1)
| ~ frontsegP(esk51_0,X1)
| ~ ssList(X1)
| ~ neq(nil,X1) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_137,c_0_46]),c_0_46]),c_0_138]) ).
cnf(c_0_142,negated_conjecture,
frontsegP(esk51_0,cons(hd(esk51_0),nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_139,c_0_120]),c_0_121]),c_0_140])]) ).
fof(c_0_143,plain,
! [X199] :
( ~ ssItem(X199)
| totalorderedP(cons(X199,nil)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax65])]) ).
cnf(c_0_144,negated_conjecture,
( ~ totalorderedP(cons(hd(esk51_0),nil))
| ~ ssList(cons(hd(esk51_0),nil))
| ~ neq(nil,cons(hd(esk51_0),nil)) ),
inference(spm,[status(thm)],[c_0_141,c_0_142]) ).
cnf(c_0_145,plain,
( totalorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_143]) ).
cnf(c_0_146,negated_conjecture,
( ~ ssList(cons(hd(esk51_0),nil))
| ~ neq(nil,cons(hd(esk51_0),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_145]),c_0_140])]) ).
fof(c_0_147,plain,
! [X109,X110] :
( ( ~ neq(X109,X110)
| X109 != X110
| ~ ssList(X110)
| ~ ssList(X109) )
& ( X109 = X110
| neq(X109,X110)
| ~ ssList(X110)
| ~ ssList(X109) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
cnf(c_0_148,negated_conjecture,
~ neq(nil,cons(hd(esk51_0),nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_146,c_0_114]),c_0_50]),c_0_140])]) ).
cnf(c_0_149,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_147]) ).
cnf(c_0_150,negated_conjecture,
( cons(hd(esk51_0),nil) = nil
| ~ ssList(cons(hd(esk51_0),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_148,c_0_149]),c_0_50])]) ).
cnf(c_0_151,negated_conjecture,
cons(hd(esk51_0),nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_150,c_0_114]),c_0_50]),c_0_140])]) ).
cnf(c_0_152,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_151]),c_0_50]),c_0_140])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SWC031+1 : TPTP v8.1.0. Released v2.4.0.
% 0.02/0.10 % Command : enigmatic-eprover.py %s %d 1
% 0.08/0.29 % Computer : n032.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 300
% 0.08/0.29 % WCLimit : 600
% 0.08/0.29 % DateTime : Sun Jun 12 13:38:57 EDT 2022
% 0.08/0.29 % CPUTime :
% 0.13/0.37 # ENIGMATIC: Selected SinE mode:
% 0.13/0.38 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.13/0.38 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.13/0.38 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.16/2.68 # ENIGMATIC: Solved by autoschedule:
% 9.16/2.68 # No SInE strategy applied
% 9.16/2.68 # Trying AutoSched0 for 150 seconds
% 9.16/2.68 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 9.16/2.68 # and selection function SelectNewComplexAHP.
% 9.16/2.68 #
% 9.16/2.68 # Preprocessing time : 0.022 s
% 9.16/2.68 # Presaturation interreduction done
% 9.16/2.68
% 9.16/2.68 # Proof found!
% 9.16/2.68 # SZS status Theorem
% 9.16/2.68 # SZS output start CNFRefutation
% See solution above
% 9.16/2.68 # Training examples: 0 positive, 0 negative
% 9.16/2.68
% 9.16/2.68 # -------------------------------------------------
% 9.16/2.68 # User time : 0.178 s
% 9.16/2.68 # System time : 0.008 s
% 9.16/2.68 # Total time : 0.186 s
% 9.16/2.68 # Maximum resident set size: 7120 pages
% 9.16/2.68
%------------------------------------------------------------------------------