%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC249+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 : n005.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:53 PM UTC 2026
% Result : Theorem 3.96s 3.15s
% Output : CNFRefutation 3.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 63 ( 8 unt; 0 def)
% Number of atoms : 309 ( 70 equ)
% Maximal formula atoms : 39 ( 4 avg)
% Number of connectives : 415 ( 169 ~; 168 |; 43 &)
% ( 4 <=>; 31 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-3 aty)
% Number of variables : 117 ( 0 sgn 56 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax5,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X2,X3) = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax5) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
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(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax38) ).
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ frontsegP(X4,X3)
| ~ strictorderedP(X3)
| nil = X1
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& frontsegP(X4,X5)
& segmentP(X5,X3)
& strictorderedP(X5) )
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& app(app(X7,cons(X6,nil)),X8) = X1
& ! [X9] :
( ssItem(X9)
=> ( ~ memberP(X7,X9)
| ~ memberP(X8,X9)
| ~ lt(X6,X9)
| leq(X6,X9) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax36,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(app(X2,X3),X1)
<=> ( memberP(X2,X1)
| memberP(X3,X1) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax36) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax46,axiom,
! [X1] :
( ssList(X1)
=> ( frontsegP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax46) ).
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(c_0_13,plain,
! [X440,X441] :
( ( nil = X441
| nil != app(X440,X441)
| ~ ssList(X441)
| ~ ssList(X440) )
& ( nil = X440
| nil != app(X440,X441)
| ~ ssList(X441)
| ~ ssList(X440) )
& ( nil != X441
| nil != X440
| nil = app(X440,X441)
| ~ ssList(X441)
| ~ ssList(X440) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])]) ).
fof(c_0_14,plain,
! [X235,X236,X238] :
( ( ssList(esk6_2(X235,X236))
| ~ frontsegP(X235,X236)
| ~ ssList(X236)
| ~ ssList(X235) )
& ( app(X236,esk6_2(X235,X236)) = X235
| ~ frontsegP(X235,X236)
| ~ ssList(X236)
| ~ ssList(X235) )
& ( ~ ssList(X238)
| app(X236,X238) != X235
| frontsegP(X235,X236)
| ~ ssList(X236)
| ~ ssList(X235) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax5])])])])]) ).
cnf(c_0_15,plain,
( nil = X1
| nil != app(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
( app(X1,esk6_2(X2,X1)) = X2
| ~ frontsegP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_18,plain,
! [X326,X327] :
( ~ ssList(X326)
| ~ ssItem(X327)
| ssList(cons(X327,X326)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
fof(c_0_19,plain,
! [X347,X348,X349] :
( ~ ssList(X347)
| ~ ssList(X348)
| ~ ssItem(X349)
| cons(X349,app(X348,X347)) = app(cons(X349,X348),X347) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])]) ).
fof(c_0_20,plain,
! [X345,X346] :
( ~ ssList(X345)
| ~ ssList(X346)
| ssList(app(X345,X346)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
cnf(c_0_21,plain,
( nil = app(X2,X1)
| nil != X1
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,plain,
( esk6_2(nil,X1) = nil
| ~ frontsegP(nil,X1)
| ~ ssList(esk6_2(nil,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16])]),c_0_17])]) ).
cnf(c_0_23,plain,
( ssList(esk6_2(X1,X2))
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_24,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[ax38]) ).
fof(c_0_25,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ frontsegP(X4,X3)
| ~ strictorderedP(X3)
| nil = X1
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& frontsegP(X4,X5)
& segmentP(X5,X3)
& strictorderedP(X5) )
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& app(app(X7,cons(X6,nil)),X8) = X1
& ! [X9] :
( ssItem(X9)
=> ( ~ memberP(X7,X9)
| ~ memberP(X8,X9)
| ~ lt(X6,X9)
| leq(X6,X9) ) ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
cnf(c_0_26,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,plain,
( cons(X3,app(X2,X1)) = app(cons(X3,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_21])]),c_0_17])]) ).
fof(c_0_30,plain,
! [X366,X367,X368] :
( ( ~ memberP(app(X367,X368),X366)
| memberP(X367,X366)
| memberP(X368,X366)
| ~ ssList(X368)
| ~ ssList(X367)
| ~ ssItem(X366) )
& ( ~ memberP(X367,X366)
| memberP(app(X367,X368),X366)
| ~ ssList(X368)
| ~ ssList(X367)
| ~ ssItem(X366) )
& ( ~ memberP(X368,X366)
| memberP(app(X367,X368),X366)
| ~ ssList(X368)
| ~ ssList(X367)
| ~ ssItem(X366) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax36])])])]) ).
cnf(c_0_31,plain,
( esk6_2(nil,X1) = nil
| ~ frontsegP(nil,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_17])]) ).
fof(c_0_32,plain,
! [X372] :
( ~ ssItem(X372)
| ~ memberP(nil,X372) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])]) ).
fof(c_0_33,negated_conjecture,
! [X470,X471,X472,X473] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& frontsegP(esk51_0,esk50_0)
& strictorderedP(esk50_0)
& nil != esk48_0
& ( ~ ssList(X470)
| ~ neq(esk50_0,X470)
| ~ frontsegP(esk51_0,X470)
| ~ segmentP(X470,esk50_0)
| ~ strictorderedP(X470) )
& ( ssItem(esk52_3(X471,X472,X473))
| ~ ssList(X473)
| app(app(X472,cons(X471,nil)),X473) != esk48_0
| ~ ssList(X472)
| ~ ssItem(X471) )
& ( memberP(X472,esk52_3(X471,X472,X473))
| ~ ssList(X473)
| app(app(X472,cons(X471,nil)),X473) != esk48_0
| ~ ssList(X472)
| ~ ssItem(X471) )
& ( memberP(X473,esk52_3(X471,X472,X473))
| ~ ssList(X473)
| app(app(X472,cons(X471,nil)),X473) != esk48_0
| ~ ssList(X472)
| ~ ssItem(X471) )
& ( lt(X471,esk52_3(X471,X472,X473))
| ~ ssList(X473)
| app(app(X472,cons(X471,nil)),X473) != esk48_0
| ~ ssList(X472)
| ~ ssItem(X471) )
& ( ~ leq(X471,esk52_3(X471,X472,X473))
| ~ ssList(X473)
| app(app(X472,cons(X471,nil)),X473) != esk48_0
| ~ ssList(X472)
| ~ ssItem(X471) ) ),
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_25])])])])]) ).
fof(c_0_34,plain,
! [X350] :
( ~ ssList(X350)
| app(nil,X350) = X350 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
cnf(c_0_35,plain,
( ssList(app(cons(X1,X2),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_36,plain,
( app(cons(X1,nil),nil) = cons(X1,nil)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_29]),c_0_17])]) ).
fof(c_0_37,plain,
! [X387] :
( ( ~ frontsegP(nil,X387)
| nil = X387
| ~ ssList(X387) )
& ( nil != X387
| frontsegP(nil,X387)
| ~ ssList(X387) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax46])])]) ).
cnf(c_0_38,plain,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_39,plain,
( app(X1,nil) = nil
| ~ frontsegP(nil,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_31]),c_0_17])]) ).
cnf(c_0_40,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_41,negated_conjecture,
( memberP(X1,esk52_3(X2,X1,X3))
| ~ ssList(X3)
| app(app(X1,cons(X2,nil)),X3) != esk48_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_42,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_43,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_17])]) ).
cnf(c_0_44,plain,
( frontsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_45,negated_conjecture,
( ssItem(esk52_3(X1,X2,X3))
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != esk48_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_46,plain,
( ~ frontsegP(nil,X1)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_17])]),c_0_40]) ).
cnf(c_0_47,negated_conjecture,
( memberP(nil,esk52_3(X1,nil,X2))
| app(cons(X1,nil),X2) != esk48_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_17])]),c_0_43]) ).
cnf(c_0_48,plain,
frontsegP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_44]),c_0_17])]) ).
cnf(c_0_49,negated_conjecture,
( ssItem(esk52_3(X1,nil,X2))
| app(cons(X1,nil),X2) != esk48_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_42]),c_0_17])]),c_0_43]) ).
fof(c_0_50,plain,
! [X435,X436] :
( ~ ssList(X435)
| ~ ssItem(X436)
| cons(X436,X435) = app(cons(X436,nil),X435) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
cnf(c_0_51,negated_conjecture,
( app(cons(X1,nil),X2) != esk48_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),c_0_17])]),c_0_49]) ).
cnf(c_0_52,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
fof(c_0_53,plain,
! [X334] :
( ( ssList(esk44_1(X334))
| nil = X334
| ~ ssList(X334) )
& ( ssItem(esk45_1(X334))
| nil = X334
| ~ ssList(X334) )
& ( cons(esk45_1(X334),esk44_1(X334)) = X334
| nil = X334
| ~ ssList(X334) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])]) ).
cnf(c_0_54,negated_conjecture,
( cons(X1,X2) != esk48_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,plain,
( cons(esk45_1(X1),esk44_1(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_56,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_57,negated_conjecture,
nil != esk48_0,
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_58,negated_conjecture,
( ~ ssList(esk44_1(esk48_0))
| ~ ssItem(esk45_1(esk48_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55])]),c_0_56])]),c_0_57]) ).
cnf(c_0_59,plain,
( ssList(esk44_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_60,negated_conjecture,
~ ssItem(esk45_1(esk48_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_56])]),c_0_57]) ).
cnf(c_0_61,plain,
( ssItem(esk45_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_56])]),c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC249+1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.12 % 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.15/0.32 % Computer : n005.cluster.edu
% 0.15/0.32 % Model : x86_64 x86_64
% 0.15/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32 % Memory : 8042.1875MB
% 0.15/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 04:38:00 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 3.96/3.15 % Version : CSE_E---1.7
% 3.96/3.15 % Problem : theBenchmark.p
% 3.96/3.15 % SZS status Theorem for theBenchmark.p
% 3.96/3.15 % SZS output start CNFRefutation
% See solution above
% 3.96/3.16 % Total time : 2.373s
%------------------------------------------------------------------------------