TSTP Solution File: SWC172+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC172+1 : TPTP v8.1.0. Released v2.4.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 : Tue Jul 19 20:14:04 EDT 2022
% Result : Theorem 10.55s 2.73s
% Output : CNFRefutation 10.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 52 ( 21 unt; 0 def)
% Number of atoms : 225 ( 62 equ)
% Maximal formula atoms : 34 ( 4 avg)
% Number of connectives : 270 ( 97 ~; 105 |; 35 &)
% ( 2 <=>; 31 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 5 avg)
% Maximal term depth : 5 ( 1 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 : 79 ( 0 sgn 55 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8) != X1 ) )
| neq(X5,X6) ) )
| ( ! [X9] :
( ~ ssItem(X9)
| cons(X9,nil) != X3
| ~ memberP(X4,X9)
| ? [X10] :
( ssItem(X10)
& X9 != X10
& memberP(X4,X10)
& leq(X10,X9) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax1,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax1) ).
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(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax13,axiom,
! [X1] :
( ssList(X1)
=> ( duplicatefreeP(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
=> X2 != X3 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax13) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax71,axiom,
! [X1] :
( ssItem(X1)
=> duplicatefreeP(cons(X1,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax71) ).
fof(ax72,axiom,
duplicatefreeP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax72) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8) != X1 ) )
| neq(X5,X6) ) )
| ( ! [X9] :
( ~ ssItem(X9)
| cons(X9,nil) != X3
| ~ memberP(X4,X9)
| ? [X10] :
( ssItem(X10)
& X9 != X10
& memberP(X4,X10)
& leq(X10,X9) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_11,negated_conjecture,
! [X264] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& ssItem(esk52_0)
& ssItem(esk53_0)
& ssList(esk54_0)
& ssList(esk55_0)
& app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk48_0
& ~ neq(esk52_0,esk53_0)
& ( nil = esk51_0
| ssItem(esk56_0) )
& ( nil = esk50_0
| ssItem(esk56_0) )
& ( nil = esk51_0
| cons(esk56_0,nil) = esk50_0 )
& ( nil = esk50_0
| cons(esk56_0,nil) = esk50_0 )
& ( nil = esk51_0
| memberP(esk51_0,esk56_0) )
& ( nil = esk50_0
| memberP(esk51_0,esk56_0) )
& ( nil = esk51_0
| ~ ssItem(X264)
| esk56_0 = X264
| ~ memberP(esk51_0,X264)
| ~ leq(X264,esk56_0) )
& ( nil = esk50_0
| ~ ssItem(X264)
| esk56_0 = X264
| ~ memberP(esk51_0,X264)
| ~ leq(X264,esk56_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_10])])])])])]) ).
fof(c_0_12,plain,
! [X11,X12] :
( ( ~ neq(X11,X12)
| X11 != X12
| ~ ssItem(X12)
| ~ ssItem(X11) )
& ( X11 = X12
| neq(X11,X12)
| ~ ssItem(X12)
| ~ ssItem(X11) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1])])])]) ).
cnf(c_0_13,negated_conjecture,
app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk48_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
~ neq(esk52_0,esk53_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
ssItem(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
ssItem(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_19,plain,
! [X226,X227,X228] :
( ~ ssList(X226)
| ~ ssList(X227)
| ~ ssList(X228)
| app(app(X226,X227),X228) = app(X226,app(X227,X228)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])]) ).
cnf(c_0_20,negated_conjecture,
app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk50_0,
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,negated_conjecture,
esk53_0 = esk52_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_22,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,negated_conjecture,
app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk52_0,nil)),esk55_0) = esk50_0,
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
ssList(esk55_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_25,plain,
! [X115,X116] :
( ~ ssList(X115)
| ~ ssItem(X116)
| ssList(cons(X116,X115)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_26,negated_conjecture,
( app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0)) = esk50_0
| ~ ssList(app(esk54_0,cons(esk52_0,nil)))
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_27,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_28,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_29,plain,
! [X134,X135] :
( ~ ssList(X134)
| ~ ssList(X135)
| ssList(app(X134,X135)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
cnf(c_0_30,negated_conjecture,
( app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0)) = esk50_0
| ~ ssList(app(esk54_0,cons(esk52_0,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_18])]) ).
cnf(c_0_31,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_32,negated_conjecture,
ssList(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_33,plain,
! [X93,X94,X95,X96,X97,X98] :
( ( ~ duplicatefreeP(X93)
| ~ ssItem(X94)
| ~ ssItem(X95)
| ~ ssList(X96)
| ~ ssList(X97)
| ~ ssList(X98)
| app(app(X96,cons(X94,X97)),cons(X95,X98)) != X93
| X94 != X95
| ~ ssList(X93) )
& ( ssItem(esk35_1(X93))
| duplicatefreeP(X93)
| ~ ssList(X93) )
& ( ssItem(esk36_1(X93))
| duplicatefreeP(X93)
| ~ ssList(X93) )
& ( ssList(esk37_1(X93))
| duplicatefreeP(X93)
| ~ ssList(X93) )
& ( ssList(esk38_1(X93))
| duplicatefreeP(X93)
| ~ ssList(X93) )
& ( ssList(esk39_1(X93))
| duplicatefreeP(X93)
| ~ ssList(X93) )
& ( app(app(esk37_1(X93),cons(esk35_1(X93),esk38_1(X93))),cons(esk36_1(X93),esk39_1(X93))) = X93
| duplicatefreeP(X93)
| ~ ssList(X93) )
& ( esk35_1(X93) = esk36_1(X93)
| duplicatefreeP(X93)
| ~ ssList(X93) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax13])])])])]) ).
cnf(c_0_34,negated_conjecture,
( app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0)) = esk50_0
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
fof(c_0_35,plain,
! [X224,X225] :
( ~ ssList(X224)
| ~ ssItem(X225)
| cons(X225,X224) = app(cons(X225,nil),X224) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
fof(c_0_36,plain,
! [X209] :
( ~ ssItem(X209)
| duplicatefreeP(cons(X209,nil)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax71])]) ).
cnf(c_0_37,plain,
( ~ duplicatefreeP(X1)
| ~ ssItem(X2)
| ~ ssItem(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| X2 != X3
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_38,negated_conjecture,
app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_27]),c_0_28]),c_0_18])]) ).
cnf(c_0_39,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_40,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_41,plain,
( duplicatefreeP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_42,negated_conjecture,
( nil = esk50_0
| cons(esk56_0,nil) = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_43,negated_conjecture,
( nil = esk50_0
| ssItem(esk56_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_44,plain,
( ~ duplicatefreeP(app(app(X1,cons(X2,X3)),cons(X2,X4)))
| ~ ssList(app(app(X1,cons(X2,X3)),cons(X2,X4)))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_37])]) ).
cnf(c_0_45,negated_conjecture,
app(app(esk54_0,cons(esk52_0,nil)),cons(esk52_0,esk55_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_24]),c_0_18])]) ).
cnf(c_0_46,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_40,c_0_14]) ).
cnf(c_0_47,negated_conjecture,
( esk50_0 = nil
| duplicatefreeP(esk50_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_48,negated_conjecture,
~ duplicatefreeP(esk50_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(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_24]),c_0_28]),c_0_32]),c_0_18])]) ).
cnf(c_0_49,negated_conjecture,
esk50_0 = nil,
inference(sr,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_50,plain,
duplicatefreeP(nil),
inference(split_conjunct,[status(thm)],[ax72]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49]),c_0_50])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC172+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n005.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 12 12:04:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 10.55/2.73 # ENIGMATIC: Solved by autoschedule:
% 10.55/2.73 # No SInE strategy applied
% 10.55/2.73 # Trying AutoSched0 for 150 seconds
% 10.55/2.73 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 10.55/2.73 # and selection function SelectNewComplexAHP.
% 10.55/2.73 #
% 10.55/2.73 # Preprocessing time : 0.032 s
% 10.55/2.73 # Presaturation interreduction done
% 10.55/2.73
% 10.55/2.73 # Proof found!
% 10.55/2.73 # SZS status Theorem
% 10.55/2.73 # SZS output start CNFRefutation
% See solution above
% 10.55/2.73 # Training examples: 0 positive, 0 negative
% 10.55/2.73
% 10.55/2.73 # -------------------------------------------------
% 10.55/2.73 # User time : 0.095 s
% 10.55/2.73 # System time : 0.006 s
% 10.55/2.73 # Total time : 0.102 s
% 10.55/2.73 # Maximum resident set size: 7120 pages
% 10.55/2.73
%------------------------------------------------------------------------------