TSTP Solution File: SWC188+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC188+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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:11 EDT 2022
% Result : Theorem 8.26s 2.37s
% Output : CNFRefutation 8.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 9
% Syntax : Number of formulae : 53 ( 22 unt; 0 def)
% Number of atoms : 214 ( 70 equ)
% Maximal formula atoms : 34 ( 4 avg)
% Number of connectives : 243 ( 82 ~; 92 |; 33 &)
% ( 1 <=>; 35 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 10 con; 0-2 aty)
% Number of variables : 73 ( 0 sgn 51 !; 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
| 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(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(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(ax27,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax27) ).
fof(ax14,axiom,
! [X1] :
( ssList(X1)
=> ( equalelemsP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X4,cons(X2,cons(X3,X5))) = X1
=> X2 = X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax14) ).
fof(ax73,axiom,
! [X1] :
( ssItem(X1)
=> equalelemsP(cons(X1,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax73) ).
fof(ax74,axiom,
equalelemsP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax74) ).
fof(c_0_9,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
| 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_10,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
& 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_9])])])])])]) ).
cnf(c_0_11,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_10]) ).
cnf(c_0_12,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,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_14,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_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(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_17,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_18,negated_conjecture,
( app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0) = esk50_0
| ~ ssList(cons(esk53_0,nil))
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_19,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_20,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_21,negated_conjecture,
ssItem(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,negated_conjecture,
( app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_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_18,c_0_19]),c_0_20]),c_0_21])]) ).
cnf(c_0_23,negated_conjecture,
ssItem(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_24,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])])]) ).
cnf(c_0_25,negated_conjecture,
app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_19]),c_0_20]),c_0_23])]) ).
cnf(c_0_26,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_27,negated_conjecture,
( app(app(esk54_0,cons(esk52_0,cons(esk53_0,nil))),esk55_0) = esk50_0
| ~ ssList(cons(esk53_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_23])]) ).
cnf(c_0_28,negated_conjecture,
app(app(esk54_0,cons(esk52_0,cons(esk53_0,nil))),esk55_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_19]),c_0_20]),c_0_21])]) ).
cnf(c_0_29,negated_conjecture,
ssList(esk55_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_30,negated_conjecture,
( app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0)) = esk50_0
| ~ ssList(cons(esk52_0,cons(esk53_0,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_28]),c_0_29]),c_0_16])]) ).
cnf(c_0_31,negated_conjecture,
( app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0)) = esk50_0
| ~ ssList(cons(esk53_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_19]),c_0_23])]) ).
fof(c_0_32,plain,
! [X136,X137,X138] :
( ~ ssList(X136)
| ~ ssList(X137)
| ~ ssItem(X138)
| cons(X138,app(X137,X136)) = app(cons(X138,X137),X136) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])]) ).
cnf(c_0_33,negated_conjecture,
app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_19]),c_0_20]),c_0_21])]) ).
cnf(c_0_34,plain,
( cons(X3,app(X2,X1)) = app(cons(X3,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_35,plain,
! [X104,X105,X106,X107,X108] :
( ( ~ equalelemsP(X104)
| ~ ssItem(X105)
| ~ ssItem(X106)
| ~ ssList(X107)
| ~ ssList(X108)
| app(X107,cons(X105,cons(X106,X108))) != X104
| X105 = X106
| ~ ssList(X104) )
& ( ssItem(esk40_1(X104))
| equalelemsP(X104)
| ~ ssList(X104) )
& ( ssItem(esk41_1(X104))
| equalelemsP(X104)
| ~ ssList(X104) )
& ( ssList(esk42_1(X104))
| equalelemsP(X104)
| ~ ssList(X104) )
& ( ssList(esk43_1(X104))
| equalelemsP(X104)
| ~ ssList(X104) )
& ( app(esk42_1(X104),cons(esk40_1(X104),cons(esk41_1(X104),esk43_1(X104)))) = X104
| equalelemsP(X104)
| ~ ssList(X104) )
& ( esk40_1(X104) != esk41_1(X104)
| equalelemsP(X104)
| ~ ssList(X104) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax14])])])])]) ).
cnf(c_0_36,negated_conjecture,
( app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0))) = esk50_0
| ~ ssList(cons(esk53_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_29]),c_0_23])]) ).
fof(c_0_37,plain,
! [X210] :
( ~ ssItem(X210)
| equalelemsP(cons(X210,nil)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax73])]) ).
cnf(c_0_38,plain,
( X2 = X3
| ~ equalelemsP(X1)
| ~ ssItem(X2)
| ~ ssItem(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| app(X4,cons(X2,cons(X3,X5))) != X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_39,negated_conjecture,
app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0))) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_19]),c_0_20]),c_0_21])]) ).
cnf(c_0_40,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_41,plain,
( equalelemsP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( nil = esk50_0
| cons(esk56_0,nil) = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_43,negated_conjecture,
( nil = esk50_0
| ssItem(esk56_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_44,plain,
( X1 = X2
| ~ equalelemsP(app(X3,cons(X1,cons(X2,X4))))
| ~ ssList(app(X3,cons(X1,cons(X2,X4))))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_38]) ).
cnf(c_0_45,negated_conjecture,
app(esk54_0,cons(esk52_0,cons(esk53_0,esk55_0))) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_26]),c_0_29]),c_0_21])]) ).
cnf(c_0_46,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_40,c_0_12]) ).
cnf(c_0_47,negated_conjecture,
esk52_0 != esk53_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_48,negated_conjecture,
( esk50_0 = nil
| equalelemsP(esk50_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_49,negated_conjecture,
~ equalelemsP(esk50_0),
inference(sr,[status(thm)],[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_29]),c_0_16]),c_0_21]),c_0_23])]),c_0_47]) ).
cnf(c_0_50,negated_conjecture,
esk50_0 = nil,
inference(sr,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_51,plain,
equalelemsP(nil),
inference(split_conjunct,[status(thm)],[ax74]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50]),c_0_51])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC188+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n027.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 21:08:48 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.26/2.37 # ENIGMATIC: Solved by autoschedule:
% 8.26/2.37 # No SInE strategy applied
% 8.26/2.37 # Trying AutoSched0 for 150 seconds
% 8.26/2.37 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 8.26/2.37 # and selection function SelectNewComplexAHP.
% 8.26/2.37 #
% 8.26/2.37 # Preprocessing time : 0.037 s
% 8.26/2.37 # Presaturation interreduction done
% 8.26/2.37
% 8.26/2.37 # Proof found!
% 8.26/2.37 # SZS status Theorem
% 8.26/2.37 # SZS output start CNFRefutation
% See solution above
% 8.26/2.37 # Training examples: 0 positive, 0 negative
% 8.26/2.37
% 8.26/2.37 # -------------------------------------------------
% 8.26/2.37 # User time : 0.075 s
% 8.26/2.37 # System time : 0.012 s
% 8.26/2.37 # Total time : 0.087 s
% 8.26/2.37 # Maximum resident set size: 7120 pages
% 8.26/2.37
%------------------------------------------------------------------------------