TSTP Solution File: SWV486+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWV486+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n022.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 : Thu Aug 31 21:41:29 EDT 2023
% Result : Theorem 0.56s 0.73s
% Output : CNFRefutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 26
% Syntax : Number of formulae : 98 ( 21 unt; 14 typ; 0 def)
% Number of atoms : 251 ( 56 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 268 ( 101 ~; 106 |; 37 &)
% ( 4 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 7 >; 7 *; 0 +; 0 <<)
% 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 : 157 ( 0 sgn; 73 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
int_leq: ( $i * $i ) > $o ).
tff(decl_23,type,
int_less: ( $i * $i ) > $o ).
tff(decl_24,type,
int_zero: $i ).
tff(decl_25,type,
int_one: $i ).
tff(decl_26,type,
plus: ( $i * $i ) > $i ).
tff(decl_27,type,
real_zero: $i ).
tff(decl_28,type,
real_one: $i ).
tff(decl_29,type,
n: $i ).
tff(decl_30,type,
a: ( $i * $i ) > $i ).
tff(decl_31,type,
qr: ( $i * $i ) > $i ).
tff(decl_32,type,
epred1_2: ( $i * $i ) > $o ).
tff(decl_33,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_34,type,
esk2_0: $i ).
tff(decl_35,type,
esk3_0: $i ).
fof(plus_and_inverse,axiom,
! [X1,X2] :
( int_less(X1,X2)
<=> ? [X3] :
( plus(X1,X3) = X2
& int_less(int_zero,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus_and_inverse) ).
fof(int_less_irreflexive,axiom,
! [X1,X2] :
( int_less(X1,X2)
=> X1 != X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_less_irreflexive) ).
fof(int_less_transitive,axiom,
! [X1,X2,X3] :
( ( int_less(X1,X2)
& int_less(X2,X3) )
=> int_less(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_less_transitive) ).
fof(plus_commutative,axiom,
! [X1,X2] : plus(X1,X2) = plus(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus_commutative) ).
fof(int_leq,axiom,
! [X1,X2] :
( int_leq(X1,X2)
<=> ( int_less(X1,X2)
| X1 = X2 ) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',one_successor_of_zero) ).
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/sandbox/benchmark/theBenchmark.p',plus_and_order1) ).
fof(int_less_total,axiom,
! [X1,X2] :
( int_less(X1,X2)
| int_leq(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_less_total) ).
fof(plus_zero,axiom,
! [X1] : plus(X1,int_zero) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus_zero) ).
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/sandbox/benchmark/theBenchmark.p',lt) ).
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/sandbox/benchmark/theBenchmark.p',qih) ).
fof(c_0_11,plain,
! [X25,X26,X28,X29,X30] :
( ( plus(X25,esk1_2(X25,X26)) = X26
| ~ int_less(X25,X26) )
& ( int_less(int_zero,esk1_2(X25,X26))
| ~ int_less(X25,X26) )
& ( plus(X28,X30) != X29
| ~ int_less(int_zero,X30)
| int_less(X28,X29) ) ),
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_12,plain,
! [X14,X15] :
( ~ int_less(X14,X15)
| X14 != X15 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[int_less_irreflexive])]) ).
fof(c_0_13,plain,
! [X11,X12,X13] :
( ~ int_less(X11,X12)
| ~ int_less(X12,X13)
| int_less(X11,X13) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[int_less_transitive])]) ).
cnf(c_0_14,plain,
( int_less(X1,X3)
| plus(X1,X2) != X3
| ~ int_less(int_zero,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( ~ int_less(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( int_less(X1,X3)
| ~ int_less(X1,X2)
| ~ int_less(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( int_less(X1,plus(X1,X2))
| ~ int_less(int_zero,X2) ),
inference(er,[status(thm)],[c_0_14]) ).
fof(c_0_18,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) ).
cnf(c_0_19,plain,
~ int_less(X1,X1),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( int_less(X1,plus(X2,X3))
| ~ int_less(int_zero,X3)
| ~ int_less(X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_21,plain,
! [X18,X19] : plus(X18,X19) = plus(X19,X18),
inference(variable_rename,[status(thm)],[plus_commutative]) ).
fof(c_0_22,plain,
! [X9,X10] :
( ( ~ int_leq(X9,X10)
| int_less(X9,X10)
| X9 = X10 )
& ( ~ int_less(X9,X10)
| int_leq(X9,X10) )
& ( X9 != X10
| int_leq(X9,X10) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[int_leq])])]) ).
fof(c_0_23,plain,
! [X31] :
( ( ~ int_less(int_zero,X31)
| int_leq(int_one,X31) )
& ( ~ int_leq(int_one,X31)
| int_less(int_zero,X31) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[one_successor_of_zero])]) ).
fof(c_0_24,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_18]) ).
fof(c_0_25,plain,
! [X21,X22,X23,X24] :
( ~ int_less(X21,X22)
| ~ int_leq(X23,X24)
| int_leq(plus(X21,X23),plus(X22,X24)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[plus_and_order1])]) ).
cnf(c_0_26,plain,
( ~ int_less(plus(X1,X2),X1)
| ~ int_less(int_zero,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
plus(X1,X2) = plus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
( int_less(X1,X2)
| X1 = X2
| ~ int_leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,plain,
( int_leq(int_one,X1)
| ~ int_less(int_zero,X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_30,plain,
! [X36,X37,X38,X39,X40,X41] :
( ( ~ int_less(int_zero,X38)
| X37 != plus(X36,X38)
| ~ int_leq(int_one,X39)
| ~ int_leq(X39,X36)
| a(plus(X39,X38),X39) = qr(plus(X39,X38),X39)
| ~ epred1_2(X37,X36) )
& ( ~ int_less(int_zero,X40)
| X36 != plus(X37,X40)
| ~ int_leq(int_one,X41)
| ~ int_leq(X41,X37)
| a(X41,plus(X41,X40)) = real_zero
| ~ epred1_2(X37,X36) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])])]) ).
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_25]) ).
cnf(c_0_32,plain,
( plus(X1,esk1_2(X1,X2)) = X2
| ~ int_less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_33,plain,
! [X16,X17] :
( int_less(X16,X17)
| int_leq(X17,X16) ),
inference(variable_rename,[status(thm)],[int_less_total]) ).
fof(c_0_34,plain,
! [X20] : plus(X20,int_zero) = X20,
inference(variable_rename,[status(thm)],[plus_zero]) ).
cnf(c_0_35,plain,
( ~ int_less(plus(X1,X2),X2)
| ~ int_less(int_zero,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_36,plain,
( int_one = X1
| int_less(int_one,X1)
| ~ int_less(int_zero,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,plain,
( int_less(int_zero,esk1_2(X1,X2))
| ~ int_less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_38,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]) ).
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_leq(plus(X1,X2),X3)
| ~ int_less(X1,X4)
| ~ int_less(X4,X3)
| ~ int_leq(X2,esk1_2(X4,X3)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_41,plain,
( int_less(int_zero,X1)
| ~ int_leq(int_one,X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_42,plain,
( int_less(X1,X2)
| int_leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_43,plain,
plus(X1,int_zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_44,plain,
( int_less(X1,plus(X2,X1))
| ~ int_less(int_zero,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_27]) ).
cnf(c_0_45,plain,
( ~ int_less(X1,esk1_2(X2,X1))
| ~ int_less(int_zero,X2)
| ~ int_less(X2,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_32]) ).
cnf(c_0_46,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_36,c_0_37]) ).
fof(c_0_47,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_38])])]) ).
cnf(c_0_48,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_49,plain,
( int_leq(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_50,plain,
( int_leq(plus(X1,int_one),X2)
| ~ int_less(X1,X3)
| ~ int_less(X3,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_29]),c_0_37]) ).
cnf(c_0_51,plain,
( int_less(X1,int_one)
| int_less(int_zero,X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_52,plain,
plus(int_zero,X1) = X1,
inference(spm,[status(thm)],[c_0_43,c_0_27]) ).
cnf(c_0_53,plain,
( int_less(esk1_2(X1,X2),X2)
| ~ int_less(int_zero,X1)
| ~ int_less(X1,X2) ),
inference(spm,[status(thm)],[c_0_44,c_0_32]) ).
cnf(c_0_54,plain,
( esk1_2(X1,int_one) = int_one
| ~ int_less(int_zero,X1)
| ~ int_less(X1,int_one) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_55,negated_conjecture,
int_leq(int_one,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_56,negated_conjecture,
int_leq(esk3_0,n),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_57,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_48,c_0_32]),c_0_37]) ).
cnf(c_0_58,plain,
int_leq(X1,X1),
inference(er,[status(thm)],[c_0_49]) ).
fof(c_0_59,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_18]) ).
cnf(c_0_60,plain,
( int_less(X1,int_one)
| int_leq(int_one,X2)
| ~ int_less(X1,X2) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]) ).
cnf(c_0_61,negated_conjecture,
int_less(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_62,plain,
( ~ int_less(int_zero,X1)
| ~ int_less(X1,int_one) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_19]) ).
cnf(c_0_63,negated_conjecture,
int_less(int_zero,esk2_0),
inference(spm,[status(thm)],[c_0_41,c_0_55]) ).
cnf(c_0_64,negated_conjecture,
( n = esk3_0
| int_less(esk3_0,n) ),
inference(spm,[status(thm)],[c_0_28,c_0_56]) ).
cnf(c_0_65,plain,
( X1 = X2
| int_less(X2,X1)
| int_less(X1,X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_42]) ).
cnf(c_0_66,negated_conjecture,
a(esk2_0,esk3_0) != real_zero,
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_67,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_57,c_0_32]),c_0_58])]) ).
fof(c_0_68,hypothesis,
! [X32,X33] :
( ~ int_leq(int_one,X32)
| ~ int_leq(X32,n)
| ~ int_leq(int_one,X33)
| ~ int_leq(X33,n)
| epred1_2(X32,X33) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_59])]) ).
cnf(c_0_69,negated_conjecture,
( int_less(esk2_0,int_one)
| int_leq(int_one,esk3_0) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_70,negated_conjecture,
~ int_less(esk2_0,int_one),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_71,negated_conjecture,
( n = esk3_0
| int_less(X1,n)
| ~ int_less(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_64]) ).
cnf(c_0_72,plain,
( X1 = X2
| int_less(X2,X1)
| int_less(X3,X2)
| ~ int_less(X3,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_65]) ).
cnf(c_0_73,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_66,c_0_67]),c_0_61]),c_0_55])]) ).
cnf(c_0_74,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_68]) ).
cnf(c_0_75,negated_conjecture,
int_leq(int_one,esk3_0),
inference(sr,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_76,negated_conjecture,
( n = esk3_0
| ~ int_less(n,esk3_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_71]) ).
cnf(c_0_77,negated_conjecture,
( esk3_0 = X1
| int_less(esk2_0,X1)
| int_less(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_72,c_0_61]) ).
cnf(c_0_78,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_73,c_0_74]),c_0_56]),c_0_75]),c_0_55])]) ).
cnf(c_0_79,plain,
( int_leq(X1,X2)
| ~ int_less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_80,negated_conjecture,
( n = esk3_0
| int_less(esk2_0,n) ),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_81,hypothesis,
~ int_less(esk2_0,n),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_82,negated_conjecture,
n = esk3_0,
inference(sr,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_83,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_82]),c_0_61])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.12 % Problem : SWV486+1 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34 % Computer : n022.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 29 03:52:23 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.58 start to proof: theBenchmark
% 0.56/0.73 % Version : CSE_E---1.5
% 0.56/0.73 % Problem : theBenchmark.p
% 0.56/0.73 % Proof found
% 0.56/0.73 % SZS status Theorem for theBenchmark.p
% 0.56/0.73 % SZS output start Proof
% See solution above
% 0.56/0.73 % Total time : 0.135000 s
% 0.56/0.73 % SZS output end Proof
% 0.56/0.73 % Total time : 0.137000 s
%------------------------------------------------------------------------------