%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEV420^1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n001.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Sep 30 08:36:35 AM UTC 2026
% Result : Theorem 0.20s 0.30s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 30 ( 26 unt; 0 typ; 0 def)
% Number of atoms : 170 ( 74 equ; 0 cnn)
% Maximal formula atoms : 63 ( 5 avg)
% Number of connectives : 509 ( 38 ~; 48 |; 69 &; 287 @)
% ( 1 <=>; 66 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 77 ( 77 >; 0 *; 0 +; 0 <<)
% Number of symbols : 26 ( 23 usr; 6 con; 0-3 aty)
% Number of variables : 155 ( 59 ^; 78 !; 18 ?; 155 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_25,type,
emptyset: $i > $o ).
thf(decl_28,type,
union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_30,type,
intersection: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_37,type,
is_function: ( $i > $o ) > ( $i > $i ) > ( $i > $o ) > $o ).
thf(decl_38,type,
injection: ( $i > $o ) > ( $i > $i ) > ( $i > $o ) > $o ).
thf(decl_39,type,
surjection: ( $i > $o ) > ( $i > $i ) > ( $i > $o ) > $o ).
thf(decl_40,type,
bijection: ( $i > $o ) > ( $i > $i ) > ( $i > $o ) > $o ).
thf(decl_41,type,
equinumerous: ( $i > $o ) > ( $i > $o ) > $o ).
thf(decl_42,type,
embedding: ( $i > $o ) > ( $i > $o ) > $o ).
thf(decl_43,type,
epred1_0: $i > $o ).
thf(decl_44,type,
epred2_0: $i > $o ).
thf(decl_45,type,
epred3_0: $i > $o ).
thf(decl_46,type,
epred4_0: $i > $o ).
thf(decl_47,type,
esk1_0: $i > $i ).
thf(decl_48,type,
esk2_0: $i ).
thf(decl_49,type,
esk3_0: $i ).
thf(decl_50,type,
esk4_1: $i > $i ).
thf(decl_51,type,
esk5_0: $i > $i ).
thf(decl_52,type,
esk6_0: $i ).
thf(decl_53,type,
esk7_0: $i ).
thf(decl_54,type,
esk8_1: $i > $i ).
thf(decl_55,type,
esk9_1: ( $i > $i ) > $i ).
thf(decl_56,type,
esk10_1: ( $i > $i ) > $i ).
thf(injection,axiom,
( injection
= ( ^ [X26: $i > $o,X23: $i > $i,X27: $i > $o] :
( ( is_function @ X26 @ X23 @ X27 )
=> ! [X28: $i,X29: $i] :
( ( ( X26 @ X28 )
& ( X26 @ X29 )
& ( ( X23 @ X28 )
= ( X23 @ X29 ) ) )
=> ( X28 = X29 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.mHcZru8FOT/E---3.1_1407682.p',injection) ).
thf(is_function,axiom,
( is_function
= ( ^ [X22: $i > $o,X23: $i > $i,X24: $i > $o] :
! [X25: $i] :
( ( X22 @ X25 )
=> ( X24 @ ( X23 @ X25 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.mHcZru8FOT/E---3.1_1407682.p',is_function) ).
thf(surjection,axiom,
( surjection
= ( ^ [X30: $i > $o,X23: $i > $i,X31: $i > $o] :
( ( is_function @ X30 @ X23 @ X31 )
=> ! [X28: $i] :
( ( X31 @ X28 )
=> ? [X29: $i] :
( ( X30 @ X29 )
& ( ( X23 @ X29 )
= X28 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.mHcZru8FOT/E---3.1_1407682.p',surjection) ).
thf(bijection,axiom,
( bijection
= ( ^ [X32: $i > $o,X23: $i > $i,X33: $i > $o] :
( ( injection @ X32 @ X23 @ X33 )
& ( surjection @ X32 @ X23 @ X33 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.mHcZru8FOT/E---3.1_1407682.p',bijection) ).
thf(equinumerous,axiom,
( equinumerous
= ( ^ [X34: $i > $o,X35: $i > $o] :
? [X23: $i > $i] : ( bijection @ X34 @ X23 @ X35 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.mHcZru8FOT/E---3.1_1407682.p',equinumerous) ).
thf(embedding,axiom,
( embedding
= ( ^ [X36: $i > $o,X37: $i > $o] :
? [X23: $i > $i] : ( injection @ X36 @ X23 @ X37 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.mHcZru8FOT/E---3.1_1407682.p',embedding) ).
thf(prove,conjecture,
! [X38: $i > $o,X39: $i > $o,X40: $i > $o,X41: $i > $o] :
( ( ( equinumerous @ X38 @ X39 )
& ( equinumerous @ X40 @ X41 )
& ( ( intersection @ X39 @ X41 )
= emptyset ) )
=> ( embedding @ ( union @ X38 @ X40 ) @ ( union @ X39 @ X41 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.mHcZru8FOT/E---3.1_1407682.p',prove) ).
thf(emptyset,axiom,
( emptyset
= ( ^ [X1: $i] : ~ $true ) ),
file('/export/starexec/sandbox2/tmp/tmp.mHcZru8FOT/E---3.1_1407682.p',emptyset) ).
thf(union,axiom,
( union
= ( ^ [X5: $i > $o,X6: $i > $o,X4: $i] :
( ( X5 @ X4 )
| ( X6 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.mHcZru8FOT/E---3.1_1407682.p',union) ).
thf(intersection,axiom,
( intersection
= ( ^ [X9: $i > $o,X10: $i > $o,X4: $i] :
( ( X9 @ X4 )
& ( X10 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.mHcZru8FOT/E---3.1_1407682.p',intersection) ).
thf(c_0_10,plain,
( injection
= ( ^ [Z0: $i > $o,Z1: $i > $i,Z2: $i > $o] :
( ! [X46: $i] :
( ( Z0 @ X46 )
=> ( Z2 @ ( Z1 @ X46 ) ) )
=> ! [X28: $i,X29: $i] :
( ( ( Z0 @ X28 )
& ( Z0 @ X29 )
& ( ( Z1 @ X28 )
= ( Z1 @ X29 ) ) )
=> ( X28 = X29 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[injection]) ).
thf(c_0_11,plain,
( is_function
= ( ^ [Z0: $i > $o,Z1: $i > $i,Z2: $i > $o] :
! [X25: $i] :
( ( Z0 @ X25 )
=> ( Z2 @ ( Z1 @ X25 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[is_function]) ).
thf(c_0_12,plain,
( surjection
= ( ^ [Z0: $i > $o,Z1: $i > $i,Z2: $i > $o] :
( ! [X47: $i] :
( ( Z0 @ X47 )
=> ( Z2 @ ( Z1 @ X47 ) ) )
=> ! [X28: $i] :
( ( Z2 @ X28 )
=> ? [X29: $i] :
( ( Z0 @ X29 )
& ( ( Z1 @ X29 )
= X28 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[surjection]) ).
thf(c_0_13,plain,
( bijection
= ( ^ [Z0: $i > $o,Z1: $i > $i,Z2: $i > $o] :
( ( ! [X48: $i] :
( ( Z0 @ X48 )
=> ( Z2 @ ( Z1 @ X48 ) ) )
=> ! [X49: $i,X50: $i] :
( ( ( Z0 @ X49 )
& ( Z0 @ X50 )
& ( ( Z1 @ X49 )
= ( Z1 @ X50 ) ) )
=> ( X49 = X50 ) ) )
& ( ! [X51: $i] :
( ( Z0 @ X51 )
=> ( Z2 @ ( Z1 @ X51 ) ) )
=> ! [X52: $i] :
( ( Z2 @ X52 )
=> ? [X53: $i] :
( ( Z0 @ X53 )
& ( ( Z1 @ X53 )
= X52 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[bijection]) ).
thf(c_0_14,plain,
( injection
= ( ^ [Z0: $i > $o,Z1: $i > $i,Z2: $i > $o] :
( ! [X46: $i] :
( ( Z0 @ X46 )
=> ( Z2 @ ( Z1 @ X46 ) ) )
=> ! [X28: $i,X29: $i] :
( ( ( Z0 @ X28 )
& ( Z0 @ X29 )
& ( ( Z1 @ X28 )
= ( Z1 @ X29 ) ) )
=> ( X28 = X29 ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_15,plain,
( surjection
= ( ^ [Z0: $i > $o,Z1: $i > $i,Z2: $i > $o] :
( ! [X47: $i] :
( ( Z0 @ X47 )
=> ( Z2 @ ( Z1 @ X47 ) ) )
=> ! [X28: $i] :
( ( Z2 @ X28 )
=> ? [X29: $i] :
( ( Z0 @ X29 )
& ( ( Z1 @ X29 )
= X28 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_12,c_0_11]) ).
thf(c_0_16,plain,
( equinumerous
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
? [X23: $i > $i] :
( ( ! [X54: $i] :
( ( Z0 @ X54 )
=> ( Z1 @ ( X23 @ X54 ) ) )
=> ! [X55: $i,X56: $i] :
( ( ( Z0 @ X55 )
& ( Z0 @ X56 )
& ( ( X23 @ X55 )
= ( X23 @ X56 ) ) )
=> ( X55 = X56 ) ) )
& ( ! [X57: $i] :
( ( Z0 @ X57 )
=> ( Z1 @ ( X23 @ X57 ) ) )
=> ! [X58: $i] :
( ( Z1 @ X58 )
=> ? [X59: $i] :
( ( Z0 @ X59 )
& ( ( X23 @ X59 )
= X58 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[equinumerous]) ).
thf(c_0_17,plain,
( bijection
= ( ^ [Z0: $i > $o,Z1: $i > $i,Z2: $i > $o] :
( ( ! [X48: $i] :
( ( Z0 @ X48 )
=> ( Z2 @ ( Z1 @ X48 ) ) )
=> ! [X49: $i,X50: $i] :
( ( ( Z0 @ X49 )
& ( Z0 @ X50 )
& ( ( Z1 @ X49 )
= ( Z1 @ X50 ) ) )
=> ( X49 = X50 ) ) )
& ( ! [X51: $i] :
( ( Z0 @ X51 )
=> ( Z2 @ ( Z1 @ X51 ) ) )
=> ! [X52: $i] :
( ( Z2 @ X52 )
=> ? [X53: $i] :
( ( Z0 @ X53 )
& ( ( Z1 @ X53 )
= X52 ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
thf(c_0_18,plain,
( embedding
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
? [X23: $i > $i] :
( ! [X60: $i] :
( ( Z0 @ X60 )
=> ( Z1 @ ( X23 @ X60 ) ) )
=> ! [X61: $i,X62: $i] :
( ( ( Z0 @ X61 )
& ( Z0 @ X62 )
& ( ( X23 @ X61 )
= ( X23 @ X62 ) ) )
=> ( X61 = X62 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[embedding]) ).
thf(c_0_19,negated_conjecture,
~ ! [X38: $i > $o,X39: $i > $o,X40: $i > $o,X41: $i > $o] :
( ( ( equinumerous @ X38 @ X39 )
& ( equinumerous @ X40 @ X41 )
& ( ( intersection @ X39 @ X41 )
= emptyset ) )
=> ( embedding @ ( union @ X38 @ X40 ) @ ( union @ X39 @ X41 ) ) ),
inference(assume_negation,[status(cth)],[prove]) ).
thf(c_0_20,plain,
( emptyset
= ( ^ [Z0: $i] : ~ $true ) ),
inference(fof_simplification,[status(thm)],[emptyset]) ).
thf(c_0_21,plain,
( union
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[union]) ).
thf(c_0_22,plain,
( intersection
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
& ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[intersection]) ).
thf(c_0_23,plain,
( equinumerous
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
? [X23: $i > $i] :
( ( ! [X54: $i] :
( ( Z0 @ X54 )
=> ( Z1 @ ( X23 @ X54 ) ) )
=> ! [X55: $i,X56: $i] :
( ( ( Z0 @ X55 )
& ( Z0 @ X56 )
& ( ( X23 @ X55 )
= ( X23 @ X56 ) ) )
=> ( X55 = X56 ) ) )
& ( ! [X57: $i] :
( ( Z0 @ X57 )
=> ( Z1 @ ( X23 @ X57 ) ) )
=> ! [X58: $i] :
( ( Z1 @ X58 )
=> ? [X59: $i] :
( ( Z0 @ X59 )
& ( ( X23 @ X59 )
= X58 ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_24,plain,
( embedding
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
? [X23: $i > $i] :
( ! [X60: $i] :
( ( Z0 @ X60 )
=> ( Z1 @ ( X23 @ X60 ) ) )
=> ! [X61: $i,X62: $i] :
( ( ( Z0 @ X61 )
& ( Z0 @ X62 )
& ( ( X23 @ X61 )
= ( X23 @ X62 ) ) )
=> ( X61 = X62 ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_18,c_0_14]) ).
thf(c_0_25,negated_conjecture,
~ ! [X38: $i > $o,X39: $i > $o,X40: $i > $o,X41: $i > $o] :
( ( ? [X63: $i > $i] :
( ( ! [X64: $i] :
( ( X38 @ X64 )
=> ( X39 @ ( X63 @ X64 ) ) )
=> ! [X65: $i,X66: $i] :
( ( ( X38 @ X65 )
& ( X38 @ X66 )
& ( ( X63 @ X65 )
= ( X63 @ X66 ) ) )
=> ( X65 = X66 ) ) )
& ( ! [X67: $i] :
( ( X38 @ X67 )
=> ( X39 @ ( X63 @ X67 ) ) )
=> ! [X68: $i] :
( ( X39 @ X68 )
=> ? [X69: $i] :
( ( X38 @ X69 )
& ( ( X63 @ X69 )
= X68 ) ) ) ) )
& ? [X70: $i > $i] :
( ( ! [X71: $i] :
( ( X40 @ X71 )
=> ( X41 @ ( X70 @ X71 ) ) )
=> ! [X72: $i,X73: $i] :
( ( ( X40 @ X72 )
& ( X40 @ X73 )
& ( ( X70 @ X72 )
= ( X70 @ X73 ) ) )
=> ( X72 = X73 ) ) )
& ( ! [X74: $i] :
( ( X40 @ X74 )
=> ( X41 @ ( X70 @ X74 ) ) )
=> ! [X75: $i] :
( ( X41 @ X75 )
=> ? [X76: $i] :
( ( X40 @ X76 )
& ( ( X70 @ X76 )
= X75 ) ) ) ) )
& ! [X81: $i] :
( ( ( X39 @ X81 )
& ( X41 @ X81 ) )
<=> ~ $true ) )
=> ? [X77: $i > $i] :
( ! [X78: $i] :
( ( ( X38 @ X78 )
| ( X40 @ X78 ) )
=> ( ( X39 @ ( X77 @ X78 ) )
| ( X41 @ ( X77 @ X78 ) ) ) )
=> ! [X79: $i,X80: $i] :
( ( ( ( X38 @ X79 )
| ( X40 @ X79 ) )
& ( ( X38 @ X80 )
| ( X40 @ X80 ) )
& ( ( X77 @ X79 )
= ( X77 @ X80 ) ) )
=> ( X79 = X80 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22]),c_0_23]),c_0_24])]) ).
thf(c_0_26,negated_conjecture,
! [X88: $i,X89: $i,X91: $i,X95: $i,X96: $i,X98: $i,X100: $i,X101: $i > $i,X102: $i] :
( ( ( epred1_0 @ esk2_0 )
| ~ ( epred1_0 @ X88 )
| ~ ( epred1_0 @ X89 )
| ( ( esk1_0 @ X88 )
!= ( esk1_0 @ X89 ) )
| ( X88 = X89 ) )
& ( ~ ( epred2_0 @ ( esk1_0 @ esk2_0 ) )
| ~ ( epred1_0 @ X88 )
| ~ ( epred1_0 @ X89 )
| ( ( esk1_0 @ X88 )
!= ( esk1_0 @ X89 ) )
| ( X88 = X89 ) )
& ( ( epred1_0 @ ( esk4_1 @ X91 ) )
| ~ ( epred2_0 @ X91 )
| ( epred1_0 @ esk3_0 ) )
& ( ( ( esk1_0 @ ( esk4_1 @ X91 ) )
= X91 )
| ~ ( epred2_0 @ X91 )
| ( epred1_0 @ esk3_0 ) )
& ( ( epred1_0 @ ( esk4_1 @ X91 ) )
| ~ ( epred2_0 @ X91 )
| ~ ( epred2_0 @ ( esk1_0 @ esk3_0 ) ) )
& ( ( ( esk1_0 @ ( esk4_1 @ X91 ) )
= X91 )
| ~ ( epred2_0 @ X91 )
| ~ ( epred2_0 @ ( esk1_0 @ esk3_0 ) ) )
& ( ( epred3_0 @ esk6_0 )
| ~ ( epred3_0 @ X95 )
| ~ ( epred3_0 @ X96 )
| ( ( esk5_0 @ X95 )
!= ( esk5_0 @ X96 ) )
| ( X95 = X96 ) )
& ( ~ ( epred4_0 @ ( esk5_0 @ esk6_0 ) )
| ~ ( epred3_0 @ X95 )
| ~ ( epred3_0 @ X96 )
| ( ( esk5_0 @ X95 )
!= ( esk5_0 @ X96 ) )
| ( X95 = X96 ) )
& ( ( epred3_0 @ ( esk8_1 @ X98 ) )
| ~ ( epred4_0 @ X98 )
| ( epred3_0 @ esk7_0 ) )
& ( ( ( esk5_0 @ ( esk8_1 @ X98 ) )
= X98 )
| ~ ( epred4_0 @ X98 )
| ( epred3_0 @ esk7_0 ) )
& ( ( epred3_0 @ ( esk8_1 @ X98 ) )
| ~ ( epred4_0 @ X98 )
| ~ ( epred4_0 @ ( esk5_0 @ esk7_0 ) ) )
& ( ( ( esk5_0 @ ( esk8_1 @ X98 ) )
= X98 )
| ~ ( epred4_0 @ X98 )
| ~ ( epred4_0 @ ( esk5_0 @ esk7_0 ) ) )
& ( ~ ( epred2_0 @ X100 )
| ~ ( epred4_0 @ X100 )
| ~ $true )
& ( ( epred2_0 @ X100 )
| $true )
& ( ( epred4_0 @ X100 )
| $true )
& ( ~ ( epred1_0 @ X102 )
| ( epred2_0 @ ( X101 @ X102 ) )
| ( epred4_0 @ ( X101 @ X102 ) ) )
& ( ~ ( epred3_0 @ X102 )
| ( epred2_0 @ ( X101 @ X102 ) )
| ( epred4_0 @ ( X101 @ X102 ) ) )
& ( ( epred1_0 @ ( esk9_1 @ X101 ) )
| ( epred3_0 @ ( esk9_1 @ X101 ) ) )
& ( ( epred1_0 @ ( esk10_1 @ X101 ) )
| ( epred3_0 @ ( esk10_1 @ X101 ) ) )
& ( ( X101 @ ( esk9_1 @ X101 ) )
= ( X101 @ ( esk10_1 @ X101 ) ) )
& ( ( esk9_1 @ X101 )
!= ( esk10_1 @ X101 ) ) ),
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_25])])])])])]) ).
thf(c_0_27,negated_conjecture,
! [X23: $i > $i] :
( ( esk9_1 @ X23 )
!= ( esk10_1 @ X23 ) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_28,negated_conjecture,
! [X23: $i > $i] :
( ( X23 @ ( esk9_1 @ X23 ) )
= ( X23 @ ( esk10_1 @ X23 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_29,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_27,c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV420^1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.18 % Computer : n001.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 15:52:45 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.22 Running higher-order theorem proving
% 0.07/0.24 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.mHcZru8FOT/E---3.1_1407682.p
% 0.20/0.30 % Version: 3.5.1-ho
% 0.20/0.30 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.20/0.30 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.30 % Starting new_ho_9 with 1500s (5) cores
% 0.20/0.30 % Starting post_as_ho1 with 300s (1) cores
% 0.20/0.30 % Starting sh1l with 300s (1) cores
% 0.20/0.30 % Starting post_as_ho10 with 300s (1) cores
% 0.20/0.30 % post_as_ho10 with pid 1407698 completed with status 0
% 0.20/0.30 % Result found by post_as_ho10
% 0.20/0.30 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.20/0.30 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.30 % Starting new_ho_9 with 1500s (5) cores
% 0.20/0.30 % Starting post_as_ho1 with 300s (1) cores
% 0.20/0.30 % Starting sh1l with 300s (1) cores
% 0.20/0.30 % Starting post_as_ho10 with 300s (1) cores
% 0.20/0.30 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/0.30 % No SInE strategy applied
% 0.20/0.30 % Search class: HGHSF-FFSF11-SHSSMFNN
% 0.20/0.30 % partial match(1): HGHNF-FFSF11-SHSSMFNN
% 0.20/0.30 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.30 % Starting SubtermCWHack with 28s (1) cores
% 0.20/0.30 % SubtermCWHack with pid 1407704 completed with status 10
% 0.20/0.30 % Starting post_as_ho10 with 31s (1) cores
% 0.20/0.30 % post_as_ho10 with pid 1407710 completed with status 0
% 0.20/0.30 % Result found by post_as_ho10
% 0.20/0.30 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.20/0.30 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.30 % Starting new_ho_9 with 1500s (5) cores
% 0.20/0.30 % Starting post_as_ho1 with 300s (1) cores
% 0.20/0.30 % Starting sh1l with 300s (1) cores
% 0.20/0.30 % Starting post_as_ho10 with 300s (1) cores
% 0.20/0.30 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/0.30 % No SInE strategy applied
% 0.20/0.30 % Search class: HGHSF-FFSF11-SHSSMFNN
% 0.20/0.30 % partial match(1): HGHNF-FFSF11-SHSSMFNN
% 0.20/0.30 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.30 % Starting SubtermCWHack with 28s (1) cores
% 0.20/0.30 % SubtermCWHack with pid 1407704 completed with status 10
% 0.20/0.30 % Starting post_as_ho10 with 31s (1) cores
% 0.20/0.30 % Preprocessing time : 0.001 s
% 0.20/0.30 % Presaturation interreduction done
% 0.20/0.30
% 0.20/0.30 % Proof found!
% 0.20/0.30 % SZS status Theorem
% 0.20/0.30 % SZS output start CNFRefutation
% See solution above
% 0.20/0.30 % Parsed axioms : 41
% 0.20/0.30 % Removed by relevancy pruning/SinE : 0
% 0.20/0.30 % Initial clauses : 41
% 0.20/0.30 % Removed in clause preprocessing : 22
% 0.20/0.30 % Initial clauses in saturation : 19
% 0.20/0.30 % Processed clauses : 28
% 0.20/0.30 % ...of these trivial : 0
% 0.20/0.30 % ...subsumed : 0
% 0.20/0.30 % ...remaining for further processing : 28
% 0.20/0.30 % Other redundant clauses eliminated : 0
% 0.20/0.30 % Clauses deleted for lack of memory : 0
% 0.20/0.30 % Backward-subsumed : 0
% 0.20/0.30 % Backward-rewritten : 0
% 0.20/0.30 % Generated clauses : 25
% 0.20/0.30 % ...of the previous two non-redundant : 14
% 0.20/0.30 % ...aggressively subsumed : 0
% 0.20/0.30 % Contextual simplify-reflections : 0
% 0.20/0.30 % Paramodulations : 25
% 0.20/0.30 % Factorizations : 0
% 0.20/0.30 % NegExts : 0
% 0.20/0.30 % Equation resolutions : 0
% 0.20/0.30 % Disequality decompositions : 0
% 0.20/0.30 % Total rewrite steps : 0
% 0.20/0.30 % ...of those cached : 0
% 0.20/0.30 % Propositional unsat checks : 0
% 0.20/0.30 % Propositional check models : 0
% 0.20/0.30 % Propositional check unsatisfiable : 0
% 0.20/0.30 % Propositional clauses : 0
% 0.20/0.30 % Propositional clauses after purity: 0
% 0.20/0.30 % Propositional unsat core size : 0
% 0.20/0.30 % Propositional preprocessing time : 0.000
% 0.20/0.30 % Propositional encoding time : 0.000
% 0.20/0.30 % Propositional solver time : 0.000
% 0.20/0.30 % Success case prop preproc time : 0.000
% 0.20/0.30 % Success case prop encoding time : 0.000
% 0.20/0.30 % Success case prop solver time : 0.000
% 0.20/0.30 % Current number of processed clauses : 9
% 0.20/0.30 % Positive orientable unit clauses : 0
% 0.20/0.30 % Positive unorientable unit clauses: 1
% 0.20/0.30 % Negative unit clauses : 1
% 0.20/0.30 % Non-unit-clauses : 7
% 0.20/0.30 % Current number of unprocessed clauses: 10
% 0.20/0.30 % ...number of literals in the above : 38
% 0.20/0.30 % Current number of archived formulas : 0
% 0.20/0.30 % Current number of archived clauses : 19
% 0.20/0.30 % Clause-clause subsumption calls (NU) : 9
% 0.20/0.30 % Rec. Clause-clause subsumption calls : 2
% 0.20/0.30 % Non-unit clause-clause subsumptions : 0
% 0.20/0.30 % Unit Clause-clause subsumption calls : 1
% 0.20/0.30 % Rewrite failures with RHS unbound : 0
% 0.20/0.30 % BW rewrite match attempts : 118
% 0.20/0.30 % BW rewrite match successes : 0
% 0.20/0.30 % Condensation attempts : 0
% 0.20/0.30 % Condensation successes : 0
% 0.20/0.30 % Termbank termtop insertions : 5259
% 0.20/0.30 % Search garbage collected termcells : 1238
% 0.20/0.30
% 0.20/0.30 % -------------------------------------------------
% 0.20/0.30 % User time : 0.040 s
% 0.20/0.30 % System time : 0.005 s
% 0.20/0.30 % Total time : 0.045 s
% 0.20/0.30 % Maximum resident set size: 3940 pages
% 0.20/0.30
% 0.20/0.30 % -------------------------------------------------
% 0.20/0.30 % User time : 0.041 s
% 0.20/0.30 % System time : 0.010 s
% 0.20/0.30 % Total time : 0.051 s
% 0.20/0.30 % Maximum resident set size: 4864 pages
% 0.20/0.30 % E exiting
%------------------------------------------------------------------------------