TSTP Solution File: SWC421+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC421+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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:15:36 EDT 2022
% Result : Theorem 7.66s 2.40s
% Output : CNFRefutation 7.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of formulae : 64 ( 14 unt; 0 def)
% Number of atoms : 265 ( 101 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 335 ( 134 ~; 133 |; 43 &)
% ( 1 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 91 ( 0 sgn 41 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X2
& app(app(X7,cons(X5,nil)),X6) = X1 ) ) )
| ( nil != X3
& nil = X4 )
| ( neq(X4,nil)
& ( ~ neq(X3,nil)
| ? [X8] :
( ssList(X8)
& X4 != X8
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& tl(X3) = X9
& app(X9,X10) = X8
& ? [X11] :
( ssItem(X11)
& cons(X11,nil) = X10
& hd(X3) = X11
& neq(nil,X3) )
& neq(nil,X3) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
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(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
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(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X2
& app(app(X7,cons(X5,nil)),X6) = X1 ) ) )
| ( nil != X3
& nil = X4 )
| ( neq(X4,nil)
& ( ~ neq(X3,nil)
| ? [X8] :
( ssList(X8)
& X4 != X8
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& tl(X3) = X9
& app(X9,X10) = X8
& ? [X11] :
( ssItem(X11)
& cons(X11,nil) = X10
& hd(X3) = X11
& neq(nil,X3) )
& neq(nil,X3) ) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_12,negated_conjecture,
! [X260,X261,X262,X263,X264,X265,X266] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& neq(esk49_0,nil)
& ( ~ ssItem(X260)
| ~ ssList(X261)
| ~ ssList(X262)
| app(app(X261,cons(X260,nil)),X262) != esk49_0
| app(app(X262,cons(X260,nil)),X261) != esk48_0 )
& ( nil = esk50_0
| nil != esk51_0 )
& ( neq(esk50_0,nil)
| ~ neq(esk51_0,nil) )
& ( ~ ssList(X263)
| esk51_0 = X263
| ~ ssList(X264)
| ~ ssList(X265)
| tl(esk50_0) != X264
| app(X264,X265) != X263
| ~ ssItem(X266)
| cons(X266,nil) != X265
| hd(esk50_0) != X266
| ~ neq(nil,esk50_0)
| ~ neq(nil,esk50_0)
| ~ neq(esk51_0,nil) ) ),
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_11])])])])])]) ).
cnf(c_0_13,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != esk49_0
| app(app(X3,cons(X1,nil)),X2) != esk48_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_14,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X140] :
( ~ ssList(X140)
| app(nil,X140) = X140 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
cnf(c_0_17,negated_conjecture,
( esk51_0 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| tl(esk50_0) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(esk50_0) != X4
| ~ neq(nil,esk50_0)
| ~ neq(nil,esk50_0)
| ~ neq(esk51_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
neq(esk49_0,nil),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_19,plain,
! [X135,X136] :
( ~ ssList(X135)
| ~ ssList(X136)
| ssList(app(X135,X136)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
cnf(c_0_20,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != esk50_0
| app(app(X3,cons(X2,nil)),X1) != esk51_0
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_21,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_23,plain,
! [X116,X117] :
( ~ ssList(X116)
| ~ ssItem(X117)
| ssList(cons(X117,X116)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_24,negated_conjecture,
( esk51_0 = X1
| hd(esk50_0) != X4
| tl(esk50_0) != X2
| app(X2,X3) != X1
| cons(X4,nil) != X3
| ~ ssItem(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(nil,esk50_0)
| ~ neq(esk51_0,nil) ),
inference(cn,[status(thm)],[c_0_17]) ).
cnf(c_0_25,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_18,c_0_15]) ).
cnf(c_0_26,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_27,plain,
! [X132] :
( ~ ssList(X132)
| nil = X132
| ssList(tl(X132)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax24])]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_29,negated_conjecture,
( app(app(X1,cons(X2,nil)),nil) != esk51_0
| app(cons(X2,nil),X1) != esk50_0
| ~ ssList(cons(X2,nil))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_30,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_31,plain,
! [X225,X226] :
( ~ ssList(X225)
| ~ ssItem(X226)
| cons(X226,X225) = app(cons(X226,nil),X225) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
cnf(c_0_32,negated_conjecture,
( app(tl(esk50_0),cons(hd(esk50_0),nil)) = esk51_0
| ~ ssList(cons(hd(esk50_0),nil))
| ~ ssList(tl(esk50_0))
| ~ neq(nil,esk50_0)
| ~ ssItem(hd(esk50_0)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])])])])])]),c_0_26]) ).
cnf(c_0_33,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_28,c_0_14]) ).
fof(c_0_35,plain,
! [X114,X115] :
( ( ~ neq(X114,X115)
| X114 != X115
| ~ ssList(X115)
| ~ ssList(X114) )
& ( X114 = X115
| neq(X114,X115)
| ~ ssList(X115)
| ~ ssList(X114) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
cnf(c_0_36,negated_conjecture,
( app(app(X1,cons(X2,nil)),nil) != esk51_0
| app(cons(X2,nil),X1) != esk50_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_22])]) ).
cnf(c_0_37,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
fof(c_0_38,plain,
! [X218] :
( ~ ssList(X218)
| nil = X218
| cons(hd(X218),tl(X218)) = X218 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])]) ).
cnf(c_0_39,negated_conjecture,
( app(tl(esk50_0),cons(hd(esk50_0),nil)) = esk51_0
| esk50_0 = nil
| ~ ssList(cons(hd(esk50_0),nil))
| ~ neq(nil,esk50_0)
| ~ ssItem(hd(esk50_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_40,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
fof(c_0_41,plain,
! [X129] :
( ~ ssList(X129)
| nil = X129
| ssItem(hd(X129)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax22])]) ).
cnf(c_0_42,negated_conjecture,
( app(app(X1,cons(X2,nil)),nil) != esk51_0
| cons(X2,X1) != esk50_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_44,negated_conjecture,
( app(tl(esk50_0),cons(hd(esk50_0),nil)) = esk51_0
| esk50_0 = nil
| ~ ssList(cons(hd(esk50_0),nil))
| ~ ssItem(hd(esk50_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_34]),c_0_22])]) ).
cnf(c_0_45,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_46,negated_conjecture,
( esk50_0 = nil
| app(app(tl(esk50_0),cons(hd(esk50_0),nil)),nil) != esk51_0
| ~ ssList(tl(esk50_0))
| ~ ssItem(hd(esk50_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43])]),c_0_34])]) ).
cnf(c_0_47,negated_conjecture,
( app(tl(esk50_0),cons(hd(esk50_0),nil)) = esk51_0
| esk50_0 = nil
| ~ ssList(cons(hd(esk50_0),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_34])]) ).
cnf(c_0_48,negated_conjecture,
( esk50_0 = nil
| app(app(tl(esk50_0),cons(hd(esk50_0),nil)),nil) != esk51_0
| ~ ssItem(hd(esk50_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_33]),c_0_34])]) ).
cnf(c_0_49,negated_conjecture,
( app(tl(esk50_0),cons(hd(esk50_0),nil)) = esk51_0
| esk50_0 = nil
| ~ ssItem(hd(esk50_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_30]),c_0_22])]) ).
cnf(c_0_50,negated_conjecture,
( esk50_0 = nil
| app(app(tl(esk50_0),cons(hd(esk50_0),nil)),nil) != esk51_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_45]),c_0_34])]) ).
cnf(c_0_51,negated_conjecture,
( app(tl(esk50_0),cons(hd(esk50_0),nil)) = esk51_0
| esk50_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_45]),c_0_34])]) ).
fof(c_0_52,plain,
! [X232] :
( ~ ssList(X232)
| app(X232,nil) = X232 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
cnf(c_0_53,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_54,negated_conjecture,
( neq(esk50_0,nil)
| ~ neq(esk51_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_55,negated_conjecture,
( esk50_0 = nil
| app(esk51_0,nil) != esk51_0 ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_57,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_53,c_0_15]) ).
cnf(c_0_58,plain,
( ~ neq(X1,X2)
| X1 != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_59,negated_conjecture,
neq(esk50_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_25])]) ).
cnf(c_0_60,negated_conjecture,
esk50_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57])]) ).
cnf(c_0_61,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_58]) ).
cnf(c_0_62,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_63,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWC421+1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 11 19:52:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46 # ENIGMATIC: Selected SinE mode:
% 0.19/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.66/2.40 # ENIGMATIC: Solved by autoschedule:
% 7.66/2.40 # No SInE strategy applied
% 7.66/2.40 # Trying AutoSched0 for 150 seconds
% 7.66/2.40 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 7.66/2.40 # and selection function SelectNewComplexAHP.
% 7.66/2.40 #
% 7.66/2.40 # Preprocessing time : 0.036 s
% 7.66/2.40 # Presaturation interreduction done
% 7.66/2.40
% 7.66/2.40 # Proof found!
% 7.66/2.40 # SZS status Theorem
% 7.66/2.40 # SZS output start CNFRefutation
% See solution above
% 7.66/2.40 # Training examples: 0 positive, 0 negative
% 7.66/2.40
% 7.66/2.40 # -------------------------------------------------
% 7.66/2.40 # User time : 0.072 s
% 7.66/2.40 # System time : 0.014 s
% 7.66/2.40 # Total time : 0.085 s
% 7.66/2.40 # Maximum resident set size: 7124 pages
% 7.66/2.40
%------------------------------------------------------------------------------