TSTP Solution File: SWC407+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC407+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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 : 300s
% DateTime : Tue May 21 04:29:33 EDT 2024
% Result : Theorem 0.19s 0.57s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 80 ( 16 unt; 0 def)
% Number of atoms : 297 ( 117 equ)
% Maximal formula atoms : 21 ( 3 avg)
% Number of connectives : 343 ( 126 ~; 149 |; 27 &)
% ( 2 <=>; 39 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 3 ( 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 : 103 ( 0 sgn 61 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X1,X5)
| memberP(X2,X5) ) )
| ( ! [X6] :
( ssItem(X6)
=> ( cons(X6,nil) != X3
| ~ memberP(X4,X6) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax19,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssItem(X4)
=> ( cons(X3,X1) = cons(X4,X2)
=> ( X3 = X4
& X2 = X1 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax19) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax20) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax37) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax18) ).
fof(ax27,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax27) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax38) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
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(c_0_13,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X1,X5)
| memberP(X2,X5) ) )
| ( ! [X6] :
( ssItem(X6)
=> ( cons(X6,nil) != X3
| ~ memberP(X4,X6) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_14,negated_conjecture,
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ssItem(esk5_0)
& memberP(esk1_0,esk5_0)
& ~ memberP(esk2_0,esk5_0)
& ( nil = esk4_0
| ssItem(esk6_0) )
& ( nil = esk3_0
| ssItem(esk6_0) )
& ( nil = esk4_0
| cons(esk6_0,nil) = esk3_0 )
& ( nil = esk3_0
| cons(esk6_0,nil) = esk3_0 )
& ( nil = esk4_0
| memberP(esk4_0,esk6_0) )
& ( nil = esk3_0
| memberP(esk4_0,esk6_0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])])]) ).
fof(c_0_15,plain,
! [X35,X36,X37,X38] :
( ( X37 = X38
| cons(X37,X35) != cons(X38,X36)
| ~ ssItem(X38)
| ~ ssItem(X37)
| ~ ssList(X36)
| ~ ssList(X35) )
& ( X36 = X35
| cons(X37,X35) != cons(X38,X36)
| ~ ssItem(X38)
| ~ ssItem(X37)
| ~ ssList(X36)
| ~ ssList(X35) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax19])])])])]) ).
fof(c_0_16,plain,
! [X13] :
( ( ssList(esk7_1(X13))
| nil = X13
| ~ ssList(X13) )
& ( ssItem(esk8_1(X13))
| nil = X13
| ~ ssList(X13) )
& ( cons(esk8_1(X13),esk7_1(X13)) = X13
| nil = X13
| ~ ssList(X13) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])])]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( X1 = X2
| cons(X3,X2) != cons(X4,X1)
| ~ ssItem(X4)
| ~ ssItem(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( nil = esk3_0
| cons(esk6_0,nil) = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_22,negated_conjecture,
( nil = esk3_0
| ssItem(esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
( cons(esk8_1(X1),esk7_1(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,plain,
( ssItem(esk8_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,plain,
( ssList(esk7_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_27,plain,
! [X27,X28,X29] :
( ( ~ memberP(cons(X28,X29),X27)
| X27 = X28
| memberP(X29,X27)
| ~ ssList(X29)
| ~ ssItem(X28)
| ~ ssItem(X27) )
& ( X27 != X28
| memberP(cons(X28,X29),X27)
| ~ ssList(X29)
| ~ ssItem(X28)
| ~ ssItem(X27) )
& ( ~ memberP(X29,X27)
| memberP(cons(X28,X29),X27)
| ~ ssList(X29)
| ~ ssItem(X28)
| ~ ssItem(X27) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax37])])])])]) ).
cnf(c_0_28,negated_conjecture,
( esk3_0 = nil
| nil = X1
| cons(X2,X1) != esk3_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(csr,[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_29,negated_conjecture,
( cons(esk8_1(esk3_0),esk7_1(esk3_0)) = esk3_0
| esk3_0 = nil ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
( esk3_0 = nil
| ssItem(esk8_1(esk3_0)) ),
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_31,negated_conjecture,
( esk3_0 = nil
| ssList(esk7_1(esk3_0)) ),
inference(spm,[status(thm)],[c_0_26,c_0_24]) ).
cnf(c_0_32,plain,
( X3 = X1
| memberP(X2,X3)
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_33,negated_conjecture,
memberP(esk1_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_34,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
inference(fof_simplification,[status(thm)],[ax18]) ).
cnf(c_0_35,plain,
( X1 = X2
| cons(X1,X3) != cons(X2,X4)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_36,negated_conjecture,
( esk7_1(esk3_0) = nil
| esk3_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_37,negated_conjecture,
( esk8_1(esk3_0) = X1
| esk3_0 = nil
| memberP(esk7_1(esk3_0),X1)
| ~ memberP(esk3_0,X1)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_29]),c_0_30]),c_0_31]) ).
cnf(c_0_38,negated_conjecture,
memberP(esk3_0,esk5_0),
inference(rw,[status(thm)],[c_0_33,c_0_18]) ).
cnf(c_0_39,negated_conjecture,
ssItem(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_40,plain,
! [X33,X34] :
( ~ ssList(X33)
| ~ ssItem(X34)
| cons(X34,X33) != X33 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_34])])])]) ).
fof(c_0_41,plain,
! [X39,X40,X41] :
( ~ ssList(X39)
| ~ ssList(X40)
| ~ ssItem(X41)
| cons(X41,app(X40,X39)) = app(cons(X41,X40),X39) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])])]) ).
fof(c_0_42,plain,
! [X46,X47] :
( ~ ssList(X46)
| ~ ssList(X47)
| ssList(app(X46,X47)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
fof(c_0_43,plain,
! [X42,X43] :
( ~ ssList(X42)
| ~ ssItem(X43)
| cons(X43,X42) = app(cons(X43,nil),X42) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
fof(c_0_44,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[ax38]) ).
cnf(c_0_45,negated_conjecture,
( esk3_0 = nil
| X1 = esk6_0
| cons(X1,X2) != esk3_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_46,negated_conjecture,
( cons(esk8_1(esk3_0),nil) = esk3_0
| esk3_0 = nil ),
inference(spm,[status(thm)],[c_0_29,c_0_36]) ).
cnf(c_0_47,negated_conjecture,
( esk8_1(esk3_0) = esk5_0
| esk3_0 = nil
| memberP(esk7_1(esk3_0),esk5_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_48,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_49,plain,
( cons(X3,app(X2,X1)) = app(cons(X3,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_50,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
fof(c_0_51,plain,
! [X60] :
( ~ ssList(X60)
| app(X60,nil) = X60 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
fof(c_0_52,plain,
! [X31,X32] :
( ~ ssList(X31)
| ~ ssItem(X32)
| ssList(cons(X32,X31)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_53,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_54,negated_conjecture,
( nil = esk4_0
| cons(esk6_0,nil) = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_55,negated_conjecture,
( nil = esk4_0
| ssItem(esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_56,plain,
! [X30] :
( ~ ssItem(X30)
| ~ memberP(nil,X30) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_44])])]) ).
cnf(c_0_57,negated_conjecture,
( esk8_1(esk3_0) = esk6_0
| esk3_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_21])]),c_0_30]) ).
cnf(c_0_58,negated_conjecture,
( esk8_1(esk3_0) = esk5_0
| esk3_0 = nil
| memberP(nil,esk5_0) ),
inference(spm,[status(thm)],[c_0_47,c_0_36]) ).
cnf(c_0_59,plain,
( app(cons(X1,X2),X3) != app(X2,X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]) ).
cnf(c_0_60,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_61,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_62,negated_conjecture,
( cons(esk6_0,X1) = app(esk3_0,X1)
| esk4_0 = nil
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]) ).
cnf(c_0_63,negated_conjecture,
~ memberP(esk2_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_64,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_65,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_66,negated_conjecture,
( esk3_0 = nil
| esk5_0 = esk6_0
| memberP(nil,esk5_0) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
fof(c_0_67,plain,
! [X58,X59] :
( ( nil = X59
| nil != app(X58,X59)
| ~ ssList(X59)
| ~ ssList(X58) )
& ( nil = X58
| nil != app(X58,X59)
| ~ ssList(X59)
| ~ ssList(X58) )
& ( nil != X59
| nil != X58
| nil = app(X58,X59)
| ~ ssList(X59)
| ~ ssList(X58) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])])]) ).
cnf(c_0_68,plain,
( cons(X1,X2) != app(X2,nil)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_21])]),c_0_61]) ).
cnf(c_0_69,negated_conjecture,
( cons(esk6_0,esk3_0) = app(esk3_0,esk3_0)
| esk4_0 = nil ),
inference(spm,[status(thm)],[c_0_62,c_0_24]) ).
cnf(c_0_70,negated_conjecture,
~ memberP(esk4_0,esk5_0),
inference(rw,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_71,negated_conjecture,
( esk5_0 = esk6_0
| esk3_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_39])]) ).
cnf(c_0_72,negated_conjecture,
( nil = esk3_0
| memberP(esk4_0,esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_73,plain,
( nil = app(X2,X1)
| nil != X1
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_74,negated_conjecture,
( esk4_0 = nil
| app(esk3_0,esk3_0) != app(esk3_0,nil) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_24])]),c_0_55]) ).
cnf(c_0_75,negated_conjecture,
esk3_0 = nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_72]) ).
cnf(c_0_76,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_73])]),c_0_21])]) ).
cnf(c_0_77,negated_conjecture,
esk4_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75]),c_0_75]),c_0_76]),c_0_75]),c_0_76])]) ).
cnf(c_0_78,negated_conjecture,
~ memberP(nil,esk5_0),
inference(rw,[status(thm)],[c_0_70,c_0_77]) ).
cnf(c_0_79,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_75]),c_0_78]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC407+1 : TPTP v8.2.0. Released v2.4.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n014.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun May 19 02:55:23 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.49 Running first-order model finding
% 0.19/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.57 # Version: 3.1.0
% 0.19/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.57 # Starting sh5l with 300s (1) cores
% 0.19/0.57 # new_bool_3 with pid 9869 completed with status 0
% 0.19/0.57 # Result found by new_bool_3
% 0.19/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.57 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.19/0.57 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.19/0.57 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 9872 completed with status 0
% 0.19/0.57 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.57 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.19/0.57 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.19/0.57 # Preprocessing time : 0.003 s
% 0.19/0.57 # Presaturation interreduction done
% 0.19/0.57
% 0.19/0.57 # Proof found!
% 0.19/0.57 # SZS status Theorem
% 0.19/0.57 # SZS output start CNFRefutation
% See solution above
% 0.19/0.57 # Parsed axioms : 96
% 0.19/0.57 # Removed by relevancy pruning/SinE : 75
% 0.19/0.57 # Initial clauses : 49
% 0.19/0.57 # Removed in clause preprocessing : 0
% 0.19/0.57 # Initial clauses in saturation : 49
% 0.19/0.57 # Processed clauses : 623
% 0.19/0.57 # ...of these trivial : 10
% 0.19/0.57 # ...subsumed : 300
% 0.19/0.57 # ...remaining for further processing : 312
% 0.19/0.57 # Other redundant clauses eliminated : 10
% 0.19/0.57 # Clauses deleted for lack of memory : 0
% 0.19/0.57 # Backward-subsumed : 6
% 0.19/0.57 # Backward-rewritten : 193
% 0.19/0.57 # Generated clauses : 1553
% 0.19/0.57 # ...of the previous two non-redundant : 1419
% 0.19/0.57 # ...aggressively subsumed : 0
% 0.19/0.57 # Contextual simplify-reflections : 157
% 0.19/0.57 # Paramodulations : 1540
% 0.19/0.57 # Factorizations : 0
% 0.19/0.57 # NegExts : 0
% 0.19/0.57 # Equation resolutions : 14
% 0.19/0.57 # Disequality decompositions : 0
% 0.19/0.57 # Total rewrite steps : 1256
% 0.19/0.57 # ...of those cached : 1244
% 0.19/0.57 # Propositional unsat checks : 0
% 0.19/0.57 # Propositional check models : 0
% 0.19/0.57 # Propositional check unsatisfiable : 0
% 0.19/0.57 # Propositional clauses : 0
% 0.19/0.57 # Propositional clauses after purity: 0
% 0.19/0.57 # Propositional unsat core size : 0
% 0.19/0.57 # Propositional preprocessing time : 0.000
% 0.19/0.57 # Propositional encoding time : 0.000
% 0.19/0.57 # Propositional solver time : 0.000
% 0.19/0.57 # Success case prop preproc time : 0.000
% 0.19/0.57 # Success case prop encoding time : 0.000
% 0.19/0.57 # Success case prop solver time : 0.000
% 0.19/0.57 # Current number of processed clauses : 63
% 0.19/0.57 # Positive orientable unit clauses : 9
% 0.19/0.57 # Positive unorientable unit clauses: 0
% 0.19/0.57 # Negative unit clauses : 2
% 0.19/0.57 # Non-unit-clauses : 52
% 0.19/0.57 # Current number of unprocessed clauses: 892
% 0.19/0.57 # ...number of literals in the above : 4190
% 0.19/0.57 # Current number of archived formulas : 0
% 0.19/0.57 # Current number of archived clauses : 246
% 0.19/0.57 # Clause-clause subsumption calls (NU) : 5050
% 0.19/0.57 # Rec. Clause-clause subsumption calls : 3141
% 0.19/0.57 # Non-unit clause-clause subsumptions : 463
% 0.19/0.57 # Unit Clause-clause subsumption calls : 53
% 0.19/0.57 # Rewrite failures with RHS unbound : 0
% 0.19/0.57 # BW rewrite match attempts : 2
% 0.19/0.57 # BW rewrite match successes : 2
% 0.19/0.57 # Condensation attempts : 0
% 0.19/0.57 # Condensation successes : 0
% 0.19/0.57 # Termbank termtop insertions : 30267
% 0.19/0.57 # Search garbage collected termcells : 1487
% 0.19/0.57
% 0.19/0.57 # -------------------------------------------------
% 0.19/0.57 # User time : 0.054 s
% 0.19/0.57 # System time : 0.005 s
% 0.19/0.57 # Total time : 0.059 s
% 0.19/0.57 # Maximum resident set size: 1908 pages
% 0.19/0.57
% 0.19/0.57 # -------------------------------------------------
% 0.19/0.57 # User time : 0.059 s
% 0.19/0.57 # System time : 0.009 s
% 0.19/0.57 # Total time : 0.068 s
% 0.19/0.57 # Maximum resident set size: 1824 pages
% 0.19/0.57 % E---3.1 exiting
%------------------------------------------------------------------------------