TSTP Solution File: SEV107^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV107^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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 21 04:07:37 EDT 2024
% Result : Theorem 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 14
% Syntax : Number of formulae : 55 ( 5 unt; 13 typ; 0 def)
% Number of atoms : 273 ( 0 equ; 0 cnn)
% Maximal formula atoms : 107 ( 6 avg)
% Number of connectives : 936 ( 134 ~; 169 |; 50 &; 571 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 47 ( 9 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 126 ( 0 ^ 120 !; 6 ?; 126 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
z: a ).
thf(decl_23,type,
cR: a > a > $o ).
thf(decl_24,type,
f: a > $i > $o ).
thf(decl_25,type,
cS: $i > $i > $o ).
thf(decl_26,type,
esk1_1: a > $i ).
thf(decl_27,type,
esk2_0: a ).
thf(decl_28,type,
esk3_1: $i > a ).
thf(decl_29,type,
esk4_0: $i ).
thf(decl_30,type,
esk5_0: a ).
thf(decl_31,type,
esk6_0: a ).
thf(decl_32,type,
esk7_0: $i ).
thf(decl_33,type,
esk8_1: a > a ).
thf(cTHM552B_pme,conjecture,
( ( ! [X1: a,X2: a,X3: a] :
( ( ( cR @ X1 @ X2 )
& ( cR @ X3 @ X2 ) )
=> ( cR @ X1 @ X3 ) )
& ! [X4: a] : ( cR @ X4 @ X4 ) )
=> ( ( ! [X4: a] :
? [X5: $i] : ( f @ X4 @ X5 )
& ! [X4: a,X6: $i,X7: $i] :
( ( ( f @ X4 @ X6 )
& ( f @ X4 @ X7 ) )
=> ( cS @ X6 @ X7 ) )
& ! [X8: a,X9: a,X5: $i] :
( ( ( f @ X8 @ X5 )
& ( f @ X9 @ X5 ) )
=> ( cR @ X8 @ X9 ) ) )
=> ( ! [X4: a] :
? [X5: $i] :
! [X3: a] :
( ( f @ X4 @ X5 )
| ( ~ ( f @ X3 @ X5 )
& ( cR @ X4 @ z ) ) )
& ! [X5: $i,X8: a,X9: a] :
( ( ! [X3: a] :
( ( f @ X8 @ X5 )
| ( ~ ( f @ X3 @ X5 )
& ( cR @ X8 @ z ) ) )
& ! [X3: a] :
( ( f @ X9 @ X5 )
| ( ~ ( f @ X3 @ X5 )
& ( cR @ X9 @ z ) ) ) )
=> ( cR @ X8 @ X9 ) )
& ! [X5: $i] :
? [X4: a] :
! [X3: a] :
( ( f @ X4 @ X5 )
| ( ~ ( f @ X3 @ X5 )
& ( cR @ X4 @ z ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM552B_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ( ! [X1: a,X2: a,X3: a] :
( ( ( cR @ X1 @ X2 )
& ( cR @ X3 @ X2 ) )
=> ( cR @ X1 @ X3 ) )
& ! [X4: a] : ( cR @ X4 @ X4 ) )
=> ( ( ! [X4: a] :
? [X5: $i] : ( f @ X4 @ X5 )
& ! [X4: a,X6: $i,X7: $i] :
( ( ( f @ X4 @ X6 )
& ( f @ X4 @ X7 ) )
=> ( cS @ X6 @ X7 ) )
& ! [X8: a,X9: a,X5: $i] :
( ( ( f @ X8 @ X5 )
& ( f @ X9 @ X5 ) )
=> ( cR @ X8 @ X9 ) ) )
=> ( ! [X4: a] :
? [X5: $i] :
! [X3: a] :
( ( f @ X4 @ X5 )
| ( ~ ( f @ X3 @ X5 )
& ( cR @ X4 @ z ) ) )
& ! [X5: $i,X8: a,X9: a] :
( ( ! [X3: a] :
( ( f @ X8 @ X5 )
| ( ~ ( f @ X3 @ X5 )
& ( cR @ X8 @ z ) ) )
& ! [X3: a] :
( ( f @ X9 @ X5 )
| ( ~ ( f @ X3 @ X5 )
& ( cR @ X9 @ z ) ) ) )
=> ( cR @ X8 @ X9 ) )
& ! [X5: $i] :
? [X4: a] :
! [X3: a] :
( ( f @ X4 @ X5 )
| ( ~ ( f @ X3 @ X5 )
& ( cR @ X4 @ z ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM552B_pme])]) ).
thf(c_0_2,negated_conjecture,
! [X33: a,X34: a,X35: a,X36: a,X37: a,X39: a,X40: $i,X41: $i,X42: a,X43: a,X44: $i,X46: $i,X51: a,X52: a,X54: a] :
( ( ~ ( cR @ X33 @ X34 )
| ~ ( cR @ X35 @ X34 )
| ( cR @ X33 @ X35 ) )
& ( cR @ X36 @ X36 )
& ( f @ X37 @ ( esk1_1 @ X37 ) )
& ( ~ ( f @ X39 @ X40 )
| ~ ( f @ X39 @ X41 )
| ( cS @ X40 @ X41 ) )
& ( ~ ( f @ X42 @ X44 )
| ~ ( f @ X43 @ X44 )
| ( cR @ X42 @ X43 ) )
& ( ~ ( f @ X54 @ esk7_0 )
| ~ ( f @ X51 @ esk4_0 )
| ( f @ esk5_0 @ esk4_0 )
| ~ ( f @ esk2_0 @ X46 ) )
& ( ( f @ ( esk8_1 @ X54 ) @ esk7_0 )
| ~ ( cR @ X54 @ z )
| ~ ( f @ X51 @ esk4_0 )
| ( f @ esk5_0 @ esk4_0 )
| ~ ( f @ esk2_0 @ X46 ) )
& ( ~ ( f @ X54 @ esk7_0 )
| ( cR @ esk5_0 @ z )
| ( f @ esk5_0 @ esk4_0 )
| ~ ( f @ esk2_0 @ X46 ) )
& ( ( f @ ( esk8_1 @ X54 ) @ esk7_0 )
| ~ ( cR @ X54 @ z )
| ( cR @ esk5_0 @ z )
| ( f @ esk5_0 @ esk4_0 )
| ~ ( f @ esk2_0 @ X46 ) )
& ( ~ ( f @ X54 @ esk7_0 )
| ~ ( f @ X52 @ esk4_0 )
| ( f @ esk6_0 @ esk4_0 )
| ~ ( f @ esk2_0 @ X46 ) )
& ( ( f @ ( esk8_1 @ X54 ) @ esk7_0 )
| ~ ( cR @ X54 @ z )
| ~ ( f @ X52 @ esk4_0 )
| ( f @ esk6_0 @ esk4_0 )
| ~ ( f @ esk2_0 @ X46 ) )
& ( ~ ( f @ X54 @ esk7_0 )
| ( cR @ esk6_0 @ z )
| ( f @ esk6_0 @ esk4_0 )
| ~ ( f @ esk2_0 @ X46 ) )
& ( ( f @ ( esk8_1 @ X54 ) @ esk7_0 )
| ~ ( cR @ X54 @ z )
| ( cR @ esk6_0 @ z )
| ( f @ esk6_0 @ esk4_0 )
| ~ ( f @ esk2_0 @ X46 ) )
& ( ~ ( f @ X54 @ esk7_0 )
| ~ ( cR @ esk5_0 @ esk6_0 )
| ~ ( f @ esk2_0 @ X46 ) )
& ( ( f @ ( esk8_1 @ X54 ) @ esk7_0 )
| ~ ( cR @ X54 @ z )
| ~ ( cR @ esk5_0 @ esk6_0 )
| ~ ( f @ esk2_0 @ X46 ) )
& ( ~ ( f @ X54 @ esk7_0 )
| ~ ( f @ X51 @ esk4_0 )
| ( f @ esk5_0 @ esk4_0 )
| ( f @ ( esk3_1 @ X46 ) @ X46 )
| ~ ( cR @ esk2_0 @ z ) )
& ( ( f @ ( esk8_1 @ X54 ) @ esk7_0 )
| ~ ( cR @ X54 @ z )
| ~ ( f @ X51 @ esk4_0 )
| ( f @ esk5_0 @ esk4_0 )
| ( f @ ( esk3_1 @ X46 ) @ X46 )
| ~ ( cR @ esk2_0 @ z ) )
& ( ~ ( f @ X54 @ esk7_0 )
| ( cR @ esk5_0 @ z )
| ( f @ esk5_0 @ esk4_0 )
| ( f @ ( esk3_1 @ X46 ) @ X46 )
| ~ ( cR @ esk2_0 @ z ) )
& ( ( f @ ( esk8_1 @ X54 ) @ esk7_0 )
| ~ ( cR @ X54 @ z )
| ( cR @ esk5_0 @ z )
| ( f @ esk5_0 @ esk4_0 )
| ( f @ ( esk3_1 @ X46 ) @ X46 )
| ~ ( cR @ esk2_0 @ z ) )
& ( ~ ( f @ X54 @ esk7_0 )
| ~ ( f @ X52 @ esk4_0 )
| ( f @ esk6_0 @ esk4_0 )
| ( f @ ( esk3_1 @ X46 ) @ X46 )
| ~ ( cR @ esk2_0 @ z ) )
& ( ( f @ ( esk8_1 @ X54 ) @ esk7_0 )
| ~ ( cR @ X54 @ z )
| ~ ( f @ X52 @ esk4_0 )
| ( f @ esk6_0 @ esk4_0 )
| ( f @ ( esk3_1 @ X46 ) @ X46 )
| ~ ( cR @ esk2_0 @ z ) )
& ( ~ ( f @ X54 @ esk7_0 )
| ( cR @ esk6_0 @ z )
| ( f @ esk6_0 @ esk4_0 )
| ( f @ ( esk3_1 @ X46 ) @ X46 )
| ~ ( cR @ esk2_0 @ z ) )
& ( ( f @ ( esk8_1 @ X54 ) @ esk7_0 )
| ~ ( cR @ X54 @ z )
| ( cR @ esk6_0 @ z )
| ( f @ esk6_0 @ esk4_0 )
| ( f @ ( esk3_1 @ X46 ) @ X46 )
| ~ ( cR @ esk2_0 @ z ) )
& ( ~ ( f @ X54 @ esk7_0 )
| ~ ( cR @ esk5_0 @ esk6_0 )
| ( f @ ( esk3_1 @ X46 ) @ X46 )
| ~ ( cR @ esk2_0 @ z ) )
& ( ( f @ ( esk8_1 @ X54 ) @ esk7_0 )
| ~ ( cR @ X54 @ z )
| ~ ( cR @ esk5_0 @ esk6_0 )
| ( f @ ( esk3_1 @ X46 ) @ X46 )
| ~ ( cR @ esk2_0 @ z ) ) ),
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)],[c_0_1])])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X1: a,X5: $i] :
( ( f @ ( esk8_1 @ X1 ) @ esk7_0 )
| ( cR @ esk6_0 @ z )
| ( f @ esk6_0 @ esk4_0 )
| ~ ( cR @ X1 @ z )
| ~ ( f @ esk2_0 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X1: a,X5: $i] :
( ( cR @ esk6_0 @ z )
| ( f @ esk6_0 @ esk4_0 )
| ~ ( f @ X1 @ esk7_0 )
| ~ ( f @ esk2_0 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X1: a,X5: $i] :
( ( f @ esk6_0 @ esk4_0 )
| ( cR @ esk6_0 @ z )
| ~ ( cR @ X1 @ z )
| ~ ( f @ esk2_0 @ X5 ) ),
inference(csr,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X1: a] : ( cR @ X1 @ X1 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X5: $i] :
( ( f @ esk6_0 @ esk4_0 )
| ( cR @ esk6_0 @ z )
| ~ ( f @ esk2_0 @ X5 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_8,negated_conjecture,
! [X1: a] : ( f @ X1 @ ( esk1_1 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
! [X1: a,X5: $i] :
( ( f @ ( esk8_1 @ X1 ) @ esk7_0 )
| ( cR @ esk5_0 @ z )
| ( f @ esk5_0 @ esk4_0 )
| ~ ( cR @ X1 @ z )
| ~ ( f @ esk2_0 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_10,negated_conjecture,
! [X1: a,X5: $i] :
( ( cR @ esk5_0 @ z )
| ( f @ esk5_0 @ esk4_0 )
| ~ ( f @ X1 @ esk7_0 )
| ~ ( f @ esk2_0 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_11,negated_conjecture,
! [X1: a,X5: $i] :
( ( f @ ( esk8_1 @ X1 ) @ esk7_0 )
| ~ ( cR @ X1 @ z )
| ~ ( cR @ esk5_0 @ esk6_0 )
| ~ ( f @ esk2_0 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_12,negated_conjecture,
! [X1: a,X5: $i] :
( ~ ( f @ X1 @ esk7_0 )
| ~ ( cR @ esk5_0 @ esk6_0 )
| ~ ( f @ esk2_0 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_13,negated_conjecture,
! [X1: a,X3: a,X2: a] :
( ( cR @ X1 @ X3 )
| ~ ( cR @ X1 @ X2 )
| ~ ( cR @ X3 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_14,negated_conjecture,
( ( cR @ esk6_0 @ z )
| ( f @ esk6_0 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_15,negated_conjecture,
! [X1: a,X5: $i] :
( ( f @ esk5_0 @ esk4_0 )
| ( cR @ esk5_0 @ z )
| ~ ( cR @ X1 @ z )
| ~ ( f @ esk2_0 @ X5 ) ),
inference(csr,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_16,negated_conjecture,
! [X1: a,X5: $i] :
( ~ ( cR @ esk5_0 @ esk6_0 )
| ~ ( cR @ X1 @ z )
| ~ ( f @ esk2_0 @ X5 ) ),
inference(csr,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_17,negated_conjecture,
! [X1: a] :
( ( f @ esk6_0 @ esk4_0 )
| ( cR @ X1 @ esk6_0 )
| ~ ( cR @ X1 @ z ) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_18,negated_conjecture,
! [X5: $i] :
( ( f @ esk5_0 @ esk4_0 )
| ( cR @ esk5_0 @ z )
| ~ ( f @ esk2_0 @ X5 ) ),
inference(spm,[status(thm)],[c_0_15,c_0_6]) ).
thf(c_0_19,negated_conjecture,
! [X1: a,X5: $i] :
( ( f @ esk6_0 @ esk4_0 )
| ~ ( cR @ esk5_0 @ z )
| ~ ( cR @ X1 @ z )
| ~ ( f @ esk2_0 @ X5 ) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_20,negated_conjecture,
( ( cR @ esk5_0 @ z )
| ( f @ esk5_0 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_18,c_0_8]) ).
thf(c_0_21,negated_conjecture,
! [X1: a,X2: a,X5: $i] :
( ( f @ ( esk8_1 @ X1 ) @ esk7_0 )
| ( f @ esk5_0 @ esk4_0 )
| ~ ( cR @ X1 @ z )
| ~ ( f @ X2 @ esk4_0 )
| ~ ( f @ esk2_0 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_22,negated_conjecture,
! [X1: a,X2: a,X5: $i] :
( ( f @ esk5_0 @ esk4_0 )
| ~ ( f @ X1 @ esk7_0 )
| ~ ( f @ X2 @ esk4_0 )
| ~ ( f @ esk2_0 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_23,negated_conjecture,
! [X1: a,X5: $i] :
( ( f @ esk5_0 @ esk4_0 )
| ( f @ esk6_0 @ esk4_0 )
| ~ ( cR @ X1 @ z )
| ~ ( f @ esk2_0 @ X5 ) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_24,negated_conjecture,
! [X1: a,X2: a,X5: $i] :
( ( f @ esk5_0 @ esk4_0 )
| ~ ( cR @ X1 @ z )
| ~ ( f @ X2 @ esk4_0 )
| ~ ( f @ esk2_0 @ X5 ) ),
inference(csr,[status(thm)],[c_0_21,c_0_22]) ).
thf(c_0_25,negated_conjecture,
! [X5: $i] :
( ( f @ esk6_0 @ esk4_0 )
| ( f @ esk5_0 @ esk4_0 )
| ~ ( f @ esk2_0 @ X5 ) ),
inference(spm,[status(thm)],[c_0_23,c_0_14]) ).
thf(c_0_26,negated_conjecture,
! [X1: a,X5: $i] :
( ( f @ esk5_0 @ esk4_0 )
| ~ ( f @ X1 @ esk4_0 )
| ~ ( f @ esk2_0 @ X5 ) ),
inference(spm,[status(thm)],[c_0_24,c_0_20]) ).
thf(c_0_27,negated_conjecture,
( ( f @ esk5_0 @ esk4_0 )
| ( f @ esk6_0 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_25,c_0_8]) ).
thf(c_0_28,negated_conjecture,
! [X5: $i] :
( ( f @ esk5_0 @ esk4_0 )
| ~ ( f @ esk2_0 @ X5 ) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
thf(c_0_29,negated_conjecture,
! [X1: a,X2: a,X5: $i] :
( ( cR @ X1 @ X2 )
| ~ ( f @ X1 @ X5 )
| ~ ( f @ X2 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_30,negated_conjecture,
f @ esk5_0 @ esk4_0,
inference(spm,[status(thm)],[c_0_28,c_0_8]) ).
thf(c_0_31,negated_conjecture,
! [X1: a] :
( ( cR @ X1 @ esk5_0 )
| ~ ( f @ X1 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
thf(c_0_32,negated_conjecture,
! [X1: a,X2: a] :
( ( cR @ X1 @ X2 )
| ~ ( cR @ X1 @ esk5_0 )
| ~ ( f @ X2 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_13,c_0_31]) ).
thf(c_0_33,negated_conjecture,
! [X1: a] :
( ( cR @ esk5_0 @ X1 )
| ~ ( f @ X1 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_32,c_0_6]) ).
thf(c_0_34,negated_conjecture,
! [X1: a,X2: a,X5: $i] :
( ( f @ ( esk8_1 @ X1 ) @ esk7_0 )
| ( f @ esk6_0 @ esk4_0 )
| ~ ( cR @ X1 @ z )
| ~ ( f @ X2 @ esk4_0 )
| ~ ( f @ esk2_0 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_35,negated_conjecture,
! [X1: a,X2: a,X5: $i] :
( ( f @ esk6_0 @ esk4_0 )
| ~ ( f @ X1 @ esk7_0 )
| ~ ( f @ X2 @ esk4_0 )
| ~ ( f @ esk2_0 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_36,negated_conjecture,
! [X1: a,X5: $i] :
( ~ ( f @ esk6_0 @ esk4_0 )
| ~ ( cR @ X1 @ z )
| ~ ( f @ esk2_0 @ X5 ) ),
inference(spm,[status(thm)],[c_0_16,c_0_33]) ).
thf(c_0_37,negated_conjecture,
! [X1: a,X2: a,X5: $i] :
( ( f @ esk6_0 @ esk4_0 )
| ~ ( cR @ X1 @ z )
| ~ ( f @ X2 @ esk4_0 )
| ~ ( f @ esk2_0 @ X5 ) ),
inference(csr,[status(thm)],[c_0_34,c_0_35]) ).
thf(c_0_38,negated_conjecture,
! [X5: $i] :
( ~ ( f @ esk6_0 @ esk4_0 )
| ~ ( f @ esk2_0 @ X5 ) ),
inference(spm,[status(thm)],[c_0_36,c_0_6]) ).
thf(c_0_39,negated_conjecture,
! [X1: a,X5: $i] :
( ~ ( f @ X1 @ esk4_0 )
| ~ ( f @ esk2_0 @ X5 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_14]),c_0_38]) ).
thf(c_0_40,negated_conjecture,
! [X5: $i] :
~ ( f @ esk2_0 @ X5 ),
inference(spm,[status(thm)],[c_0_39,c_0_30]) ).
thf(c_0_41,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_40,c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEV107^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.34 % Computer : n028.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 18:30:53 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.48 Running higher-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/eprover-ho --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.21/0.50 # Version: 3.1.0-ho
% 0.21/0.50 # Preprocessing class: HSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting full_lambda_5 with 300s (1) cores
% 0.21/0.50 # Starting new_ho_10_unif with 300s (1) cores
% 0.21/0.50 # new_ho_10 with pid 9855 completed with status 0
% 0.21/0.50 # Result found by new_ho_10
% 0.21/0.50 # Preprocessing class: HSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: HGHNS-FFMF11-SFFFFFNN
% 0.21/0.50 # partial match(1): FGHNS-FFMF11-SFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 470s (1) cores
% 0.21/0.50 # Starting new_ho_10 with 151s (1) cores
% 0.21/0.50 # Starting new_bool_3 with 310s (1) cores
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S002A with 152s (1) cores
% 0.21/0.50 # Starting G-E--_107_C12_02_nc_F1_PI_AE_Q4_CS_SP_PS_S071I with 136s (1) cores
% 0.21/0.50 # SAT001_MinMin_p005000_rr_RG with pid 9860 completed with status 0
% 0.21/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.50 # Preprocessing class: HSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: HGHNS-FFMF11-SFFFFFNN
% 0.21/0.50 # partial match(1): FGHNS-FFMF11-SFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 470s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Theorem
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 6
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 30
% 0.21/0.50 # Removed in clause preprocessing : 5
% 0.21/0.50 # Initial clauses in saturation : 25
% 0.21/0.50 # Processed clauses : 81
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 4
% 0.21/0.50 # ...remaining for further processing : 77
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 26
% 0.21/0.50 # Backward-rewritten : 9
% 0.21/0.50 # Generated clauses : 73
% 0.21/0.50 # ...of the previous two non-redundant : 68
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 11
% 0.21/0.50 # Paramodulations : 73
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 10
% 0.21/0.50 # ...of those cached : 9
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 17
% 0.21/0.50 # Positive orientable unit clauses : 3
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 1
% 0.21/0.50 # Non-unit-clauses : 13
% 0.21/0.50 # Current number of unprocessed clauses: 31
% 0.21/0.50 # ...number of literals in the above : 123
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 60
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 398
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 204
% 0.21/0.50 # Non-unit clause-clause subsumptions : 35
% 0.21/0.50 # Unit Clause-clause subsumption calls : 8
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 3
% 0.21/0.50 # BW rewrite match successes : 1
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 4068
% 0.21/0.50 # Search garbage collected termcells : 605
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.007 s
% 0.21/0.50 # System time : 0.003 s
% 0.21/0.50 # Total time : 0.010 s
% 0.21/0.50 # Maximum resident set size: 1932 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.025 s
% 0.21/0.50 # System time : 0.013 s
% 0.21/0.50 # Total time : 0.038 s
% 0.21/0.50 # Maximum resident set size: 1716 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.50 % E exiting
%------------------------------------------------------------------------------