%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC005+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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:00 EDT 2022
% Result : Theorem 7.71s 2.31s
% Output : CNFRefutation 7.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 11
% Syntax : Number of formulae : 61 ( 12 unt; 0 def)
% Number of atoms : 235 ( 83 equ)
% Maximal formula atoms : 34 ( 3 avg)
% Number of connectives : 290 ( 116 ~; 117 |; 30 &)
% ( 1 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 5 avg)
% Maximal term depth : 3 ( 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 : 81 ( 0 sgn 42 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X5,X6),X7) = X2
& app(X5,X7) = X1
& neq(X6,nil) ) ) )
| ? [X8] :
( ssList(X8)
& X3 != X8
& tl(X4) = X8
& neq(nil,X4) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
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(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
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(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(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(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
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(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax21) ).
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] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X5,X6),X7) = X2
& app(X5,X7) = X1
& neq(X6,nil) ) ) )
| ? [X8] :
( ssList(X8)
& X3 != X8
& tl(X4) = X8
& neq(nil,X4) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_12,negated_conjecture,
! [X257,X258,X259,X260] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& ( neq(esk49_0,nil)
| neq(esk49_0,nil) )
& ( ~ neq(esk51_0,nil)
| neq(esk49_0,nil) )
& ( neq(esk49_0,nil)
| ~ ssList(X257)
| ~ ssList(X258)
| ~ ssList(X259)
| app(app(X257,X258),X259) != esk49_0
| app(X257,X259) != esk48_0
| ~ neq(X258,nil) )
& ( ~ neq(esk51_0,nil)
| ~ ssList(X257)
| ~ ssList(X258)
| ~ ssList(X259)
| app(app(X257,X258),X259) != esk49_0
| app(X257,X259) != esk48_0
| ~ neq(X258,nil) )
& ( neq(esk49_0,nil)
| ~ ssList(X260)
| esk50_0 = X260
| tl(esk51_0) != X260
| ~ neq(nil,esk51_0) )
& ( ~ neq(esk51_0,nil)
| ~ ssList(X260)
| esk50_0 = X260
| tl(esk51_0) != X260
| ~ neq(nil,esk51_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_11])])])])])]) ).
cnf(c_0_13,negated_conjecture,
( neq(esk49_0,nil)
| neq(esk49_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_14,negated_conjecture,
neq(esk49_0,nil),
inference(cn,[status(thm)],[c_0_13]) ).
cnf(c_0_15,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( ~ neq(esk51_0,nil)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X1,X2),X3) != esk49_0
| app(X1,X3) != esk48_0
| ~ neq(X2,nil) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_18,plain,
! [X137] :
( ~ ssList(X137)
| app(nil,X137) = X137 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
cnf(c_0_19,negated_conjecture,
( app(app(X1,X2),X3) != esk51_0
| app(X1,X3) != esk48_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X2,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_15]),c_0_17])]) ).
cnf(c_0_20,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
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,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_23,plain,
! [X111,X112] :
( ( ~ neq(X111,X112)
| X111 != X112
| ~ ssList(X112)
| ~ ssList(X111) )
& ( X111 = X112
| neq(X111,X112)
| ~ ssList(X112)
| ~ ssList(X111) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
cnf(c_0_24,negated_conjecture,
( app(app(nil,X1),esk48_0) != esk51_0
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[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,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_26,plain,
! [X224,X225,X226] :
( ~ ssList(X224)
| ~ ssList(X225)
| ~ ssList(X226)
| app(app(X224,X225),X226) = app(X224,app(X225,X226)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])]) ).
cnf(c_0_27,negated_conjecture,
( X1 = nil
| app(app(nil,X1),esk48_0) != esk51_0
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_21])]) ).
cnf(c_0_28,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_29,plain,
! [X222,X223] :
( ~ ssList(X222)
| ~ ssItem(X223)
| cons(X223,X222) = app(cons(X223,nil),X222) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
cnf(c_0_30,negated_conjecture,
( esk50_0 = X1
| ~ neq(esk51_0,nil)
| ~ ssList(X1)
| tl(esk51_0) != X1
| ~ neq(nil,esk51_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_31,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_32,plain,
! [X129] :
( ~ ssList(X129)
| nil = X129
| ssList(tl(X129)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax24])]) ).
cnf(c_0_33,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_34,negated_conjecture,
( X1 = nil
| app(nil,app(X1,esk48_0)) != esk51_0
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_22]),c_0_21])]) ).
cnf(c_0_35,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_36,plain,
! [X113,X114] :
( ~ ssList(X113)
| ~ ssItem(X114)
| ssList(cons(X114,X113)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_37,negated_conjecture,
( tl(esk51_0) = esk48_0
| ~ ssList(tl(esk51_0))
| ~ neq(nil,esk51_0) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_17])])]) ).
cnf(c_0_38,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_39,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_33,c_0_15]) ).
cnf(c_0_40,negated_conjecture,
( cons(X1,nil) = nil
| app(nil,cons(X1,esk48_0)) != esk51_0
| ~ ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_22])]) ).
cnf(c_0_41,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
fof(c_0_42,plain,
! [X215] :
( ~ ssList(X215)
| nil = X215
| cons(hd(X215),tl(X215)) = X215 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])]) ).
cnf(c_0_43,negated_conjecture,
( tl(esk51_0) = esk48_0
| esk51_0 = nil
| ~ neq(nil,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).
cnf(c_0_44,negated_conjecture,
( cons(X1,nil) = nil
| app(nil,cons(X1,esk48_0)) != esk51_0
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_21])]) ).
cnf(c_0_45,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_46,negated_conjecture,
( tl(esk51_0) = esk48_0
| esk51_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_25]),c_0_39]),c_0_21])]) ).
cnf(c_0_47,negated_conjecture,
( cons(X1,nil) = nil
| cons(X1,esk48_0) != esk51_0
| ~ ssList(cons(X1,esk48_0))
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_20]) ).
cnf(c_0_48,negated_conjecture,
( cons(hd(esk51_0),esk48_0) = esk51_0
| esk51_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_39])]) ).
fof(c_0_49,plain,
! [X126] :
( ~ ssList(X126)
| nil = X126
| ssItem(hd(X126)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax22])]) ).
fof(c_0_50,plain,
! [X124,X125] :
( ~ ssList(X124)
| ~ ssItem(X125)
| nil != cons(X125,X124) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax21])])]) ).
cnf(c_0_51,negated_conjecture,
( cons(hd(esk51_0),nil) = nil
| esk51_0 = nil
| ~ ssItem(hd(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_39])]) ).
cnf(c_0_52,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_53,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| nil != cons(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_54,negated_conjecture,
( cons(hd(esk51_0),nil) = nil
| esk51_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_39])]) ).
cnf(c_0_55,negated_conjecture,
( esk51_0 = nil
| ~ ssItem(hd(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_21])]) ).
cnf(c_0_56,plain,
( ~ neq(X1,X2)
| X1 != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_57,negated_conjecture,
esk51_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_52]),c_0_39])]) ).
cnf(c_0_58,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_56]) ).
cnf(c_0_59,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_17,c_0_57]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC005+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n018.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 12 00:23:58 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.42 # ENIGMATIC: Selected SinE mode:
% 0.19/0.43 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.43 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.43 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.43 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.71/2.31 # ENIGMATIC: Solved by autoschedule:
% 7.71/2.31 # No SInE strategy applied
% 7.71/2.31 # Trying AutoSched0 for 150 seconds
% 7.71/2.31 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 7.71/2.31 # and selection function SelectNewComplexAHP.
% 7.71/2.31 #
% 7.71/2.31 # Preprocessing time : 0.021 s
% 7.71/2.31 # Presaturation interreduction done
% 7.71/2.31
% 7.71/2.31 # Proof found!
% 7.71/2.31 # SZS status Theorem
% 7.71/2.31 # SZS output start CNFRefutation
% See solution above
% 7.71/2.31 # Training examples: 0 positive, 0 negative
% 7.71/2.31
% 7.71/2.31 # -------------------------------------------------
% 7.71/2.31 # User time : 0.046 s
% 7.71/2.31 # System time : 0.007 s
% 7.71/2.31 # Total time : 0.053 s
% 7.71/2.31 # Maximum resident set size: 7120 pages
% 7.71/2.31
%------------------------------------------------------------------------------