TSTP Solution File: SWC182+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC182+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:08 EDT 2022
% Result : Theorem 7.52s 2.54s
% Output : CNFRefutation 7.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 39 ( 15 unt; 0 def)
% Number of atoms : 147 ( 42 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 177 ( 69 ~; 62 |; 21 &)
% ( 2 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 52 ( 0 sgn 34 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( nil != X3
| X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(app(X6,cons(X5,nil)),X7) != X1
| ( ~ memberP(X6,X5)
& ~ memberP(X7,X5) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax3,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ( memberP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(X3,cons(X2,X4)) = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax3) ).
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax38) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( nil != X3
| X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(app(X6,cons(X5,nil)),X7) != X1
| ( ~ memberP(X6,X5)
& ~ memberP(X7,X5) ) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_8,negated_conjecture,
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& nil = esk50_0
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& ssItem(esk52_0)
& ssList(esk53_0)
& ssList(esk54_0)
& app(app(esk53_0,cons(esk52_0,nil)),esk54_0) = esk48_0
& ( memberP(esk53_0,esk52_0)
| memberP(esk54_0,esk52_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_9,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_10,negated_conjecture,
nil = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X226,X227] :
( ( nil = X227
| nil != app(X226,X227)
| ~ ssList(X227)
| ~ ssList(X226) )
& ( nil = X226
| nil != app(X226,X227)
| ~ ssList(X227)
| ~ ssList(X226) )
& ( nil != X227
| nil != X226
| nil = app(X226,X227)
| ~ ssList(X227)
| ~ ssList(X226) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])]) ).
cnf(c_0_12,negated_conjecture,
app(app(esk53_0,cons(esk52_0,nil)),esk54_0) = esk48_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
esk48_0 = nil,
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( nil = X1
| nil != app(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
app(app(esk53_0,cons(esk52_0,nil)),esk54_0) = nil,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
ssList(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_17,plain,
! [X131,X132] :
( ~ ssList(X131)
| ~ ssList(X132)
| ssList(app(X131,X132)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
cnf(c_0_18,negated_conjecture,
( esk54_0 = nil
| ~ ssList(app(esk53_0,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(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_20,negated_conjecture,
ssList(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_21,plain,
! [X112,X113] :
( ~ ssList(X112)
| ~ ssItem(X113)
| ssList(cons(X113,X112)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_22,negated_conjecture,
( esk54_0 = nil
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_23,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_24,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_25,negated_conjecture,
ssItem(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_26,negated_conjecture,
esk54_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25])]) ).
cnf(c_0_27,plain,
( nil = X1
| nil != app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_28,negated_conjecture,
app(app(esk53_0,cons(esk52_0,nil)),nil) = nil,
inference(rw,[status(thm)],[c_0_15,c_0_26]) ).
fof(c_0_29,plain,
! [X12,X13,X16,X17] :
( ( ssList(esk3_2(X12,X13))
| ~ memberP(X12,X13)
| ~ ssItem(X13)
| ~ ssList(X12) )
& ( ssList(esk4_2(X12,X13))
| ~ memberP(X12,X13)
| ~ ssItem(X13)
| ~ ssList(X12) )
& ( app(esk3_2(X12,X13),cons(X13,esk4_2(X12,X13))) = X12
| ~ memberP(X12,X13)
| ~ ssItem(X13)
| ~ ssList(X12) )
& ( ~ ssList(X16)
| ~ ssList(X17)
| app(X16,cons(X13,X17)) != X12
| memberP(X12,X13)
| ~ ssItem(X13)
| ~ ssList(X12) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3])])])])]) ).
cnf(c_0_30,negated_conjecture,
( app(esk53_0,cons(esk52_0,nil)) = nil
| ~ ssList(app(esk53_0,cons(esk52_0,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_24])]) ).
cnf(c_0_31,plain,
( memberP(X4,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,cons(X3,X2)) != X4
| ~ ssItem(X3)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_32,negated_conjecture,
( app(esk53_0,cons(esk52_0,nil)) = nil
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_19]),c_0_20])]) ).
fof(c_0_33,plain,
! [X158] :
( ~ ssItem(X158)
| ~ memberP(nil,X158) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax38])])]) ).
cnf(c_0_34,plain,
( memberP(app(X1,cons(X2,X3)),X2)
| ~ ssList(app(X1,cons(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(er,[status(thm)],[c_0_31]) ).
cnf(c_0_35,negated_conjecture,
app(esk53_0,cons(esk52_0,nil)) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_23]),c_0_24]),c_0_25])]) ).
cnf(c_0_36,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_37,negated_conjecture,
memberP(nil,esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_24]),c_0_20]),c_0_25])]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC182+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.34 % Computer : n027.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jun 12 06:52:02 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.52/2.54 # ENIGMATIC: Solved by autoschedule:
% 7.52/2.54 # No SInE strategy applied
% 7.52/2.54 # Trying AutoSched0 for 150 seconds
% 7.52/2.54 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 7.52/2.54 # and selection function SelectNewComplexAHP.
% 7.52/2.54 #
% 7.52/2.54 # Preprocessing time : 0.018 s
% 7.52/2.54 # Presaturation interreduction done
% 7.52/2.54
% 7.52/2.54 # Proof found!
% 7.52/2.54 # SZS status Theorem
% 7.52/2.54 # SZS output start CNFRefutation
% See solution above
% 7.52/2.54 # Training examples: 0 positive, 0 negative
% 7.52/2.54
% 7.52/2.54 # -------------------------------------------------
% 7.52/2.54 # User time : 0.044 s
% 7.52/2.54 # System time : 0.002 s
% 7.52/2.54 # Total time : 0.046 s
% 7.52/2.54 # Maximum resident set size: 7116 pages
% 7.52/2.54
%------------------------------------------------------------------------------