%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC302+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:14:51 EDT 2022
% Result : Theorem 7.72s 2.32s
% Output : CNFRefutation 7.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of formulae : 52 ( 23 unt; 0 def)
% Number of atoms : 199 ( 34 equ)
% Maximal formula atoms : 30 ( 3 avg)
% Number of connectives : 231 ( 84 ~; 85 |; 21 &)
% ( 1 <=>; 40 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 5 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 10 con; 0-2 aty)
% Number of variables : 80 ( 0 sgn 56 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ segmentP(X4,X3)
| ~ totalorderedP(X3)
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9) != X1
| ~ lt(X6,X5) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax11,axiom,
! [X1] :
( ssList(X1)
=> ( totalorderedP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
=> leq(X2,X3) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax11) ).
fof(ax33,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
=> ~ lt(X2,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax33) ).
fof(ax92,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( leq(X1,X2)
=> ( X1 = X2
| lt(X1,X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax92) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ segmentP(X4,X3)
| ~ totalorderedP(X3)
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9) != X1
| ~ lt(X6,X5) ) ) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_10,negated_conjecture,
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& segmentP(esk51_0,esk50_0)
& totalorderedP(esk50_0)
& ssItem(esk52_0)
& ssItem(esk53_0)
& ssList(esk54_0)
& ssList(esk55_0)
& ssList(esk56_0)
& app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0) = esk48_0
& lt(esk53_0,esk52_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_9])])])]) ).
cnf(c_0_11,negated_conjecture,
app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0) = esk48_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_12,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X225,X226,X227] :
( ~ ssList(X225)
| ~ ssList(X226)
| ~ ssList(X227)
| app(app(X225,X226),X227) = app(X225,app(X226,X227)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])]) ).
cnf(c_0_14,negated_conjecture,
app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0) = esk50_0,
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
ssList(esk55_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_18,plain,
! [X114,X115] :
( ~ ssList(X114)
| ~ ssItem(X115)
| ssList(cons(X115,X114)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_19,negated_conjecture,
( app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0) = esk50_0
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_20,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_22,negated_conjecture,
ssItem(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_23,plain,
! [X223,X224] :
( ~ ssList(X223)
| ~ ssItem(X224)
| cons(X224,X223) = app(cons(X224,nil),X223) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
cnf(c_0_24,negated_conjecture,
app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_25,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_26,negated_conjecture,
app(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,nil)),esk56_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_16]),c_0_22])]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk56_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_28,negated_conjecture,
( app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0)) = esk50_0
| ~ ssList(app(esk54_0,cons(esk52_0,esk55_0)))
| ~ ssList(cons(esk53_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_26]),c_0_27])]) ).
cnf(c_0_29,negated_conjecture,
ssItem(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_30,plain,
! [X133,X134] :
( ~ ssList(X133)
| ~ ssList(X134)
| ssList(app(X133,X134)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
cnf(c_0_31,negated_conjecture,
( app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0)) = esk50_0
| ~ ssList(app(esk54_0,cons(esk52_0,esk55_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_20]),c_0_21]),c_0_29])]) ).
cnf(c_0_32,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_33,plain,
! [X70,X71,X72,X73,X74,X75] :
( ( ~ totalorderedP(X70)
| ~ ssItem(X71)
| ~ ssItem(X72)
| ~ ssList(X73)
| ~ ssList(X74)
| ~ ssList(X75)
| app(app(X73,cons(X71,X74)),cons(X72,X75)) != X70
| leq(X71,X72)
| ~ ssList(X70) )
& ( ssItem(esk25_1(X70))
| totalorderedP(X70)
| ~ ssList(X70) )
& ( ssItem(esk26_1(X70))
| totalorderedP(X70)
| ~ ssList(X70) )
& ( ssList(esk27_1(X70))
| totalorderedP(X70)
| ~ ssList(X70) )
& ( ssList(esk28_1(X70))
| totalorderedP(X70)
| ~ ssList(X70) )
& ( ssList(esk29_1(X70))
| totalorderedP(X70)
| ~ ssList(X70) )
& ( app(app(esk27_1(X70),cons(esk25_1(X70),esk28_1(X70))),cons(esk26_1(X70),esk29_1(X70))) = X70
| totalorderedP(X70)
| ~ ssList(X70) )
& ( ~ leq(esk25_1(X70),esk26_1(X70))
| totalorderedP(X70)
| ~ ssList(X70) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax11])])])])]) ).
cnf(c_0_34,negated_conjecture,
( app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0)) = esk50_0
| ~ ssList(cons(esk52_0,esk55_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_17])]) ).
cnf(c_0_35,plain,
( leq(X2,X3)
| ~ totalorderedP(X1)
| ~ ssItem(X2)
| ~ ssItem(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_36,negated_conjecture,
app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_20]),c_0_16]),c_0_22])]) ).
cnf(c_0_37,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_38,plain,
! [X147,X148] :
( ~ ssItem(X147)
| ~ ssItem(X148)
| ~ lt(X147,X148)
| ~ lt(X148,X147) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax33])])])]) ).
fof(c_0_39,plain,
! [X245,X246] :
( ~ ssItem(X245)
| ~ ssItem(X246)
| ~ leq(X245,X246)
| X245 = X246
| lt(X245,X246) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax92])])]) ).
cnf(c_0_40,plain,
( leq(X1,X2)
| ~ totalorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_41,negated_conjecture,
app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,esk56_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_25]),c_0_27]),c_0_29])]) ).
cnf(c_0_42,negated_conjecture,
totalorderedP(esk50_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_43,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_37,c_0_12]) ).
cnf(c_0_44,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| ~ lt(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_45,negated_conjecture,
lt(esk53_0,esk52_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_46,plain,
( X1 = X2
| lt(X1,X2)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_47,negated_conjecture,
leq(esk52_0,esk53_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_43]),c_0_27]),c_0_16]),c_0_17]),c_0_29]),c_0_22])]) ).
cnf(c_0_48,negated_conjecture,
~ lt(esk52_0,esk53_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_29]),c_0_22])]) ).
cnf(c_0_49,negated_conjecture,
esk53_0 = esk52_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_29]),c_0_22])]),c_0_48]) ).
cnf(c_0_50,negated_conjecture,
~ lt(esk52_0,esk52_0),
inference(rw,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_49]),c_0_50]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC302+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.34 % Computer : n020.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sat Jun 11 22:16:07 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.72/2.32 # ENIGMATIC: Solved by autoschedule:
% 7.72/2.32 # No SInE strategy applied
% 7.72/2.32 # Trying AutoSched0 for 150 seconds
% 7.72/2.32 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 7.72/2.32 # and selection function SelectNewComplexAHP.
% 7.72/2.32 #
% 7.72/2.32 # Preprocessing time : 0.032 s
% 7.72/2.32 # Presaturation interreduction done
% 7.72/2.32
% 7.72/2.32 # Proof found!
% 7.72/2.32 # SZS status Theorem
% 7.72/2.32 # SZS output start CNFRefutation
% See solution above
% 7.72/2.32 # Training examples: 0 positive, 0 negative
% 7.72/2.32
% 7.72/2.32 # -------------------------------------------------
% 7.72/2.32 # User time : 0.073 s
% 7.72/2.32 # System time : 0.009 s
% 7.72/2.32 # Total time : 0.083 s
% 7.72/2.32 # Maximum resident set size: 7120 pages
% 7.72/2.32
%------------------------------------------------------------------------------