TSTP Solution File: SWC025+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC025+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:08 EDT 2022
% Result : Theorem 8.41s 2.59s
% Output : CNFRefutation 8.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 43 ( 11 unt; 0 def)
% Number of atoms : 158 ( 57 equ)
% Maximal formula atoms : 21 ( 3 avg)
% Number of connectives : 184 ( 69 ~; 74 |; 22 &)
% ( 1 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn 23 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax37,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(cons(X2,X3),X1)
<=> ( X1 = X2
| memberP(X3,X1) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax37) ).
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ duplicatefreeP(X3)
| ? [X5] :
( ssItem(X5)
& ( ( ~ memberP(X4,X5)
& memberP(X3,X5) )
| ( ~ memberP(X3,X5)
& memberP(X4,X5) ) ) )
| ( ( nil != X2
| nil = X1 )
& ( nil != X1
| nil = X2 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
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(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax38) ).
fof(c_0_6,plain,
! [X154,X155,X156] :
( ( ~ memberP(cons(X155,X156),X154)
| X154 = X155
| memberP(X156,X154)
| ~ ssList(X156)
| ~ ssItem(X155)
| ~ ssItem(X154) )
& ( X154 != X155
| memberP(cons(X155,X156),X154)
| ~ ssList(X156)
| ~ ssItem(X155)
| ~ ssItem(X154) )
& ( ~ memberP(X156,X154)
| memberP(cons(X155,X156),X154)
| ~ ssList(X156)
| ~ ssItem(X155)
| ~ ssItem(X154) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax37])])])]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ duplicatefreeP(X3)
| ? [X5] :
( ssItem(X5)
& ( ( ~ memberP(X4,X5)
& memberP(X3,X5) )
| ( ~ memberP(X3,X5)
& memberP(X4,X5) ) ) )
| ( ( nil != X2
| nil = X1 )
& ( nil != X1
| nil = X2 ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
cnf(c_0_8,plain,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X213] :
( ~ ssList(X213)
| nil = X213
| cons(hd(X213),tl(X213)) = X213 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])]) ).
fof(c_0_10,plain,
! [X124] :
( ~ ssList(X124)
| nil = X124
| ssItem(hd(X124)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax22])]) ).
fof(c_0_11,plain,
! [X127] :
( ~ ssList(X127)
| nil = X127
| ssList(tl(X127)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax24])]) ).
fof(c_0_12,negated_conjecture,
! [X255] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& duplicatefreeP(esk50_0)
& ( memberP(esk51_0,X255)
| ~ memberP(esk50_0,X255)
| ~ ssItem(X255) )
& ( memberP(esk50_0,X255)
| ~ memberP(esk51_0,X255)
| ~ ssItem(X255) )
& ( nil = esk48_0
| nil = esk49_0 )
& ( nil != esk49_0
| nil = esk49_0 )
& ( nil = esk48_0
| nil != esk48_0 )
& ( nil != esk49_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_7])])])])])]) ).
cnf(c_0_13,plain,
( memberP(cons(X1,X2),X1)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
( memberP(esk51_0,X1)
| ~ memberP(esk50_0,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( nil = X1
| memberP(X1,hd(X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16]) ).
cnf(c_0_21,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( esk50_0 = nil
| memberP(esk51_0,hd(esk50_0))
| ~ ssItem(hd(esk50_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_23,negated_conjecture,
( nil = esk48_0
| nil = esk49_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_24,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_25,plain,
! [X157] :
( ~ ssItem(X157)
| ~ memberP(nil,X157) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax38])])]) ).
cnf(c_0_26,negated_conjecture,
( esk50_0 = nil
| memberP(esk51_0,hd(esk50_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_15]),c_0_21])]) ).
cnf(c_0_27,negated_conjecture,
( esk51_0 = nil
| esk50_0 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_18]),c_0_24]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_29,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,negated_conjecture,
( esk50_0 = nil
| memberP(nil,hd(esk50_0)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( memberP(esk50_0,X1)
| ~ memberP(esk51_0,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_32,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_28,c_0_24]) ).
cnf(c_0_33,negated_conjecture,
( nil != esk49_0
| nil != esk48_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_34,negated_conjecture,
( esk50_0 = nil
| ~ ssItem(hd(esk50_0)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
( esk51_0 = nil
| memberP(esk50_0,hd(esk51_0))
| ~ ssItem(hd(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_20]),c_0_32])]) ).
cnf(c_0_36,negated_conjecture,
( esk50_0 != nil
| esk51_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_18]),c_0_24]) ).
cnf(c_0_37,negated_conjecture,
esk50_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_15]),c_0_21])]) ).
cnf(c_0_38,negated_conjecture,
( esk51_0 = nil
| memberP(esk50_0,hd(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_15]),c_0_32])]) ).
cnf(c_0_39,negated_conjecture,
esk51_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]) ).
cnf(c_0_40,negated_conjecture,
memberP(nil,hd(esk51_0)),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_37]),c_0_39]) ).
cnf(c_0_41,negated_conjecture,
~ ssItem(hd(esk51_0)),
inference(spm,[status(thm)],[c_0_29,c_0_40]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_15]),c_0_32])]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC025+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n018.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 16:58:28 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.41/2.59 # ENIGMATIC: Solved by autoschedule:
% 8.41/2.59 # No SInE strategy applied
% 8.41/2.59 # Trying AutoSched0 for 150 seconds
% 8.41/2.59 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 8.41/2.59 # and selection function SelectNewComplexAHP.
% 8.41/2.59 #
% 8.41/2.59 # Preprocessing time : 0.019 s
% 8.41/2.59 # Presaturation interreduction done
% 8.41/2.59
% 8.41/2.59 # Proof found!
% 8.41/2.59 # SZS status Theorem
% 8.41/2.59 # SZS output start CNFRefutation
% See solution above
% 8.41/2.59 # Training examples: 0 positive, 0 negative
% 8.41/2.59
% 8.41/2.59 # -------------------------------------------------
% 8.41/2.59 # User time : 0.048 s
% 8.41/2.59 # System time : 0.005 s
% 8.41/2.59 # Total time : 0.053 s
% 8.41/2.59 # Maximum resident set size: 7124 pages
% 8.41/2.59
%------------------------------------------------------------------------------