TSTP Solution File: SWC314+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC314+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:55 EDT 2022
% Result : Theorem 7.60s 2.33s
% Output : CNFRefutation 7.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 10
% Syntax : Number of formulae : 59 ( 12 unt; 0 def)
% Number of atoms : 252 ( 113 equ)
% Maximal formula atoms : 36 ( 4 avg)
% Number of connectives : 309 ( 116 ~; 126 |; 42 &)
% ( 1 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 77 ( 0 sgn 46 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( nil != X3
& nil = X4 )
| ( ? [X5] :
( ssList(X5)
& X3 != X5
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& tl(X4) = X6
& app(X6,X7) = X5
& ? [X8] :
( ssItem(X8)
& cons(X8,nil) = X7
& hd(X4) = X8
& neq(nil,X4) )
& neq(nil,X4) ) ) )
& neq(X4,nil) )
| ( ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ~ ssList(X10)
| app(cons(X9,nil),X10) != X2
| app(X10,cons(X9,nil)) = X1 ) )
& ( nil != X2
| nil = X1 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
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(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(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax23,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> hd(cons(X2,X1)) = X2 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax23) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax25,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> tl(cons(X2,X1)) = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax25) ).
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_10,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( nil != X3
& nil = X4 )
| ( ? [X5] :
( ssList(X5)
& X3 != X5
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& tl(X4) = X6
& app(X6,X7) = X5
& ? [X8] :
( ssItem(X8)
& cons(X8,nil) = X7
& hd(X4) = X8
& neq(nil,X4) )
& neq(nil,X4) ) ) )
& neq(X4,nil) )
| ( ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ~ ssList(X10)
| app(cons(X9,nil),X10) != X2
| app(X10,cons(X9,nil)) = X1 ) )
& ( nil != X2
| nil = X1 ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_11,negated_conjecture,
! [X259,X260,X261,X262] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& ( nil = esk50_0
| nil != esk51_0 )
& ( ~ ssList(X259)
| esk50_0 = X259
| ~ ssList(X260)
| ~ ssList(X261)
| tl(esk51_0) != X260
| app(X260,X261) != X259
| ~ ssItem(X262)
| cons(X262,nil) != X261
| hd(esk51_0) != X262
| ~ neq(nil,esk51_0)
| ~ neq(nil,esk51_0)
| ~ neq(esk51_0,nil) )
& ( nil = esk49_0
| ssItem(esk52_0) )
& ( nil != esk48_0
| ssItem(esk52_0) )
& ( nil = esk49_0
| ssList(esk53_0) )
& ( nil != esk48_0
| ssList(esk53_0) )
& ( nil = esk49_0
| app(cons(esk52_0,nil),esk53_0) = esk49_0 )
& ( nil != esk48_0
| app(cons(esk52_0,nil),esk53_0) = esk49_0 )
& ( nil = esk49_0
| app(esk53_0,cons(esk52_0,nil)) != esk48_0 )
& ( nil != esk48_0
| app(esk53_0,cons(esk52_0,nil)) != esk48_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])])])])])]) ).
cnf(c_0_12,negated_conjecture,
( esk50_0 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| tl(esk51_0) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(esk51_0) != X4
| ~ neq(nil,esk51_0)
| ~ neq(nil,esk51_0)
| ~ neq(esk51_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_13,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_14,negated_conjecture,
( esk50_0 = X1
| hd(esk51_0) != X4
| tl(esk51_0) != X2
| app(X2,X3) != X1
| cons(X4,nil) != X3
| ~ ssItem(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(nil,esk51_0)
| ~ neq(esk51_0,nil) ),
inference(cn,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X131] :
( ~ ssList(X131)
| nil = X131
| ssList(tl(X131)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax24])]) ).
cnf(c_0_19,negated_conjecture,
( app(tl(esk49_0),cons(hd(esk49_0),nil)) = esk48_0
| ~ ssList(cons(hd(esk49_0),nil))
| ~ ssList(tl(esk49_0))
| ~ neq(nil,esk49_0)
| ~ neq(esk49_0,nil)
| ~ ssItem(hd(esk49_0)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_16]),c_0_16]),c_0_16])])])])]),c_0_17]) ).
cnf(c_0_20,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_22,plain,
! [X113,X114] :
( ( ~ neq(X113,X114)
| X113 != X114
| ~ ssList(X114)
| ~ ssList(X113) )
& ( X113 = X114
| neq(X113,X114)
| ~ ssList(X114)
| ~ ssList(X113) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
fof(c_0_23,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_24,negated_conjecture,
( app(tl(esk49_0),cons(hd(esk49_0),nil)) = esk48_0
| esk49_0 = nil
| ~ ssList(cons(hd(esk49_0),nil))
| ~ neq(nil,esk49_0)
| ~ neq(esk49_0,nil)
| ~ ssItem(hd(esk49_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_25,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_27,plain,
! [X129,X130] :
( ~ ssList(X129)
| ~ ssItem(X130)
| hd(cons(X130,X129)) = X130 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax23])])]) ).
cnf(c_0_28,negated_conjecture,
( nil = esk49_0
| app(cons(esk52_0,nil),esk53_0) = esk49_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_29,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,negated_conjecture,
( nil = esk49_0
| ssItem(esk52_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_31,negated_conjecture,
( nil = esk49_0
| ssList(esk53_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_32,negated_conjecture,
( app(tl(esk49_0),cons(hd(esk49_0),nil)) = esk48_0
| esk49_0 = nil
| ~ ssList(cons(hd(esk49_0),nil))
| ~ neq(esk49_0,nil)
| ~ ssItem(hd(esk49_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_21]),c_0_26])]) ).
cnf(c_0_33,plain,
( hd(cons(X2,X1)) = X2
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,negated_conjecture,
( cons(esk52_0,esk53_0) = esk49_0
| esk49_0 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31]) ).
cnf(c_0_35,negated_conjecture,
( app(tl(esk49_0),cons(hd(esk49_0),nil)) = esk48_0
| esk49_0 = nil
| ~ ssList(cons(hd(esk49_0),nil))
| ~ ssItem(hd(esk49_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_25]),c_0_26]),c_0_21])]) ).
cnf(c_0_36,negated_conjecture,
( hd(esk49_0) = esk52_0
| esk49_0 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_30]),c_0_31]) ).
fof(c_0_37,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])])]) ).
fof(c_0_38,plain,
! [X132,X133] :
( ~ ssList(X132)
| ~ ssItem(X133)
| tl(cons(X133,X132)) = X132 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax25])])]) ).
cnf(c_0_39,negated_conjecture,
( app(tl(esk49_0),cons(esk52_0,nil)) = esk48_0
| esk49_0 = nil
| ~ ssList(cons(esk52_0,nil)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_30]) ).
cnf(c_0_40,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_41,plain,
( tl(cons(X2,X1)) = X1
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_42,negated_conjecture,
( nil = esk50_0
| nil != esk51_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_43,negated_conjecture,
( app(tl(esk49_0),cons(esk52_0,nil)) = esk48_0
| esk49_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_26])]),c_0_30]) ).
cnf(c_0_44,negated_conjecture,
( tl(esk49_0) = esk53_0
| esk49_0 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_34]),c_0_30]),c_0_31]) ).
cnf(c_0_45,negated_conjecture,
( nil = esk49_0
| app(esk53_0,cons(esk52_0,nil)) != esk48_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_46,negated_conjecture,
( esk48_0 = nil
| esk49_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_15]),c_0_16]) ).
cnf(c_0_47,negated_conjecture,
esk49_0 = nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).
cnf(c_0_48,negated_conjecture,
( app(cons(esk52_0,nil),esk53_0) = esk49_0
| nil != esk48_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_49,negated_conjecture,
esk48_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47])]) ).
cnf(c_0_50,negated_conjecture,
( ssList(esk53_0)
| nil != esk48_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_51,negated_conjecture,
( ssItem(esk52_0)
| nil != esk48_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_52,plain,
! [X126,X127] :
( ~ ssList(X126)
| ~ ssItem(X127)
| nil != cons(X127,X126) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax21])])]) ).
cnf(c_0_53,negated_conjecture,
app(cons(esk52_0,nil),esk53_0) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_47]),c_0_49])]) ).
cnf(c_0_54,negated_conjecture,
ssList(esk53_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_49])]) ).
cnf(c_0_55,negated_conjecture,
ssItem(esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_49])]) ).
cnf(c_0_56,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| nil != cons(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_57,negated_conjecture,
cons(esk52_0,esk53_0) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_53]),c_0_54]),c_0_55])]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_54]),c_0_55])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC314+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n007.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 08:47:39 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
% 7.60/2.33 # ENIGMATIC: Solved by autoschedule:
% 7.60/2.33 # No SInE strategy applied
% 7.60/2.33 # Trying AutoSched0 for 150 seconds
% 7.60/2.33 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 7.60/2.33 # and selection function SelectNewComplexAHP.
% 7.60/2.33 #
% 7.60/2.33 # Preprocessing time : 0.035 s
% 7.60/2.33 # Presaturation interreduction done
% 7.60/2.33
% 7.60/2.33 # Proof found!
% 7.60/2.33 # SZS status Theorem
% 7.60/2.33 # SZS output start CNFRefutation
% See solution above
% 7.60/2.33 # Training examples: 0 positive, 0 negative
% 7.60/2.33
% 7.60/2.33 # -------------------------------------------------
% 7.60/2.33 # User time : 0.095 s
% 7.60/2.33 # System time : 0.007 s
% 7.60/2.33 # Total time : 0.102 s
% 7.60/2.33 # Maximum resident set size: 7120 pages
% 7.60/2.33
%------------------------------------------------------------------------------