%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC114+1 : TPTP v9.2.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n006.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 5 05:18:20 PM UTC 2026
% Result : Theorem 27.33s 16.00s
% Output : CNFRefutation 27.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of formulae : 71 ( 19 unt; 0 def)
% Number of atoms : 278 ( 73 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 341 ( 134 ~; 135 |; 39 &)
% ( 3 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 96 ( 0 sgn 53 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( nil = X2
& nil = X1 )
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5)
| ? [X6] :
( ssItem(X6)
& X5 != X6
& memberP(X4,X6)
& leq(X5,X6) ) ) )
& ( nil != X4
| nil != X3 ) )
| ( neq(X1,nil)
& segmentP(X2,X1) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax18) ).
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
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/sandbox/benchmark/Axioms/SWC001+0.ax',ax3) ).
fof(ax53,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( segmentP(X1,X2)
& segmentP(X2,X3) )
=> segmentP(X1,X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax53) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
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(c_0_12,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( nil = X2
& nil = X1 )
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5)
| ? [X6] :
( ssItem(X6)
& X5 != X6
& memberP(X4,X6)
& leq(X5,X6) ) ) )
& ( nil != X4
| nil != X3 ) )
| ( neq(X1,nil)
& segmentP(X2,X1) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_13,negated_conjecture,
! [X465] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& ( nil != esk49_0
| nil != esk48_0 )
& ( nil = esk51_0
| ssItem(esk52_0) )
& ( nil = esk50_0
| ssItem(esk52_0) )
& ( nil = esk51_0
| cons(esk52_0,nil) = esk50_0 )
& ( nil = esk50_0
| cons(esk52_0,nil) = esk50_0 )
& ( nil = esk51_0
| memberP(esk51_0,esk52_0) )
& ( nil = esk50_0
| memberP(esk51_0,esk52_0) )
& ( nil = esk51_0
| ~ ssItem(X465)
| esk52_0 = X465
| ~ memberP(esk51_0,X465)
| ~ leq(esk52_0,X465) )
& ( nil = esk50_0
| ~ ssItem(X465)
| esk52_0 = X465
| ~ memberP(esk51_0,X465)
| ~ leq(esk52_0,X465) )
& ( ~ neq(esk48_0,nil)
| ~ segmentP(esk49_0,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)],[c_0_12])])])])]) ).
fof(c_0_14,plain,
! [X322,X323] :
( ~ ssList(X322)
| ~ ssItem(X323)
| cons(X323,X322) != X322 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax18])])]) ).
cnf(c_0_15,negated_conjecture,
( nil != esk49_0
| nil != 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,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X237,X238,X241,X242] :
( ( ssList(esk8_2(X237,X238))
| ~ segmentP(X237,X238)
| ~ ssList(X238)
| ~ ssList(X237) )
& ( ssList(esk9_2(X237,X238))
| ~ segmentP(X237,X238)
| ~ ssList(X238)
| ~ ssList(X237) )
& ( app(app(esk8_2(X237,X238),X238),esk9_2(X237,X238)) = X237
| ~ segmentP(X237,X238)
| ~ ssList(X238)
| ~ ssList(X237) )
& ( ~ ssList(X241)
| ~ ssList(X242)
| app(app(X241,X238),X242) != X237
| segmentP(X237,X238)
| ~ ssList(X238)
| ~ ssList(X237) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax7])])])])]) ).
cnf(c_0_19,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
( nil = esk51_0
| cons(esk52_0,nil) = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_22,negated_conjecture,
( nil = esk51_0
| ssItem(esk52_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,negated_conjecture,
( esk50_0 != nil
| esk51_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_24,plain,
( segmentP(X4,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,X3),X2) != X4
| ~ ssList(X3)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_25,plain,
! [X344] :
( ~ ssList(X344)
| app(nil,X344) = X344 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
fof(c_0_26,plain,
! [X339,X340] :
( ~ ssList(X339)
| ~ ssList(X340)
| ssList(app(X339,X340)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
fof(c_0_27,plain,
! [X429,X430] :
( ~ ssList(X429)
| ~ ssItem(X430)
| cons(X430,X429) = app(cons(X430,nil),X429) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
cnf(c_0_28,negated_conjecture,
( nil = esk50_0
| cons(esk52_0,nil) = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_29,negated_conjecture,
esk50_0 != nil,
inference(csr,[status(thm)],[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]),c_0_23]) ).
cnf(c_0_30,negated_conjecture,
( nil = esk50_0
| ssItem(esk52_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_31,plain,
! [X436] :
( ~ ssList(X436)
| app(X436,nil) = X436 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
fof(c_0_32,plain,
! [X220,X221,X224,X225] :
( ( ssList(esk3_2(X220,X221))
| ~ memberP(X220,X221)
| ~ ssItem(X221)
| ~ ssList(X220) )
& ( ssList(esk4_2(X220,X221))
| ~ memberP(X220,X221)
| ~ ssItem(X221)
| ~ ssList(X220) )
& ( app(esk3_2(X220,X221),cons(X221,esk4_2(X220,X221))) = X220
| ~ memberP(X220,X221)
| ~ ssItem(X221)
| ~ ssList(X220) )
& ( ~ ssList(X224)
| ~ ssList(X225)
| app(X224,cons(X221,X225)) != X220
| memberP(X220,X221)
| ~ ssItem(X221)
| ~ ssList(X220) ) ),
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_33,negated_conjecture,
( nil = esk50_0
| memberP(esk51_0,esk52_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_34,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_35,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_36,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_37,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_38,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_39,negated_conjecture,
cons(esk52_0,nil) = esk50_0,
inference(sr,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_40,negated_conjecture,
ssItem(esk52_0),
inference(sr,[status(thm)],[c_0_30,c_0_29]) ).
cnf(c_0_41,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_42,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_43,plain,
( app(esk3_2(X1,X2),cons(X2,esk4_2(X1,X2))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_44,negated_conjecture,
memberP(esk51_0,esk52_0),
inference(sr,[status(thm)],[c_0_33,c_0_29]) ).
cnf(c_0_45,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_34,c_0_17]) ).
cnf(c_0_46,plain,
( ssList(esk3_2(X1,X2))
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_47,plain,
! [X393,X394,X395] :
( ~ ssList(X393)
| ~ ssList(X394)
| ~ ssList(X395)
| ~ segmentP(X393,X394)
| ~ segmentP(X394,X395)
| segmentP(X393,X395) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax53])])]) ).
cnf(c_0_48,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_21])]),c_0_37]) ).
cnf(c_0_49,negated_conjecture,
( app(esk50_0,X1) = cons(esk52_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_50,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_41,c_0_16]) ).
cnf(c_0_51,plain,
( segmentP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_42]),c_0_21])]),c_0_37]) ).
cnf(c_0_52,negated_conjecture,
app(esk3_2(esk51_0,esk52_0),cons(esk52_0,esk4_2(esk51_0,esk52_0))) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_40])]) ).
cnf(c_0_53,negated_conjecture,
ssList(esk3_2(esk51_0,esk52_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_44]),c_0_45]),c_0_40])]) ).
fof(c_0_54,plain,
! [X320,X321] :
( ~ ssList(X320)
| ~ ssItem(X321)
| ssList(cons(X321,X320)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_55,plain,
( ssList(esk4_2(X1,X2))
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_56,plain,
( segmentP(X1,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_57,negated_conjecture,
( segmentP(cons(esk52_0,X1),esk50_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50])]) ).
cnf(c_0_58,negated_conjecture,
( ssList(cons(esk52_0,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_49]),c_0_50])]) ).
cnf(c_0_59,negated_conjecture,
( segmentP(esk51_0,cons(esk52_0,esk4_2(esk51_0,esk52_0)))
| ~ ssList(cons(esk52_0,esk4_2(esk51_0,esk52_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])]) ).
cnf(c_0_60,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_61,negated_conjecture,
ssList(esk4_2(esk51_0,esk52_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_44]),c_0_45]),c_0_40])]) ).
cnf(c_0_62,negated_conjecture,
( ~ neq(esk48_0,nil)
| ~ segmentP(esk49_0,esk48_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_63,negated_conjecture,
( segmentP(X1,esk50_0)
| ~ segmentP(X1,cons(esk52_0,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_50])]),c_0_58]) ).
cnf(c_0_64,negated_conjecture,
segmentP(esk51_0,cons(esk52_0,esk4_2(esk51_0,esk52_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]),c_0_40])]) ).
cnf(c_0_65,negated_conjecture,
( ~ segmentP(esk51_0,esk50_0)
| ~ neq(esk50_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_16]),c_0_17]),c_0_16]) ).
cnf(c_0_66,negated_conjecture,
segmentP(esk51_0,esk50_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_45]),c_0_61])]) ).
fof(c_0_67,plain,
! [X318,X319] :
( ( ~ neq(X318,X319)
| X318 != X319
| ~ ssList(X319)
| ~ ssList(X318) )
& ( X318 = X319
| neq(X318,X319)
| ~ ssList(X319)
| ~ ssList(X318) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
cnf(c_0_68,negated_conjecture,
~ neq(esk50_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66])]) ).
cnf(c_0_69,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_70,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_21]),c_0_50])]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SWC114+1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.09 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.10/0.29 % Computer : n006.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 300
% 0.10/0.29 % DateTime : Tue May 5 04:27:16 EDT 2026
% 0.10/0.29 % CPUTime :
% 0.10/0.30 % start to proof: theBenchmark
% 27.33/16.00 % Version : CSE_E---1.7
% 27.33/16.00 % Problem : theBenchmark.p
% 27.33/16.00 % SZS status Theorem for theBenchmark.p
% 27.33/16.00 % SZS output start CNFRefutation
% See solution above
% 27.46/16.09 % Total time : 12.390s
%------------------------------------------------------------------------------