TSTP Solution File: MSC007^1.003.004 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : MSC007^1.003.004 : TPTP v8.2.0. Released v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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 00:45:14 EDT 2024
% Result : Theorem 0.76s 0.66s
% Output : CNFRefutation 0.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 19
% Syntax : Number of formulae : 79 ( 27 unt; 11 typ; 0 def)
% Number of atoms : 173 ( 172 equ; 0 cnn)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 312 ( 43 ~; 112 |; 4 &; 152 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 31 ( 0 ^ 27 !; 4 ?; 31 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
hole: $tType ).
thf(decl_sort2,type,
pigeon: $tType ).
thf(decl_22,type,
hole1: hole ).
thf(decl_23,type,
hole2: hole ).
thf(decl_24,type,
hole3: hole ).
thf(decl_25,type,
pigeon1: pigeon ).
thf(decl_26,type,
pigeon2: pigeon ).
thf(decl_27,type,
pigeon3: pigeon ).
thf(decl_28,type,
pigeon4: pigeon ).
thf(decl_29,type,
pigeon_hole: pigeon > hole ).
thf(decl_30,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/sandbox/benchmark/theBenchmark.p',sharing_a_hole) ).
thf(holecover,axiom,
! [X1: hole > $o] :
( ( ( X1 @ hole1 )
& ( X1 @ hole2 )
& ( X1 @ hole3 ) )
=> ! [X2: hole] : ( X1 @ X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',holecover) ).
thf(pigeon1pigeon2,axiom,
pigeon1 != pigeon2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pigeon1pigeon2) ).
thf(pigeon2pigeon4,axiom,
pigeon2 != pigeon4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pigeon2pigeon4) ).
thf(pigeon2pigeon3,axiom,
pigeon2 != pigeon3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pigeon2pigeon3) ).
thf(pigeon1pigeon4,axiom,
pigeon1 != pigeon4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pigeon1pigeon4) ).
thf(pigeon1pigeon3,axiom,
pigeon1 != pigeon3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pigeon1pigeon3) ).
thf(pigeon3pigeon4,axiom,
pigeon3 != pigeon4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pigeon3pigeon4) ).
thf(c_0_8,negated_conjecture,
~ ? [X3: pigeon,X4: pigeon] :
( ( ( pigeon_hole @ X3 )
= ( pigeon_hole @ X4 ) )
& ( X3 != X4 ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[sharing_a_hole])]) ).
thf(c_0_9,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_8])])]) ).
thf(c_0_10,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_11,negated_conjecture,
! [X3: pigeon,X4: pigeon] :
( ( X3 = X4 )
| ( ( pigeon_hole @ X3 )
!= ( pigeon_hole @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_12,plain,
! [X2: hole,X1: hole > $o] :
( ( X1 @ X2 )
| ~ ( X1 @ hole1 )
| ~ ( X1 @ hole2 )
| ~ ( X1 @ hole3 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_13,negated_conjecture,
! [X3: pigeon] :
( ( esk1_1 @ ( pigeon_hole @ X3 ) )
= X3 ),
inference(recognize_injectivity,[status(thm)],[c_0_11]) ).
thf(c_0_14,plain,
! [X2: hole] :
( ( hole3 = X2 )
| ( hole2 = X2 )
| ( hole1 = X2 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_12]) ).
thf(c_0_15,negated_conjecture,
! [X3: pigeon] :
( ( hole1
= ( pigeon_hole @ X3 ) )
| ( hole2
= ( pigeon_hole @ X3 ) )
| ( ( esk1_1 @ hole3 )
= X3 ) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_16,plain,
pigeon1 != pigeon2,
inference(fof_simplification,[status(thm)],[pigeon1pigeon2]) ).
thf(c_0_17,plain,
pigeon2 != pigeon4,
inference(fof_simplification,[status(thm)],[pigeon2pigeon4]) ).
thf(c_0_18,negated_conjecture,
! [X3: pigeon] :
( ( ( esk1_1 @ hole3 )
= X3 )
| ( hole1
= ( pigeon_hole @ X3 ) )
| ( ( esk1_1 @ hole2 )
= X3 ) ),
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
thf(c_0_19,plain,
pigeon2 != pigeon3,
inference(fof_simplification,[status(thm)],[pigeon2pigeon3]) ).
thf(c_0_20,plain,
pigeon1 != pigeon4,
inference(fof_simplification,[status(thm)],[pigeon1pigeon4]) ).
thf(c_0_21,plain,
pigeon1 != pigeon2,
inference(fof_nnf,[status(thm)],[c_0_16]) ).
thf(c_0_22,plain,
pigeon2 != pigeon4,
inference(fof_nnf,[status(thm)],[c_0_17]) ).
thf(c_0_23,negated_conjecture,
! [X3: pigeon] :
( ( ( esk1_1 @ hole2 )
= X3 )
| ( ( esk1_1 @ hole3 )
= X3 )
| ( ( esk1_1 @ hole1 )
= X3 ) ),
inference(spm,[status(thm)],[c_0_13,c_0_18]) ).
thf(c_0_24,plain,
pigeon1 != pigeon3,
inference(fof_simplification,[status(thm)],[pigeon1pigeon3]) ).
thf(c_0_25,plain,
pigeon2 != pigeon3,
inference(fof_nnf,[status(thm)],[c_0_19]) ).
thf(c_0_26,plain,
pigeon3 != pigeon4,
inference(fof_simplification,[status(thm)],[pigeon3pigeon4]) ).
thf(c_0_27,plain,
pigeon1 != pigeon4,
inference(fof_nnf,[status(thm)],[c_0_20]) ).
thf(c_0_28,plain,
pigeon1 != pigeon2,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_29,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_18,c_0_14]) ).
thf(c_0_30,plain,
pigeon2 != pigeon4,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_31,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_23,c_0_14]) ).
thf(c_0_32,plain,
pigeon1 != pigeon3,
inference(fof_nnf,[status(thm)],[c_0_24]) ).
thf(c_0_33,plain,
pigeon2 != pigeon3,
inference(split_conjunct,[status(thm)],[c_0_25]) ).
thf(c_0_34,plain,
pigeon3 != pigeon4,
inference(fof_nnf,[status(thm)],[c_0_26]) ).
thf(c_0_35,plain,
pigeon1 != pigeon4,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_36,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_28,c_0_29]) ).
thf(c_0_37,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_30,c_0_31]) ).
thf(c_0_38,plain,
pigeon1 != pigeon3,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
thf(c_0_39,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_33,c_0_31]) ).
thf(c_0_40,plain,
pigeon3 != pigeon4,
inference(split_conjunct,[status(thm)],[c_0_34]) ).
thf(c_0_41,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_33,c_0_29]) ).
thf(c_0_42,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_35,c_0_31]) ).
thf(c_0_43,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_36,c_0_13])]) ).
thf(c_0_44,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_37,c_0_13])]) ).
thf(c_0_45,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_38,c_0_31]) ).
thf(c_0_46,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_39,c_0_13])]) ).
thf(c_0_47,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_38,c_0_29]) ).
thf(c_0_48,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_40,c_0_31]) ).
thf(c_0_49,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_41,c_0_13])]) ).
thf(c_0_50,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_42,c_0_13])]) ).
thf(c_0_51,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_43,c_0_44]),c_0_35]) ).
thf(c_0_52,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_45,c_0_13])]) ).
thf(c_0_53,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_43,c_0_46]),c_0_38]) ).
thf(c_0_54,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_47,c_0_13])]) ).
thf(c_0_55,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_48,c_0_13])]) ).
thf(c_0_56,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_49,c_0_44]),c_0_40]) ).
thf(c_0_57,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_50,c_0_51]),c_0_13]),c_0_30]) ).
thf(c_0_58,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_52,c_0_53]),c_0_13]),c_0_33]) ).
thf(c_0_59,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_54,c_0_50]),c_0_40]) ).
thf(c_0_60,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_55,c_0_56]),c_0_13]),c_0_30]) ).
thf(c_0_61,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_57,c_0_58]),c_0_40]) ).
thf(c_0_62,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_55,c_0_59]),c_0_13]),c_0_35]) ).
thf(c_0_63,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_60,c_0_61]),c_0_13]),c_0_35]) ).
thf(c_0_64,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_62,c_0_63]),c_0_13]),c_0_30]) ).
thf(c_0_65,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_13,c_0_64]),c_0_13]),c_0_38]) ).
thf(c_0_66,negated_conjecture,
( ( pigeon_hole @ pigeon1 )
= ( pigeon_hole @ pigeon2 ) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_65]),c_0_13]),c_0_33]) ).
thf(c_0_67,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_66]),c_0_13]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MSC007^1.003.004 : TPTP v8.2.0. Released v5.4.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 22:59:52 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running higher-order theorem proving
% 0.19/0.47 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.76/0.66 # Version: 3.1.0-ho
% 0.76/0.66 # Preprocessing class: HSSSSMSSSSSNSFA.
% 0.76/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.76/0.66 # Starting new_ho_14 with 1500s (5) cores
% 0.76/0.66 # Starting full_lambda_8 with 300s (1) cores
% 0.76/0.66 # Starting new_ho_13 with 300s (1) cores
% 0.76/0.66 # Starting ho_unfolding_3 with 300s (1) cores
% 0.76/0.66 # new_ho_14 with pid 4453 completed with status 8
% 0.76/0.66 # ho_unfolding_3 with pid 4456 completed with status 0
% 0.76/0.66 # Result found by ho_unfolding_3
% 0.76/0.66 # Preprocessing class: HSSSSMSSSSSNSFA.
% 0.76/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.76/0.66 # Starting new_ho_14 with 1500s (5) cores
% 0.76/0.66 # Starting full_lambda_8 with 300s (1) cores
% 0.76/0.66 # Starting new_ho_13 with 300s (1) cores
% 0.76/0.66 # Starting ho_unfolding_3 with 300s (1) cores
% 0.76/0.66 # No SInE strategy applied
% 0.76/0.66 # Search class: HHUSF-FFSF11-SSFFFSBN
% 0.76/0.66 # partial match(1): HGUSF-FFSF11-SSFFFSBN
% 0.76/0.66 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.76/0.66 # Starting new_ho_14 with 163s (1) cores
% 0.76/0.66 # new_ho_14 with pid 4463 completed with status 9
% 0.76/0.66 # Starting ho_unfolding_3 with 31s (1) cores
% 0.76/0.66 # ho_unfolding_3 with pid 4473 completed with status 0
% 0.76/0.66 # Result found by ho_unfolding_3
% 0.76/0.66 # Preprocessing class: HSSSSMSSSSSNSFA.
% 0.76/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.76/0.66 # Starting new_ho_14 with 1500s (5) cores
% 0.76/0.66 # Starting full_lambda_8 with 300s (1) cores
% 0.76/0.66 # Starting new_ho_13 with 300s (1) cores
% 0.76/0.66 # Starting ho_unfolding_3 with 300s (1) cores
% 0.76/0.66 # No SInE strategy applied
% 0.76/0.66 # Search class: HHUSF-FFSF11-SSFFFSBN
% 0.76/0.66 # partial match(1): HGUSF-FFSF11-SSFFFSBN
% 0.76/0.66 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.76/0.66 # Starting new_ho_14 with 163s (1) cores
% 0.76/0.66 # new_ho_14 with pid 4463 completed with status 9
% 0.76/0.66 # Starting ho_unfolding_3 with 31s (1) cores
% 0.76/0.66 # Preprocessing time : 0.001 s
% 0.76/0.66 # Presaturation interreduction done
% 0.76/0.66
% 0.76/0.66 # Proof found!
% 0.76/0.66 # SZS status Theorem
% 0.76/0.66 # SZS output start CNFRefutation
% See solution above
% 0.76/0.66 # Parsed axioms : 18
% 0.76/0.66 # Removed by relevancy pruning/SinE : 0
% 0.76/0.66 # Initial clauses : 18
% 0.76/0.66 # Removed in clause preprocessing : 10
% 0.76/0.66 # Initial clauses in saturation : 8
% 0.76/0.66 # Processed clauses : 305
% 0.76/0.66 # ...of these trivial : 0
% 0.76/0.66 # ...subsumed : 126
% 0.76/0.66 # ...remaining for further processing : 179
% 0.76/0.66 # Other redundant clauses eliminated : 732
% 0.76/0.66 # Clauses deleted for lack of memory : 0
% 0.76/0.66 # Backward-subsumed : 19
% 0.76/0.66 # Backward-rewritten : 46
% 0.76/0.66 # Generated clauses : 6843
% 0.76/0.66 # ...of the previous two non-redundant : 5145
% 0.76/0.66 # ...aggressively subsumed : 0
% 0.76/0.66 # Contextual simplify-reflections : 10
% 0.76/0.66 # Paramodulations : 5778
% 0.76/0.66 # Factorizations : 322
% 0.76/0.66 # NegExts : 0
% 0.76/0.66 # Equation resolutions : 738
% 0.76/0.66 # Disequality decompositions : 0
% 0.76/0.66 # Total rewrite steps : 2003
% 0.76/0.66 # ...of those cached : 1990
% 0.76/0.66 # Propositional unsat checks : 0
% 0.76/0.66 # Propositional check models : 0
% 0.76/0.66 # Propositional check unsatisfiable : 0
% 0.76/0.66 # Propositional clauses : 0
% 0.76/0.66 # Propositional clauses after purity: 0
% 0.76/0.66 # Propositional unsat core size : 0
% 0.76/0.66 # Propositional preprocessing time : 0.000
% 0.76/0.66 # Propositional encoding time : 0.000
% 0.76/0.66 # Propositional solver time : 0.000
% 0.76/0.66 # Success case prop preproc time : 0.000
% 0.76/0.66 # Success case prop encoding time : 0.000
% 0.76/0.66 # Success case prop solver time : 0.000
% 0.76/0.66 # Current number of processed clauses : 106
% 0.76/0.66 # Positive orientable unit clauses : 2
% 0.76/0.66 # Positive unorientable unit clauses: 0
% 0.76/0.66 # Negative unit clauses : 6
% 0.76/0.66 # Non-unit-clauses : 98
% 0.76/0.66 # Current number of unprocessed clauses: 4811
% 0.76/0.66 # ...number of literals in the above : 36849
% 0.76/0.66 # Current number of archived formulas : 0
% 0.76/0.66 # Current number of archived clauses : 73
% 0.76/0.66 # Clause-clause subsumption calls (NU) : 13364
% 0.76/0.66 # Rec. Clause-clause subsumption calls : 464
% 0.76/0.66 # Non-unit clause-clause subsumptions : 159
% 0.76/0.66 # Unit Clause-clause subsumption calls : 99
% 0.76/0.66 # Rewrite failures with RHS unbound : 0
% 0.76/0.66 # BW rewrite match attempts : 1
% 0.76/0.66 # BW rewrite match successes : 1
% 0.76/0.66 # Condensation attempts : 305
% 0.76/0.66 # Condensation successes : 4
% 0.76/0.66 # Termbank termtop insertions : 83710
% 0.76/0.66 # Search garbage collected termcells : 105
% 0.76/0.66
% 0.76/0.66 # -------------------------------------------------
% 0.76/0.66 # User time : 0.166 s
% 0.76/0.66 # System time : 0.006 s
% 0.76/0.66 # Total time : 0.172 s
% 0.76/0.66 # Maximum resident set size: 1756 pages
% 0.76/0.66
% 0.76/0.66 # -------------------------------------------------
% 0.76/0.66 # User time : 0.179 s
% 0.76/0.66 # System time : 0.020 s
% 0.76/0.66 # Total time : 0.199 s
% 0.76/0.66 # Maximum resident set size: 1724 pages
% 0.76/0.66 % E---3.1 exiting
% 0.76/0.66 % E exiting
%------------------------------------------------------------------------------