%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWV486+1 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n002.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:23:31 PM UTC 2026
% Result : Theorem 1.76s 1.88s
% Output : CNFRefutation 1.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of formulae : 83 ( 23 unt; 0 def)
% Number of atoms : 243 ( 57 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 249 ( 89 ~; 99 |; 37 &)
% ( 4 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 146 ( 0 sgn 73 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(int_leq,axiom,
! [X1,X2] :
( int_leq(X1,X2)
<=> ( int_less(X1,X2)
| X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_leq) ).
fof(one_successor_of_zero,axiom,
! [X1] :
( int_less(int_zero,X1)
<=> int_leq(int_one,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',one_successor_of_zero) ).
fof(int_less_total,axiom,
! [X1,X2] :
( int_less(X1,X2)
| int_leq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_less_total) ).
fof(plus_and_inverse,axiom,
! [X1,X2] :
( int_less(X1,X2)
<=> ? [X3] :
( plus(X1,X3) = X2
& int_less(int_zero,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus_and_inverse) ).
fof(lt,conjecture,
! [X1,X2] :
( ( int_leq(int_one,X1)
& int_less(X1,X2)
& int_leq(X2,n) )
=> a(X1,X2) = real_zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lt) ).
fof(plus_and_order1,axiom,
! [X4,X5,X6,X7] :
( ( int_less(X4,X5)
& int_leq(X6,X7) )
=> int_leq(plus(X4,X6),plus(X5,X7)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus_and_order1) ).
fof(plus_commutative,axiom,
! [X1,X2] : plus(X1,X2) = plus(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus_commutative) ).
fof(int_less_transitive,axiom,
! [X1,X2,X3] :
( ( int_less(X1,X2)
& int_less(X2,X3) )
=> int_less(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_less_transitive) ).
fof(int_less_irreflexive,axiom,
! [X1,X2] :
( int_less(X1,X2)
=> X1 != X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_less_irreflexive) ).
fof(plus_zero,axiom,
! [X1] : plus(X1,int_zero) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus_zero) ).
fof(qih,hypothesis,
! [X1,X2] :
( ( int_leq(int_one,X1)
& int_leq(X1,n)
& int_leq(int_one,X2)
& int_leq(X2,n) )
=> ( ! [X8] :
( ( int_less(int_zero,X8)
& X1 = plus(X2,X8) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X2) )
=> a(plus(X3,X8),X3) = qr(plus(X3,X8),X3) ) )
& ! [X8] :
( ( int_less(int_zero,X8)
& X2 = plus(X1,X8) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X1) )
=> a(X3,plus(X3,X8)) = real_zero ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qih) ).
fof(int_zero_one,axiom,
int_less(int_zero,int_one),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_zero_one) ).
fof(c_0_12,plain,
! [X37,X38] :
( ( ~ int_leq(X37,X38)
| int_less(X37,X38)
| X37 = X38 )
& ( ~ int_less(X37,X38)
| int_leq(X37,X38) )
& ( X37 != X38
| int_leq(X37,X38) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[int_leq])])]) ).
fof(c_0_13,plain,
! [X59] :
( ( ~ int_less(int_zero,X59)
| int_leq(int_one,X59) )
& ( ~ int_leq(int_one,X59)
| int_less(int_zero,X59) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[one_successor_of_zero])]) ).
fof(c_0_14,plain,
! [X2,X1] :
( epred1_2(X1,X2)
<=> ( ! [X8] :
( ( int_less(int_zero,X8)
& X1 = plus(X2,X8) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X2) )
=> a(plus(X3,X8),X3) = qr(plus(X3,X8),X3) ) )
& ! [X8] :
( ( int_less(int_zero,X8)
& X2 = plus(X1,X8) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X1) )
=> a(X3,plus(X3,X8)) = real_zero ) ) ) ),
introduced(definition) ).
fof(c_0_15,plain,
! [X44,X45] :
( int_less(X44,X45)
| int_leq(X45,X44) ),
inference(variable_rename,[status(thm)],[int_less_total]) ).
cnf(c_0_16,plain,
( int_less(X1,X2)
| X1 = X2
| ~ int_leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( int_leq(int_one,X1)
| ~ int_less(int_zero,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X53,X54,X56,X57,X58] :
( ( plus(X53,esk1_2(X53,X54)) = X54
| ~ int_less(X53,X54) )
& ( int_less(int_zero,esk1_2(X53,X54))
| ~ int_less(X53,X54) )
& ( plus(X56,X58) != X57
| ~ int_less(int_zero,X58)
| int_less(X56,X57) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[plus_and_inverse])])])])])]) ).
fof(c_0_19,negated_conjecture,
~ ! [X1,X2] :
( ( int_leq(int_one,X1)
& int_less(X1,X2)
& int_leq(X2,n) )
=> a(X1,X2) = real_zero ),
inference(assume_negation,[status(cth)],[lt]) ).
fof(c_0_20,plain,
! [X2,X1] :
( epred1_2(X1,X2)
=> ( ! [X8] :
( ( int_less(int_zero,X8)
& X1 = plus(X2,X8) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X2) )
=> a(plus(X3,X8),X3) = qr(plus(X3,X8),X3) ) )
& ! [X8] :
( ( int_less(int_zero,X8)
& X2 = plus(X1,X8) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X1) )
=> a(X3,plus(X3,X8)) = real_zero ) ) ) ),
inference(split_equiv,[status(thm)],[c_0_14]) ).
fof(c_0_21,plain,
! [X49,X50,X51,X52] :
( ~ int_less(X49,X50)
| ~ int_leq(X51,X52)
| int_leq(plus(X49,X51),plus(X50,X52)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[plus_and_order1])]) ).
fof(c_0_22,plain,
! [X46,X47] : plus(X46,X47) = plus(X47,X46),
inference(variable_rename,[status(thm)],[plus_commutative]) ).
fof(c_0_23,plain,
! [X39,X40,X41] :
( ~ int_less(X39,X40)
| ~ int_less(X40,X41)
| int_less(X39,X41) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[int_less_transitive])]) ).
cnf(c_0_24,plain,
( int_less(int_zero,X1)
| ~ int_leq(int_one,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_25,plain,
( int_less(X1,X2)
| int_leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_26,plain,
( int_one = X1
| int_less(int_one,X1)
| ~ int_less(int_zero,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_27,plain,
( int_less(int_zero,esk1_2(X1,X2))
| ~ int_less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_28,negated_conjecture,
( int_leq(int_one,esk2_0)
& int_less(esk2_0,esk3_0)
& int_leq(esk3_0,n)
& a(esk2_0,esk3_0) != real_zero ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])]) ).
fof(c_0_29,plain,
! [X42,X43] :
( ~ int_less(X42,X43)
| X42 != X43 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[int_less_irreflexive])]) ).
fof(c_0_30,plain,
! [X64,X65,X66,X67,X68,X69] :
( ( ~ int_less(int_zero,X66)
| X65 != plus(X64,X66)
| ~ int_leq(int_one,X67)
| ~ int_leq(X67,X64)
| a(plus(X67,X66),X67) = qr(plus(X67,X66),X67)
| ~ epred1_2(X65,X64) )
& ( ~ int_less(int_zero,X68)
| X64 != plus(X65,X68)
| ~ int_leq(int_one,X69)
| ~ int_leq(X69,X65)
| a(X69,plus(X69,X68)) = real_zero
| ~ epred1_2(X65,X64) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])]) ).
cnf(c_0_31,plain,
( int_leq(plus(X1,X3),plus(X2,X4))
| ~ int_less(X1,X2)
| ~ int_leq(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_32,plain,
plus(X1,X2) = plus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_33,plain,
( int_less(X1,X3)
| ~ int_less(X1,X2)
| ~ int_less(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_34,plain,
( int_less(X1,int_one)
| int_less(int_zero,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_35,plain,
( esk1_2(X1,X2) = int_one
| int_less(int_one,esk1_2(X1,X2))
| ~ int_less(X1,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_36,negated_conjecture,
int_less(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_37,plain,
( ~ int_less(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_38,plain,
! [X48] : plus(X48,int_zero) = X48,
inference(variable_rename,[status(thm)],[plus_zero]) ).
cnf(c_0_39,plain,
( a(X4,plus(X4,X1)) = real_zero
| ~ int_less(int_zero,X1)
| X2 != plus(X3,X1)
| ~ int_leq(int_one,X4)
| ~ int_leq(X4,X3)
| ~ epred1_2(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_40,plain,
( int_less(X1,X3)
| plus(X1,X2) != X3
| ~ int_less(int_zero,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_41,plain,
( int_leq(plus(X1,X2),plus(X3,X4))
| ~ int_less(X1,X4)
| ~ int_leq(X2,X3) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_42,plain,
( plus(X1,esk1_2(X1,X2)) = X2
| ~ int_less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_43,plain,
( int_less(int_zero,X1)
| int_less(X2,int_one)
| ~ int_less(X2,X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_44,negated_conjecture,
( esk1_2(esk2_0,esk3_0) = int_one
| int_less(int_one,esk1_2(esk2_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_45,plain,
~ int_less(X1,X1),
inference(er,[status(thm)],[c_0_37]) ).
cnf(c_0_46,plain,
plus(X1,int_zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_47,plain,
( a(X1,plus(X1,X2)) = real_zero
| ~ epred1_2(X3,plus(X3,X2))
| ~ int_less(int_zero,X2)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X3) ),
inference(er,[status(thm)],[c_0_39]) ).
cnf(c_0_48,plain,
( int_leq(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_49,plain,
( int_less(X1,plus(X1,X2))
| ~ int_less(int_zero,X2) ),
inference(er,[status(thm)],[c_0_40]) ).
cnf(c_0_50,plain,
( int_leq(plus(X1,X2),X3)
| ~ int_less(X1,esk1_2(X4,X3))
| ~ int_less(X4,X3)
| ~ int_leq(X2,X4) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_51,negated_conjecture,
( esk1_2(esk2_0,esk3_0) = int_one
| int_less(int_zero,esk1_2(esk2_0,esk3_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).
cnf(c_0_52,plain,
plus(int_zero,X1) = X1,
inference(spm,[status(thm)],[c_0_46,c_0_32]) ).
cnf(c_0_53,negated_conjecture,
int_leq(int_one,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_54,plain,
( a(X1,plus(X1,esk1_2(X2,X3))) = real_zero
| ~ epred1_2(X2,X3)
| ~ int_less(X2,X3)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_42]),c_0_27]) ).
cnf(c_0_55,plain,
int_leq(X1,X1),
inference(er,[status(thm)],[c_0_48]) ).
fof(c_0_56,hypothesis,
! [X1,X2] :
( ( int_leq(int_one,X1)
& int_leq(X1,n)
& int_leq(int_one,X2)
& int_leq(X2,n) )
=> epred1_2(X1,X2) ),
inference(apply_def,[status(thm)],[qih,c_0_14]) ).
cnf(c_0_57,plain,
( int_less(X1,plus(X2,X1))
| ~ int_less(int_zero,X2) ),
inference(spm,[status(thm)],[c_0_49,c_0_32]) ).
cnf(c_0_58,negated_conjecture,
( esk1_2(esk2_0,esk3_0) = int_one
| int_leq(X1,esk3_0)
| ~ int_leq(X1,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]),c_0_36])]) ).
cnf(c_0_59,negated_conjecture,
int_less(int_zero,esk2_0),
inference(spm,[status(thm)],[c_0_24,c_0_53]) ).
cnf(c_0_60,negated_conjecture,
int_leq(esk3_0,n),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_61,negated_conjecture,
a(esk2_0,esk3_0) != real_zero,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_62,plain,
( a(X1,X2) = real_zero
| ~ epred1_2(X1,X2)
| ~ int_less(X1,X2)
| ~ int_leq(int_one,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_42]),c_0_55])]) ).
fof(c_0_63,hypothesis,
! [X60,X61] :
( ~ int_leq(int_one,X60)
| ~ int_leq(X60,n)
| ~ int_leq(int_one,X61)
| ~ int_leq(X61,n)
| epred1_2(X60,X61) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_56])]) ).
cnf(c_0_64,plain,
( int_less(esk1_2(X1,X2),X2)
| ~ int_less(int_zero,X1)
| ~ int_less(X1,X2) ),
inference(spm,[status(thm)],[c_0_57,c_0_42]) ).
cnf(c_0_65,negated_conjecture,
( esk1_2(esk2_0,esk3_0) = int_one
| int_leq(int_one,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_17]),c_0_59])]) ).
cnf(c_0_66,plain,
( int_leq(X1,X2)
| ~ int_less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_67,negated_conjecture,
( esk1_2(esk2_0,esk3_0) = int_one
| int_leq(esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_58,c_0_55]) ).
cnf(c_0_68,negated_conjecture,
( esk3_0 = n
| int_less(esk3_0,n) ),
inference(spm,[status(thm)],[c_0_16,c_0_60]) ).
cnf(c_0_69,negated_conjecture,
~ epred1_2(esk2_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_36]),c_0_53])]) ).
cnf(c_0_70,hypothesis,
( epred1_2(X1,X2)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X2)
| ~ int_leq(X2,n) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_71,negated_conjecture,
int_leq(int_one,esk3_0),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_59]),c_0_36])]),c_0_66]) ).
cnf(c_0_72,plain,
( int_leq(X1,plus(X2,X3))
| ~ int_less(int_zero,X2)
| ~ int_leq(X1,X3) ),
inference(spm,[status(thm)],[c_0_31,c_0_52]) ).
cnf(c_0_73,negated_conjecture,
( plus(int_one,esk2_0) = esk3_0
| int_leq(esk2_0,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_67]),c_0_32]),c_0_36])]) ).
cnf(c_0_74,plain,
int_less(int_zero,int_one),
inference(split_conjunct,[status(thm)],[int_zero_one]) ).
cnf(c_0_75,negated_conjecture,
( esk3_0 = n
| int_less(X1,n)
| ~ int_less(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_68]) ).
cnf(c_0_76,hypothesis,
~ int_leq(esk2_0,n),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_60]),c_0_71]),c_0_53])]) ).
cnf(c_0_77,negated_conjecture,
( int_leq(esk2_0,esk3_0)
| int_leq(X1,esk3_0)
| ~ int_leq(X1,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74])]) ).
cnf(c_0_78,negated_conjecture,
( esk3_0 = n
| int_less(esk2_0,n) ),
inference(spm,[status(thm)],[c_0_75,c_0_36]) ).
cnf(c_0_79,hypothesis,
~ int_less(esk2_0,n),
inference(spm,[status(thm)],[c_0_76,c_0_66]) ).
cnf(c_0_80,negated_conjecture,
int_leq(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_77,c_0_55]) ).
cnf(c_0_81,negated_conjecture,
esk3_0 = n,
inference(sr,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_82,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_81]),c_0_76]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV486+1 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33 % Computer : n002.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % 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 05:20:16 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.76/1.88 % Version : CSE_E---1.7
% 1.76/1.88 % Problem : theBenchmark.p
% 1.76/1.88 % SZS status Theorem for theBenchmark.p
% 1.76/1.88 % SZS output start CNFRefutation
% See solution above
% 1.76/1.88 % Total time : 1.372s
%------------------------------------------------------------------------------