%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : MSC007^1.003.004 : TPTP v9.3.1. Released v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:15:35 AM UTC 2026
% Result : Theorem 0.81s 0.52s
% Output : CNFRefutation 0.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 8
% Syntax : Number of formulae : 69 ( 27 unt; 0 typ; 0 def)
% Number of atoms : 175 ( 174 equ; 0 cnn)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 317 ( 45 ~; 112 |; 5 &; 154 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 33 ( 0 ^; 27 !; 6 ?; 33 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
hole: $tType ).
thf(decl_sort2,type,
pigeon: $tType ).
thf(decl_23,type,
hole1: hole ).
thf(decl_24,type,
hole2: hole ).
thf(decl_25,type,
hole3: hole ).
thf(decl_26,type,
pigeon1: pigeon ).
thf(decl_27,type,
pigeon2: pigeon ).
thf(decl_28,type,
pigeon3: pigeon ).
thf(decl_29,type,
pigeon4: pigeon ).
thf(decl_30,type,
pigeon_hole: pigeon > hole ).
thf(decl_31,type,
esk1_1: hole > pigeon ).
thf(sharing_a_hole,conjecture,
? [X3: pigeon,X4: pigeon] :
( ( ( pigeon_hole @ X3 )
= ( pigeon_hole @ X4 ) )
& ( X3 != X4 ) ),
file('/export/starexec/sandbox2/tmp/tmp.gKjcaghltc/E---3.1_2534243.p',sharing_a_hole) ).
thf(holecover,axiom,
! [X1: hole > $o] :
( ( ( X1 @ hole1 )
& ( X1 @ hole2 )
& ( X1 @ hole3 ) )
=> ! [X2: hole] : ( X1 @ X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.gKjcaghltc/E---3.1_2534243.p',holecover) ).
thf(pigeon1pigeon2,axiom,
pigeon1 != pigeon2,
file('/export/starexec/sandbox2/tmp/tmp.gKjcaghltc/E---3.1_2534243.p',pigeon1pigeon2) ).
thf(pigeon2pigeon4,axiom,
pigeon2 != pigeon4,
file('/export/starexec/sandbox2/tmp/tmp.gKjcaghltc/E---3.1_2534243.p',pigeon2pigeon4) ).
thf(pigeon2pigeon3,axiom,
pigeon2 != pigeon3,
file('/export/starexec/sandbox2/tmp/tmp.gKjcaghltc/E---3.1_2534243.p',pigeon2pigeon3) ).
thf(pigeon1pigeon4,axiom,
pigeon1 != pigeon4,
file('/export/starexec/sandbox2/tmp/tmp.gKjcaghltc/E---3.1_2534243.p',pigeon1pigeon4) ).
thf(pigeon1pigeon3,axiom,
pigeon1 != pigeon3,
file('/export/starexec/sandbox2/tmp/tmp.gKjcaghltc/E---3.1_2534243.p',pigeon1pigeon3) ).
thf(pigeon3pigeon4,axiom,
pigeon3 != pigeon4,
file('/export/starexec/sandbox2/tmp/tmp.gKjcaghltc/E---3.1_2534243.p',pigeon3pigeon4) ).
thf(c_0_8,negated_conjecture,
~ ? [X3: pigeon,X4: pigeon] :
( ( ( pigeon_hole @ X3 )
= ( pigeon_hole @ X4 ) )
& ( X3 != X4 ) ),
inference(assume_negation,[status(cth)],[sharing_a_hole]) ).
thf(c_0_9,negated_conjecture,
~ ? [X3: pigeon,X4: pigeon] :
( ( ( pigeon_hole @ X3 )
= ( pigeon_hole @ X4 ) )
& ( X3 != X4 ) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
thf(c_0_10,negated_conjecture,
! [X11: pigeon,X12: pigeon] :
( ( ( pigeon_hole @ X11 )
!= ( pigeon_hole @ X12 ) )
| ( X11 = X12 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
thf(c_0_11,plain,
! [X9: hole > $o,X10: hole] :
( ~ ( X9 @ hole1 )
| ~ ( X9 @ hole2 )
| ~ ( X9 @ hole3 )
| ( X9 @ X10 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[holecover])])])]) ).
thf(c_0_12,negated_conjecture,
! [X3: pigeon,X4: pigeon] :
( ( X3 = X4 )
| ( ( pigeon_hole @ X3 )
!= ( pigeon_hole @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_13,plain,
! [X2: hole,X1: hole > $o] :
( ( X1 @ X2 )
| ~ ( X1 @ hole1 )
| ~ ( X1 @ hole2 )
| ~ ( X1 @ hole3 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_14,negated_conjecture,
! [X3: pigeon] :
( ( esk1_1 @ ( pigeon_hole @ X3 ) )
= X3 ),
inference(recognize_injectivity,[status(thm)],[c_0_12]) ).
thf(c_0_15,plain,
! [X2: hole] :
( ( hole3 = X2 )
| ( hole2 = X2 )
| ( hole1 = X2 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_13]) ).
thf(c_0_16,negated_conjecture,
! [X3: pigeon] :
( ( hole1
= ( pigeon_hole @ X3 ) )
| ( hole2
= ( pigeon_hole @ X3 ) )
| ( ( esk1_1 @ hole3 )
= X3 ) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_17,plain,
pigeon1 != pigeon2,
inference(fof_simplification,[status(thm)],[pigeon1pigeon2]) ).
thf(c_0_18,plain,
pigeon2 != pigeon4,
inference(fof_simplification,[status(thm)],[pigeon2pigeon4]) ).
thf(c_0_19,negated_conjecture,
! [X3: pigeon] :
( ( ( esk1_1 @ hole3 )
= X3 )
| ( hole1
= ( pigeon_hole @ X3 ) )
| ( ( esk1_1 @ hole2 )
= X3 ) ),
inference(spm,[status(thm)],[c_0_14,c_0_16]) ).
thf(c_0_20,plain,
pigeon2 != pigeon3,
inference(fof_simplification,[status(thm)],[pigeon2pigeon3]) ).
thf(c_0_21,plain,
pigeon1 != pigeon4,
inference(fof_simplification,[status(thm)],[pigeon1pigeon4]) ).
thf(c_0_22,plain,
pigeon1 != pigeon2,
inference(fof_nnf,[status(thm)],[c_0_17]) ).
thf(c_0_23,plain,
pigeon2 != pigeon4,
inference(fof_nnf,[status(thm)],[c_0_18]) ).
thf(c_0_24,negated_conjecture,
! [X3: pigeon] :
( ( ( esk1_1 @ hole2 )
= X3 )
| ( ( esk1_1 @ hole3 )
= X3 )
| ( ( esk1_1 @ hole1 )
= X3 ) ),
inference(spm,[status(thm)],[c_0_14,c_0_19]) ).
thf(c_0_25,plain,
pigeon1 != pigeon3,
inference(fof_simplification,[status(thm)],[pigeon1pigeon3]) ).
thf(c_0_26,plain,
pigeon2 != pigeon3,
inference(fof_nnf,[status(thm)],[c_0_20]) ).
thf(c_0_27,plain,
pigeon3 != pigeon4,
inference(fof_simplification,[status(thm)],[pigeon3pigeon4]) ).
thf(c_0_28,plain,
pigeon1 != pigeon4,
inference(fof_nnf,[status(thm)],[c_0_21]) ).
thf(c_0_29,plain,
pigeon1 != pigeon2,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_30,negated_conjecture,
! [X3: pigeon,X2: hole] :
( ( ( esk1_1 @ hole2 )
= X3 )
| ( hole1
= ( pigeon_hole @ X3 ) )
| ( ( esk1_1 @ X2 )
= X3 )
| ( hole1 = X2 )
| ( hole2 = X2 ) ),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
thf(c_0_31,plain,
pigeon2 != pigeon4,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_32,negated_conjecture,
! [X3: pigeon,X2: hole] :
( ( ( esk1_1 @ hole1 )
= X3 )
| ( ( esk1_1 @ hole2 )
= X3 )
| ( ( esk1_1 @ X2 )
= X3 )
| ( hole1 = X2 )
| ( hole2 = X2 ) ),
inference(spm,[status(thm)],[c_0_24,c_0_15]) ).
thf(c_0_33,plain,
pigeon1 != pigeon3,
inference(fof_nnf,[status(thm)],[c_0_25]) ).
thf(c_0_34,plain,
pigeon2 != pigeon3,
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_35,plain,
pigeon3 != pigeon4,
inference(fof_nnf,[status(thm)],[c_0_27]) ).
thf(c_0_36,plain,
pigeon1 != pigeon4,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_37,negated_conjecture,
! [X2: hole] :
( ( hole1
= ( pigeon_hole @ pigeon1 ) )
| ( ( esk1_1 @ hole2 )
= pigeon1 )
| ( hole2 = X2 )
| ( hole1 = X2 )
| ( ( esk1_1 @ X2 )
!= pigeon2 ) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
thf(c_0_38,negated_conjecture,
! [X2: hole] :
( ( ( esk1_1 @ hole2 )
= pigeon4 )
| ( ( esk1_1 @ hole1 )
= pigeon4 )
| ( hole2 = X2 )
| ( hole1 = X2 )
| ( ( esk1_1 @ X2 )
!= pigeon2 ) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
thf(c_0_39,plain,
pigeon1 != pigeon3,
inference(split_conjunct,[status(thm)],[c_0_33]) ).
thf(c_0_40,negated_conjecture,
! [X2: hole] :
( ( ( esk1_1 @ hole2 )
= pigeon3 )
| ( ( esk1_1 @ hole1 )
= pigeon3 )
| ( hole2 = X2 )
| ( hole1 = X2 )
| ( ( esk1_1 @ X2 )
!= pigeon2 ) ),
inference(spm,[status(thm)],[c_0_34,c_0_32]) ).
thf(c_0_41,plain,
pigeon3 != pigeon4,
inference(split_conjunct,[status(thm)],[c_0_35]) ).
thf(c_0_42,negated_conjecture,
! [X2: hole] :
( ( hole1
= ( pigeon_hole @ pigeon3 ) )
| ( ( esk1_1 @ hole2 )
= pigeon3 )
| ( hole2 = X2 )
| ( hole1 = X2 )
| ( ( esk1_1 @ X2 )
!= pigeon2 ) ),
inference(spm,[status(thm)],[c_0_34,c_0_30]) ).
thf(c_0_43,negated_conjecture,
! [X2: hole] :
( ( ( esk1_1 @ hole2 )
= pigeon4 )
| ( ( esk1_1 @ hole1 )
= pigeon4 )
| ( hole2 = X2 )
| ( hole1 = X2 )
| ( ( esk1_1 @ X2 )
!= pigeon1 ) ),
inference(spm,[status(thm)],[c_0_36,c_0_32]) ).
thf(c_0_44,negated_conjecture,
( ( hole1
= ( pigeon_hole @ pigeon2 ) )
| ( hole2
= ( pigeon_hole @ pigeon2 ) )
| ( ( esk1_1 @ hole2 )
= pigeon1 )
| ( hole1
= ( pigeon_hole @ pigeon1 ) ) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_14])]) ).
thf(c_0_45,negated_conjecture,
( ( hole1
= ( pigeon_hole @ pigeon2 ) )
| ( hole2
= ( pigeon_hole @ pigeon2 ) )
| ( ( esk1_1 @ hole1 )
= pigeon4 )
| ( ( esk1_1 @ hole2 )
= pigeon4 ) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_14])]) ).
thf(c_0_46,negated_conjecture,
! [X2: hole] :
( ( ( esk1_1 @ hole2 )
= pigeon3 )
| ( ( esk1_1 @ hole1 )
= pigeon3 )
| ( hole2 = X2 )
| ( hole1 = X2 )
| ( ( esk1_1 @ X2 )
!= pigeon1 ) ),
inference(spm,[status(thm)],[c_0_39,c_0_32]) ).
thf(c_0_47,negated_conjecture,
( ( hole1
= ( pigeon_hole @ pigeon2 ) )
| ( hole2
= ( pigeon_hole @ pigeon2 ) )
| ( ( esk1_1 @ hole1 )
= pigeon3 )
| ( ( esk1_1 @ hole2 )
= pigeon3 ) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_14])]) ).
thf(c_0_48,negated_conjecture,
! [X2: hole] :
( ( hole1
= ( pigeon_hole @ pigeon3 ) )
| ( ( esk1_1 @ hole2 )
= pigeon3 )
| ( hole2 = X2 )
| ( hole1 = X2 )
| ( ( esk1_1 @ X2 )
!= pigeon1 ) ),
inference(spm,[status(thm)],[c_0_39,c_0_30]) ).
thf(c_0_49,negated_conjecture,
! [X2: hole] :
( ( ( esk1_1 @ hole2 )
= pigeon4 )
| ( ( esk1_1 @ hole1 )
= pigeon4 )
| ( hole2 = X2 )
| ( hole1 = X2 )
| ( ( esk1_1 @ X2 )
!= pigeon3 ) ),
inference(spm,[status(thm)],[c_0_41,c_0_32]) ).
thf(c_0_50,negated_conjecture,
( ( hole1
= ( pigeon_hole @ pigeon2 ) )
| ( hole2
= ( pigeon_hole @ pigeon2 ) )
| ( ( esk1_1 @ hole2 )
= pigeon3 )
| ( hole1
= ( pigeon_hole @ pigeon3 ) ) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_14])]) ).
thf(c_0_51,negated_conjecture,
( ( hole1
= ( pigeon_hole @ pigeon1 ) )
| ( hole2
= ( pigeon_hole @ pigeon1 ) )
| ( ( esk1_1 @ hole1 )
= pigeon4 )
| ( ( esk1_1 @ hole2 )
= pigeon4 ) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_14])]) ).
thf(c_0_52,negated_conjecture,
( ( ( esk1_1 @ hole1 )
= pigeon4 )
| ( hole1
= ( pigeon_hole @ pigeon1 ) )
| ( hole2
= ( pigeon_hole @ pigeon2 ) )
| ( hole1
= ( pigeon_hole @ pigeon2 ) ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_36]) ).
thf(c_0_53,negated_conjecture,
( ( hole1
= ( pigeon_hole @ pigeon1 ) )
| ( hole2
= ( pigeon_hole @ pigeon1 ) )
| ( ( esk1_1 @ hole1 )
= pigeon3 )
| ( ( esk1_1 @ hole2 )
= pigeon3 ) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_14])]) ).
thf(c_0_54,negated_conjecture,
( ( ( esk1_1 @ hole1 )
= pigeon3 )
| ( hole1
= ( pigeon_hole @ pigeon1 ) )
| ( hole2
= ( pigeon_hole @ pigeon2 ) )
| ( hole1
= ( pigeon_hole @ pigeon2 ) ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_47]),c_0_39]) ).
thf(c_0_55,negated_conjecture,
( ( hole1
= ( pigeon_hole @ pigeon1 ) )
| ( hole2
= ( pigeon_hole @ pigeon1 ) )
| ( ( esk1_1 @ hole2 )
= pigeon3 )
| ( hole1
= ( pigeon_hole @ pigeon3 ) ) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_14])]) ).
thf(c_0_56,negated_conjecture,
( ( hole1
= ( pigeon_hole @ pigeon3 ) )
| ( hole2
= ( pigeon_hole @ pigeon3 ) )
| ( ( esk1_1 @ hole1 )
= pigeon4 )
| ( ( esk1_1 @ hole2 )
= pigeon4 ) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_14])]) ).
thf(c_0_57,negated_conjecture,
( ( ( esk1_1 @ hole1 )
= pigeon4 )
| ( hole1
= ( pigeon_hole @ pigeon3 ) )
| ( hole2
= ( pigeon_hole @ pigeon2 ) )
| ( hole1
= ( pigeon_hole @ pigeon2 ) ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_45]),c_0_41]) ).
thf(c_0_58,negated_conjecture,
( ( ( pigeon_hole @ pigeon1 )
= ( pigeon_hole @ pigeon2 ) )
| ( hole1
= ( pigeon_hole @ pigeon2 ) )
| ( ( esk1_1 @ hole1 )
= pigeon4 )
| ( hole1
= ( pigeon_hole @ pigeon1 ) ) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_14]),c_0_31]) ).
thf(c_0_59,negated_conjecture,
( ( ( pigeon_hole @ pigeon1 )
= ( pigeon_hole @ pigeon2 ) )
| ( hole1
= ( pigeon_hole @ pigeon2 ) )
| ( ( esk1_1 @ hole1 )
= pigeon3 )
| ( hole1
= ( pigeon_hole @ pigeon1 ) ) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_14]),c_0_34]) ).
thf(c_0_60,negated_conjecture,
( ( ( esk1_1 @ hole1 )
= pigeon4 )
| ( hole1
= ( pigeon_hole @ pigeon3 ) )
| ( hole2
= ( pigeon_hole @ pigeon1 ) )
| ( hole1
= ( pigeon_hole @ pigeon1 ) ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_51]),c_0_41]) ).
thf(c_0_61,negated_conjecture,
( ( ( pigeon_hole @ pigeon3 )
= ( pigeon_hole @ pigeon2 ) )
| ( hole1
= ( pigeon_hole @ pigeon2 ) )
| ( ( esk1_1 @ hole1 )
= pigeon4 )
| ( hole1
= ( pigeon_hole @ pigeon3 ) ) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_14]),c_0_31]) ).
thf(c_0_62,negated_conjecture,
( ( ( pigeon_hole @ pigeon1 )
= ( pigeon_hole @ pigeon2 ) )
| ( hole1
= ( pigeon_hole @ pigeon1 ) )
| ( hole1
= ( pigeon_hole @ pigeon2 ) ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_41]) ).
thf(c_0_63,negated_conjecture,
( ( ( pigeon_hole @ pigeon3 )
= ( pigeon_hole @ pigeon1 ) )
| ( hole1
= ( pigeon_hole @ pigeon1 ) )
| ( ( esk1_1 @ hole1 )
= pigeon4 )
| ( hole1
= ( pigeon_hole @ pigeon3 ) ) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_60]),c_0_14]),c_0_36]) ).
thf(c_0_64,negated_conjecture,
( ( ( pigeon_hole @ pigeon3 )
= ( pigeon_hole @ pigeon1 ) )
| ( ( pigeon_hole @ pigeon1 )
= ( pigeon_hole @ pigeon2 ) )
| ( ( pigeon_hole @ pigeon3 )
= ( pigeon_hole @ pigeon2 ) )
| ( hole1
= ( pigeon_hole @ pigeon2 ) ) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_14]),c_0_36]) ).
thf(c_0_65,negated_conjecture,
( ( ( pigeon_hole @ pigeon3 )
= ( pigeon_hole @ pigeon2 ) )
| ( ( pigeon_hole @ pigeon1 )
= ( pigeon_hole @ pigeon2 ) )
| ( ( pigeon_hole @ pigeon3 )
= ( pigeon_hole @ pigeon1 ) ) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_14]),c_0_31]) ).
thf(c_0_66,negated_conjecture,
( ( ( pigeon_hole @ pigeon1 )
= ( pigeon_hole @ pigeon2 ) )
| ( ( pigeon_hole @ pigeon3 )
= ( pigeon_hole @ pigeon2 ) ) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_65]),c_0_14]),c_0_39]) ).
thf(c_0_67,negated_conjecture,
( ( pigeon_hole @ pigeon1 )
= ( pigeon_hole @ pigeon2 ) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_66]),c_0_14]),c_0_34]) ).
thf(c_0_68,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_67]),c_0_14]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MSC007^1.003.004 : TPTP v9.3.1. Released v5.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 % Computer : n014.cluster.edu
% 0.08/0.21 % Model : x86_64 x86_64
% 0.08/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.21 % Memory : 8046.5625MB
% 0.08/0.21 % OS : Linux 6.8.0-71-generic
% 0.08/0.21 % CPULimit : 300
% 0.08/0.21 % WCLimit : 300
% 0.08/0.21 % DateTime : Tue Sep 29 11:21:06 UTC 2026
% 0.08/0.21 % CPUTime :
% 0.08/0.21 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.25 Running higher-order theorem proving
% 0.08/0.27 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.gKjcaghltc/E---3.1_2534243.p
% 0.81/0.52 % Version: 3.5.1-ho
% 0.81/0.52 % Preprocessing class: HSSSSMSSSSSNSFA.
% 0.81/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.81/0.52 % Starting new_ho_14 with 1500s (5) cores
% 0.81/0.52 % Starting full_lambda_8 with 300s (1) cores
% 0.81/0.52 % Starting new_ho_13 with 300s (1) cores
% 0.81/0.52 % Starting ho_unfolding_3 with 300s (1) cores
% 0.81/0.52 % new_ho_14 with pid 2534256 completed with status 9
% 0.81/0.52 % ho_unfolding_3 with pid 2534259 completed with status 0
% 0.81/0.52 % Result found by ho_unfolding_3
% 0.81/0.52 % Preprocessing class: HSSSSMSSSSSNSFA.
% 0.81/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.81/0.52 % Starting new_ho_14 with 1500s (5) cores
% 0.81/0.52 % Starting full_lambda_8 with 300s (1) cores
% 0.81/0.52 % Starting new_ho_13 with 300s (1) cores
% 0.81/0.52 % Starting ho_unfolding_3 with 300s (1) cores
% 0.81/0.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.81/0.52 % No SInE strategy applied
% 0.81/0.52 % Search class: HHUSF-FFSF11-SSFFFSBN
% 0.81/0.52 % partial match(1): HGUSF-FFSF11-SSFFFSBN
% 0.81/0.52 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.81/0.52 % Starting SubtermCWHack with 28s (1) cores
% 0.81/0.52 % SubtermCWHack with pid 2534267 completed with status 10
% 0.81/0.52 % Starting ho_unfolding_3 with 31s (1) cores
% 0.81/0.52 % ho_unfolding_3 with pid 2534271 completed with status 0
% 0.81/0.52 % Result found by ho_unfolding_3
% 0.81/0.52 % Preprocessing class: HSSSSMSSSSSNSFA.
% 0.81/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.81/0.52 % Starting new_ho_14 with 1500s (5) cores
% 0.81/0.52 % Starting full_lambda_8 with 300s (1) cores
% 0.81/0.52 % Starting new_ho_13 with 300s (1) cores
% 0.81/0.52 % Starting ho_unfolding_3 with 300s (1) cores
% 0.81/0.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.81/0.52 % No SInE strategy applied
% 0.81/0.52 % Search class: HHUSF-FFSF11-SSFFFSBN
% 0.81/0.52 % partial match(1): HGUSF-FFSF11-SSFFFSBN
% 0.81/0.52 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.81/0.52 % Starting SubtermCWHack with 28s (1) cores
% 0.81/0.52 % SubtermCWHack with pid 2534267 completed with status 10
% 0.81/0.52 % Starting ho_unfolding_3 with 31s (1) cores
% 0.81/0.52 % Preprocessing time : 0.001 s
% 0.81/0.52 % Presaturation interreduction done
% 0.81/0.52
% 0.81/0.52 % Proof found!
% 0.81/0.52 % SZS status Theorem
% 0.81/0.52 % SZS output start CNFRefutation
% See solution above
% 0.81/0.52 % Parsed axioms : 18
% 0.81/0.52 % Removed by relevancy pruning/SinE : 0
% 0.81/0.52 % Initial clauses : 18
% 0.81/0.52 % Removed in clause preprocessing : 10
% 0.81/0.52 % Initial clauses in saturation : 8
% 0.81/0.52 % Processed clauses : 305
% 0.81/0.52 % ...of these trivial : 0
% 0.81/0.52 % ...subsumed : 126
% 0.81/0.52 % ...remaining for further processing : 179
% 0.81/0.52 % Other redundant clauses eliminated : 732
% 0.81/0.52 % Clauses deleted for lack of memory : 0
% 0.81/0.52 % Backward-subsumed : 19
% 0.81/0.52 % Backward-rewritten : 46
% 0.81/0.52 % Generated clauses : 6843
% 0.81/0.52 % ...of the previous two non-redundant : 5145
% 0.81/0.52 % ...aggressively subsumed : 0
% 0.81/0.52 % Contextual simplify-reflections : 10
% 0.81/0.52 % Paramodulations : 5778
% 0.81/0.52 % Factorizations : 322
% 0.81/0.52 % NegExts : 0
% 0.81/0.52 % Equation resolutions : 738
% 0.81/0.52 % Disequality decompositions : 0
% 0.81/0.52 % Total rewrite steps : 2003
% 0.81/0.52 % ...of those cached : 1990
% 0.81/0.52 % Propositional unsat checks : 0
% 0.81/0.52 % Propositional check models : 0
% 0.81/0.52 % Propositional check unsatisfiable : 0
% 0.81/0.52 % Propositional clauses : 0
% 0.81/0.52 % Propositional clauses after purity: 0
% 0.81/0.52 % Propositional unsat core size : 0
% 0.81/0.52 % Propositional preprocessing time : 0.000
% 0.81/0.52 % Propositional encoding time : 0.000
% 0.81/0.52 % Propositional solver time : 0.000
% 0.81/0.52 % Success case prop preproc time : 0.000
% 0.81/0.52 % Success case prop encoding time : 0.000
% 0.81/0.52 % Success case prop solver time : 0.000
% 0.81/0.52 % Current number of processed clauses : 106
% 0.81/0.52 % Positive orientable unit clauses : 2
% 0.81/0.52 % Positive unorientable unit clauses: 0
% 0.81/0.52 % Negative unit clauses : 6
% 0.81/0.52 % Non-unit-clauses : 98
% 0.81/0.52 % Current number of unprocessed clauses: 4811
% 0.81/0.52 % ...number of literals in the above : 36849
% 0.81/0.52 % Current number of archived formulas : 0
% 0.81/0.52 % Current number of archived clauses : 73
% 0.81/0.52 % Clause-clause subsumption calls (NU) : 18548
% 0.81/0.52 % Rec. Clause-clause subsumption calls : 487
% 0.81/0.52 % Non-unit clause-clause subsumptions : 159
% 0.81/0.52 % Unit Clause-clause subsumption calls : 99
% 0.81/0.52 % Rewrite failures with RHS unbound : 0
% 0.81/0.52 % BW rewrite match attempts : 1
% 0.81/0.52 % BW rewrite match successes : 1
% 0.81/0.52 % Condensation attempts : 305
% 0.81/0.52 % Condensation successes : 4
% 0.81/0.52 % Termbank termtop insertions : 83782
% 0.81/0.52 % Search garbage collected termcells : 105
% 0.81/0.52
% 0.81/0.52 % -------------------------------------------------
% 0.81/0.52 % User time : 0.231 s
% 0.81/0.52 % System time : 0.008 s
% 0.81/0.52 % Total time : 0.239 s
% 0.81/0.52 % Maximum resident set size: 3640 pages
% 0.81/0.52
% 0.81/0.52 % -------------------------------------------------
% 0.81/0.52 % User time : 0.247 s
% 0.81/0.52 % System time : 0.027 s
% 0.81/0.52 % Total time : 0.274 s
% 0.81/0.52 % Maximum resident set size: 4864 pages
% 0.81/0.52 % E exiting
%------------------------------------------------------------------------------