TSTP Solution File: SWC313+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC313+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n009.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 8.32s 2.56s
% Output : CNFRefutation 8.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 5
% Syntax : Number of formulae : 40 ( 9 unt; 0 def)
% Number of atoms : 173 ( 87 equ)
% Maximal formula atoms : 26 ( 4 avg)
% Number of connectives : 214 ( 81 ~; 87 |; 32 &)
% ( 1 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 4 ( 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 : 48 ( 0 sgn 22 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& app(X6,cons(X5,nil)) != X3
& app(cons(X5,nil),X6) = X4 ) )
| ( nil != X3
& nil = X4 )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(cons(X7,nil),X8) = X2
& app(X8,cons(X7,nil)) = X1 ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
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(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax20) ).
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(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& app(X6,cons(X5,nil)) != X3
& app(cons(X5,nil),X6) = X4 ) )
| ( nil != X3
& nil = X4 )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(cons(X7,nil),X8) = X2
& app(X8,cons(X7,nil)) = X1 ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_6,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
& ( ~ ssItem(X257)
| ~ ssList(X258)
| app(X258,cons(X257,nil)) = esk50_0
| app(cons(X257,nil),X258) != esk51_0 )
& ( nil = esk50_0
| nil != esk51_0 )
& ( neq(esk49_0,nil)
| nil = esk49_0 )
& ( ~ ssItem(X259)
| ~ ssList(X260)
| app(cons(X259,nil),X260) != esk49_0
| app(X260,cons(X259,nil)) != esk48_0
| nil = esk49_0 )
& ( neq(esk49_0,nil)
| nil != esk48_0 )
& ( ~ ssItem(X259)
| ~ ssList(X260)
| app(cons(X259,nil),X260) != esk49_0
| app(X260,cons(X259,nil)) != esk48_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_5])])])])])]) ).
cnf(c_0_7,negated_conjecture,
( app(X2,cons(X1,nil)) = esk50_0
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != esk51_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_8,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,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_11,negated_conjecture,
( app(X1,cons(X2,nil)) = esk48_0
| app(cons(X2,nil),X1) != esk49_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
cnf(c_0_12,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X121] :
( ( ssList(esk44_1(X121))
| nil = X121
| ~ ssList(X121) )
& ( ssItem(esk45_1(X121))
| nil = X121
| ~ ssList(X121) )
& ( cons(esk45_1(X121),esk44_1(X121)) = X121
| nil = X121
| ~ ssList(X121) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])]) ).
cnf(c_0_14,negated_conjecture,
( app(X1,cons(X2,nil)) = esk48_0
| cons(X2,X1) != esk49_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( cons(esk45_1(X1),esk44_1(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,negated_conjecture,
( app(esk44_1(esk49_0),cons(esk45_1(esk49_0),nil)) = esk48_0
| esk49_0 = nil
| ~ ssList(esk44_1(esk49_0))
| ~ ssItem(esk45_1(esk49_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15])]),c_0_16])]) ).
cnf(c_0_18,plain,
( ssList(esk44_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
( app(esk44_1(esk49_0),cons(esk45_1(esk49_0),nil)) = esk48_0
| esk49_0 = nil
| ~ ssItem(esk45_1(esk49_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_16])]) ).
cnf(c_0_20,plain,
( ssItem(esk45_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
( nil = esk49_0
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != esk49_0
| app(X2,cons(X1,nil)) != esk48_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,negated_conjecture,
( app(esk44_1(esk49_0),cons(esk45_1(esk49_0),nil)) = esk48_0
| esk49_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_16])]) ).
cnf(c_0_23,negated_conjecture,
( esk49_0 = nil
| app(cons(esk45_1(esk49_0),nil),esk44_1(esk49_0)) != esk49_0
| ~ ssList(esk44_1(esk49_0))
| ~ ssItem(esk45_1(esk49_0)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,negated_conjecture,
( esk49_0 = nil
| app(cons(esk45_1(esk49_0),nil),esk44_1(esk49_0)) != esk49_0
| ~ ssItem(esk45_1(esk49_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_18]),c_0_16])]) ).
cnf(c_0_25,negated_conjecture,
( esk49_0 = nil
| app(cons(esk45_1(esk49_0),nil),esk44_1(esk49_0)) != esk49_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_20]),c_0_16])]) ).
cnf(c_0_26,negated_conjecture,
( esk49_0 = nil
| cons(esk45_1(esk49_0),esk44_1(esk49_0)) != esk49_0
| ~ ssList(esk44_1(esk49_0))
| ~ ssItem(esk45_1(esk49_0)) ),
inference(spm,[status(thm)],[c_0_25,c_0_12]) ).
cnf(c_0_27,negated_conjecture,
( esk49_0 = nil
| cons(esk45_1(esk49_0),esk44_1(esk49_0)) != esk49_0
| ~ ssItem(esk45_1(esk49_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_18]),c_0_16])]) ).
cnf(c_0_28,negated_conjecture,
( nil = esk50_0
| nil != esk51_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_29,negated_conjecture,
( esk49_0 = nil
| cons(esk45_1(esk49_0),esk44_1(esk49_0)) != esk49_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_20]),c_0_16])]) ).
fof(c_0_30,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_31,negated_conjecture,
( esk48_0 = nil
| esk49_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_8]),c_0_9]) ).
cnf(c_0_32,negated_conjecture,
esk49_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_15]),c_0_16])]) ).
cnf(c_0_33,plain,
( ~ neq(X1,X2)
| X1 != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_34,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_35,negated_conjecture,
esk48_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
cnf(c_0_36,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_37,negated_conjecture,
neq(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_32]),c_0_35])]) ).
cnf(c_0_38,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWC313+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 : n009.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 : Sun Jun 12 05:19:09 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected SinE mode:
% 0.18/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.32/2.56 # ENIGMATIC: Solved by autoschedule:
% 8.32/2.56 # No SInE strategy applied
% 8.32/2.56 # Trying AutoSched0 for 150 seconds
% 8.32/2.56 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 8.32/2.56 # and selection function SelectNewComplexAHP.
% 8.32/2.56 #
% 8.32/2.56 # Preprocessing time : 0.033 s
% 8.32/2.56 # Presaturation interreduction done
% 8.32/2.56
% 8.32/2.56 # Proof found!
% 8.32/2.56 # SZS status Theorem
% 8.32/2.56 # SZS output start CNFRefutation
% See solution above
% 8.32/2.56 # Training examples: 0 positive, 0 negative
% 8.32/2.56
% 8.32/2.56 # -------------------------------------------------
% 8.32/2.56 # User time : 0.070 s
% 8.32/2.56 # System time : 0.008 s
% 8.32/2.56 # Total time : 0.078 s
% 8.32/2.56 # Maximum resident set size: 7124 pages
% 8.32/2.56
%------------------------------------------------------------------------------