%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC192+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:45:20 PM UTC 2026
% Result : Theorem 0.67s 0.51s
% Output : CNFRefutation 0.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 11
% Syntax : Number of formulae : 66 ( 16 unt; 0 def)
% Number of atoms : 284 ( 95 equ)
% Maximal formula atoms : 26 ( 4 avg)
% Number of connectives : 354 ( 136 ~; 135 |; 29 &)
% ( 2 <=>; 52 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 10 con; 0-2 aty)
% Number of variables : 101 ( 0 sgn 73 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( nil != X3
| nil != X4 )
& ! [X9] :
( ssItem(X9)
=> ( ~ memberP(X4,X9)
| cons(X9,nil) != X3 ) ) )
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ( X5 = X6
| app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8) != X1 ) ) ) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X1
& nil = X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax82,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax82) ).
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(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax18) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
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/sandbox/benchmark/Axioms/SWC001+0.ax',ax27) ).
fof(ax73,axiom,
! [X1] :
( ssItem(X1)
=> equalelemsP(cons(X1,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax73) ).
fof(ax14,axiom,
! [X1] :
( ssList(X1)
=> ( equalelemsP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X4,cons(X2,cons(X3,X5))) = X1
=> X2 = X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax14) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( nil != X3
| nil != X4 )
& ! [X9] :
( ssItem(X9)
=> ( ~ memberP(X4,X9)
| cons(X9,nil) != X3 ) ) )
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ( X5 = X6
| app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8) != X1 ) ) ) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( nil != X3
| nil != X4 )
& ! [X9] :
( ssItem(X9)
=> ( ~ memberP(X4,X9)
| cons(X9,nil) != X3 ) ) )
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ( X5 = X6
| app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8) != X1 ) ) ) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_13,negated_conjecture,
( ( memberP(esk51_0,esk56_0)
| nil = esk50_0 )
& ( memberP(esk51_0,esk56_0)
| nil = esk51_0 )
& ( cons(esk56_0,nil) = esk50_0
| nil = esk50_0 )
& ( cons(esk56_0,nil) = esk50_0
| nil = esk51_0 )
& ( ssItem(esk56_0)
| nil = esk50_0 )
& ( ssItem(esk56_0)
| nil = esk51_0 )
& esk52_0 != esk53_0
& app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk48_0
& ssList(esk55_0)
& ssList(esk54_0)
& ssItem(esk53_0)
& ssItem(esk52_0)
& esk48_0 = esk50_0
& esk49_0 = esk51_0
& ssList(esk51_0)
& ssList(esk50_0)
& ssList(esk49_0)
& ssList(esk48_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_12])])])])]) ).
fof(c_0_14,plain,
! [X228,X229] :
( ( ~ ssList(X228)
| ~ ssList(X229)
| nil = app(X228,X229)
| nil != X228
| nil != X229 )
& ( ~ ssList(X228)
| ~ ssList(X229)
| nil != app(X228,X229)
| nil = X228 )
& ( ~ ssList(X228)
| ~ ssList(X229)
| nil != app(X228,X229)
| nil = X229 ) ),
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_15,negated_conjecture,
app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk48_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk50_0,
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
ssList(esk55_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_20,plain,
! [X133,X134] :
( ssList(app(X133,X134))
| ~ ssList(X134)
| ~ ssList(X133) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_21,negated_conjecture,
( ~ ssList(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)))
| esk50_0 != nil
| app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_22,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_23,plain,
! [X225,X226,X227] :
( app(app(X225,X226),X227) = app(X225,app(X226,X227))
| ~ ssList(X227)
| ~ ssList(X226)
| ~ ssList(X225) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
cnf(c_0_24,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != app(X2,X1)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_25,negated_conjecture,
( ~ ssList(cons(esk53_0,nil))
| ~ ssList(app(esk54_0,cons(esk52_0,nil)))
| esk50_0 != nil
| app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)) = nil ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X1,X2),X3) = app(X1,app(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_28,plain,
! [X223,X224] :
( cons(X224,X223) = app(cons(X224,nil),X223)
| ~ ssItem(X224)
| ~ ssList(X223) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_29,negated_conjecture,
( ~ ssList(cons(esk53_0,nil))
| ~ ssList(app(esk54_0,cons(esk52_0,nil)))
| esk50_0 != nil
| cons(esk53_0,nil) = nil ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
fof(c_0_30,plain,
! [X114,X115] :
( ssList(cons(X115,X114))
| ~ ssItem(X115)
| ~ ssList(X114) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_31,negated_conjecture,
( ~ ssList(cons(esk52_0,nil))
| ~ ssList(cons(esk53_0,nil))
| app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_26]),c_0_27])]) ).
cnf(c_0_32,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,negated_conjecture,
ssItem(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
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,negated_conjecture,
( ~ ssList(cons(esk52_0,nil))
| ~ ssList(cons(esk53_0,nil))
| esk50_0 != nil
| cons(esk53_0,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_22]),c_0_27])]) ).
cnf(c_0_36,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_37,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_38,negated_conjecture,
ssItem(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_39,negated_conjecture,
( ~ ssList(cons(esk52_0,nil))
| ~ ssList(cons(esk53_0,nil))
| app(app(esk54_0,cons(esk52_0,cons(esk53_0,nil))),esk55_0) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
fof(c_0_40,plain,
! [X135,X136,X137] :
( cons(X137,app(X136,X135)) = app(cons(X137,X136),X135)
| ~ ssItem(X137)
| ~ ssList(X136)
| ~ ssList(X135) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])])]) ).
fof(c_0_41,plain,
! [X209] :
( equalelemsP(cons(X209,nil))
| ~ ssItem(X209) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax73])])]) ).
fof(c_0_42,plain,
! [X116,X117] :
( cons(X117,X116) != X116
| ~ ssItem(X117)
| ~ ssList(X116) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_34])])])]) ).
cnf(c_0_43,negated_conjecture,
( ~ ssList(cons(esk52_0,nil))
| esk50_0 != nil
| cons(esk53_0,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_38])]) ).
fof(c_0_44,plain,
! [X103,X104,X105,X106,X107] :
( ( ~ ssList(X103)
| equalelemsP(X103)
| esk40_1(X103) != esk41_1(X103) )
& ( ~ ssList(X103)
| equalelemsP(X103)
| app(esk42_1(X103),cons(esk40_1(X103),cons(esk41_1(X103),esk43_1(X103)))) = X103 )
& ( ~ ssList(X103)
| equalelemsP(X103)
| ssList(esk43_1(X103)) )
& ( ~ ssList(X103)
| equalelemsP(X103)
| ssList(esk42_1(X103)) )
& ( ~ ssList(X103)
| equalelemsP(X103)
| ssItem(esk41_1(X103)) )
& ( ~ ssList(X103)
| equalelemsP(X103)
| ssItem(esk40_1(X103)) )
& ( ~ ssList(X103)
| X104 = X105
| app(X106,cons(X104,cons(X105,X107))) != X103
| ~ ssList(X107)
| ~ ssList(X106)
| ~ ssItem(X105)
| ~ ssItem(X104)
| ~ equalelemsP(X103) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax14])])])])])]) ).
cnf(c_0_45,negated_conjecture,
( ~ ssList(cons(esk52_0,nil))
| ~ ssList(cons(esk53_0,nil))
| ~ ssList(cons(esk52_0,cons(esk53_0,nil)))
| app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0)) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_39]),c_0_19]),c_0_27])]) ).
cnf(c_0_46,plain,
( ~ ssItem(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_47,plain,
( ~ ssItem(X1)
| equalelemsP(cons(X1,nil)) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_48,negated_conjecture,
( cons(esk56_0,nil) = esk50_0
| nil = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_49,negated_conjecture,
( ssItem(esk56_0)
| nil = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_50,plain,
( cons(X2,X1) != X1
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_51,negated_conjecture,
( esk50_0 != nil
| cons(esk53_0,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_36]),c_0_37]),c_0_33])]) ).
cnf(c_0_52,plain,
( ~ ssList(X1)
| app(X4,cons(X2,cons(X3,X5))) != X1
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssItem(X3)
| ~ ssItem(X2)
| ~ equalelemsP(X1)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_53,negated_conjecture,
( ~ ssList(cons(esk52_0,nil))
| ~ ssList(cons(esk53_0,nil))
| ~ ssList(cons(esk52_0,cons(esk53_0,nil)))
| app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0))) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_19]),c_0_33])]) ).
cnf(c_0_54,negated_conjecture,
( equalelemsP(esk50_0)
| esk50_0 = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_55,negated_conjecture,
esk50_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_37]),c_0_38])]) ).
cnf(c_0_56,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_57,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(app(X3,cons(X1,cons(X2,X4))))
| ~ equalelemsP(app(X3,cons(X1,cons(X2,X4))))
| X1 = X2 ),
inference(er,[status(thm)],[c_0_52]) ).
cnf(c_0_58,negated_conjecture,
( ~ ssList(cons(esk52_0,nil))
| ~ ssList(cons(esk53_0,nil))
| ~ ssList(cons(esk52_0,cons(esk53_0,nil)))
| app(esk54_0,cons(esk52_0,cons(esk53_0,esk55_0))) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_32]),c_0_19]),c_0_38])]) ).
cnf(c_0_59,negated_conjecture,
equalelemsP(esk50_0),
inference(sr,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_60,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_56,c_0_16]) ).
cnf(c_0_61,negated_conjecture,
esk52_0 != esk53_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_62,negated_conjecture,
( ~ ssList(cons(esk52_0,nil))
| ~ ssList(cons(esk53_0,nil))
| ~ ssList(cons(esk52_0,cons(esk53_0,nil))) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),c_0_60]),c_0_19]),c_0_27]),c_0_38]),c_0_33])]),c_0_61]) ).
cnf(c_0_63,negated_conjecture,
( ~ ssList(cons(esk52_0,nil))
| ~ ssList(cons(esk53_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_36]),c_0_33])]) ).
cnf(c_0_64,negated_conjecture,
~ ssList(cons(esk52_0,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_36]),c_0_37]),c_0_38])]) ).
cnf(c_0_65,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_36]),c_0_37]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC192+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n004.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 08:03:21 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.43 Running first-order theorem proving
% 0.15/0.43 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.67/0.51 % Version: 3.5.1
% 0.67/0.51 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.67/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.67/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.67/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.67/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.67/0.51 % Starting sh5l with 300s (1) cores
% 0.67/0.51 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2664443 completed with status 0
% 0.67/0.51 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.67/0.51 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.67/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.67/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.67/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.67/0.51 % No SInE strategy applied
% 0.67/0.51 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.67/0.51 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.67/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.67/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.67/0.51 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.67/0.51 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.67/0.51 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.67/0.51 % G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with pid 2664453 completed with status 0
% 0.67/0.51 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y
% 0.67/0.51 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.67/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.67/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.67/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.67/0.51 % No SInE strategy applied
% 0.67/0.51 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.67/0.51 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.67/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.67/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.67/0.51 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.67/0.51 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.67/0.51 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.67/0.51 % Preprocessing time : 0.003 s
% 0.67/0.51 % Presaturation interreduction done
% 0.67/0.51
% 0.67/0.51 % Proof found!
% 0.67/0.51 % SZS status Theorem
% 0.67/0.51 % SZS output start CNFRefutation
% See solution above
% 0.67/0.51 % Parsed axioms : 96
% 0.67/0.51 % Removed by relevancy pruning/SinE : 0
% 0.67/0.51 % Initial clauses : 208
% 0.67/0.51 % Removed in clause preprocessing : 2
% 0.67/0.51 % Initial clauses in saturation : 206
% 0.67/0.51 % Processed clauses : 626
% 0.67/0.51 % ...of these trivial : 10
% 0.67/0.51 % ...subsumed : 72
% 0.67/0.51 % ...remaining for further processing : 544
% 0.67/0.51 % Other redundant clauses eliminated : 76
% 0.67/0.51 % Clauses deleted for lack of memory : 0
% 0.67/0.51 % Backward-subsumed : 42
% 0.67/0.51 % Backward-rewritten : 5
% 0.67/0.51 % Generated clauses : 1464
% 0.67/0.51 % ...of the previous two non-redundant : 1251
% 0.67/0.51 % ...aggressively subsumed : 0
% 0.67/0.51 % Contextual simplify-reflections : 33
% 0.67/0.51 % Paramodulations : 1375
% 0.67/0.51 % Factorizations : 0
% 0.67/0.51 % NegExts : 0
% 0.67/0.51 % Equation resolutions : 81
% 0.67/0.51 % Disequality decompositions : 0
% 0.67/0.51 % Total rewrite steps : 1024
% 0.67/0.51 % ...of those cached : 985
% 0.67/0.51 % Propositional unsat checks : 0
% 0.67/0.51 % Propositional check models : 0
% 0.67/0.51 % Propositional check unsatisfiable : 0
% 0.67/0.51 % Propositional clauses : 0
% 0.67/0.51 % Propositional clauses after purity: 0
% 0.67/0.51 % Propositional unsat core size : 0
% 0.67/0.51 % Propositional preprocessing time : 0.000
% 0.67/0.51 % Propositional encoding time : 0.000
% 0.67/0.51 % Propositional solver time : 0.000
% 0.67/0.51 % Success case prop preproc time : 0.000
% 0.67/0.51 % Success case prop encoding time : 0.000
% 0.67/0.51 % Success case prop solver time : 0.000
% 0.67/0.51 % Current number of processed clauses : 264
% 0.67/0.51 % Positive orientable unit clauses : 44
% 0.67/0.51 % Positive unorientable unit clauses: 0
% 0.67/0.51 % Negative unit clauses : 7
% 0.67/0.51 % Non-unit-clauses : 213
% 0.67/0.51 % Current number of unprocessed clauses: 1018
% 0.67/0.51 % ...number of literals in the above : 6761
% 0.67/0.51 % Current number of archived formulas : 0
% 0.67/0.51 % Current number of archived clauses : 257
% 0.67/0.51 % Clause-clause subsumption calls (NU) : 22733
% 0.67/0.51 % Rec. Clause-clause subsumption calls : 6632
% 0.67/0.51 % Non-unit clause-clause subsumptions : 96
% 0.67/0.51 % Unit Clause-clause subsumption calls : 174
% 0.67/0.51 % Rewrite failures with RHS unbound : 0
% 0.67/0.51 % BW rewrite match attempts : 15
% 0.67/0.51 % BW rewrite match successes : 15
% 0.67/0.51 % Condensation attempts : 0
% 0.67/0.51 % Condensation successes : 0
% 0.67/0.51 % Termbank termtop insertions : 49310
% 0.67/0.51 % Search garbage collected termcells : 4352
% 0.67/0.51
% 0.67/0.51 % -------------------------------------------------
% 0.67/0.51 % User time : 0.044 s
% 0.67/0.51 % System time : 0.007 s
% 0.67/0.51 % Total time : 0.051 s
% 0.67/0.51 % Maximum resident set size: 4276 pages
% 0.67/0.51
% 0.67/0.51 % -------------------------------------------------
% 0.67/0.51 % User time : 0.269 s
% 0.67/0.51 % System time : 0.029 s
% 0.67/0.51 % Total time : 0.299 s
% 0.67/0.51 % Maximum resident set size: 4864 pages
% 0.67/0.51 % E exiting
%------------------------------------------------------------------------------