TSTP Solution File: SEV006^5 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SEV006^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 : Mon Jun 24 15:53:05 EDT 2024
% Result : Theorem 0.15s 0.40s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 17 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 182 ( 181 equ; 0 cnn)
% Maximal formula atoms : 39 ( 10 avg)
% Number of connectives : 764 ( 109 ~; 70 |; 93 &; 490 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 61 ( 13 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 113 ( 0 ^ 93 !; 20 ?; 113 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
esk1_0: a > a > a ).
thf(decl_23,type,
esk2_0: a > a > a ).
thf(decl_24,type,
esk3_0: a ).
thf(decl_25,type,
esk4_0: a ).
thf(decl_26,type,
esk5_0: a ).
thf(decl_27,type,
esk6_0: a ).
thf(decl_28,type,
esk7_0: a ).
thf(decl_29,type,
esk8_0: a ).
thf(decl_30,type,
esk9_0: a ).
thf(decl_31,type,
esk10_0: a ).
thf(cPENTAGON_THM2D_pme,conjecture,
! [X1: a > a > a,X2: a > a > a] :
( ( ! [X3: a] :
( ( X1 @ X3 @ X3 )
= X3 )
& ! [X3: a] :
( ( X2 @ X3 @ X3 )
= X3 )
& ! [X3: a,X4: a,X5: a] :
( ( X1 @ ( X1 @ X3 @ X4 ) @ X5 )
= ( X1 @ X3 @ ( X1 @ X4 @ X5 ) ) )
& ! [X3: a,X4: a,X5: a] :
( ( X2 @ ( X2 @ X3 @ X4 ) @ X5 )
= ( X2 @ X3 @ ( X2 @ X4 @ X5 ) ) )
& ! [X3: a,X4: a] :
( ( X1 @ X3 @ X4 )
= ( X1 @ X4 @ X3 ) )
& ! [X3: a,X4: a] :
( ( X2 @ X3 @ X4 )
= ( X2 @ X4 @ X3 ) )
& ! [X3: a,X4: a] :
( ( X1 @ ( X2 @ X3 @ X4 ) @ X4 )
= X4 )
& ! [X3: a,X4: a] :
( ( X2 @ ( X1 @ X3 @ X4 ) @ X4 )
= X4 )
& ? [X3: a,X4: a,X6: a,X7: a,X8: a] :
( ( X6 != X7 )
& ( X6 != X8 )
& ( X6 != X3 )
& ( X6 != X4 )
& ( X7 != X8 )
& ( X7 != X3 )
& ( X7 != X4 )
& ( X8 != X3 )
& ( X8 != X4 )
& ( X3 != X4 ) )
& ~ ! [X3: a,X4: a,X5: a] :
( ( X1 @ X3 @ ( X2 @ X4 @ ( X1 @ X3 @ X5 ) ) )
= ( X2 @ ( X1 @ X3 @ X4 ) @ ( X1 @ X3 @ X5 ) ) ) )
=> ? [X3: a,X4: a,X6: a,X7: a,X8: a] :
( ( ( X2 @ X3 @ X4 )
= X4 )
& ( ( X1 @ X3 @ X4 )
= X3 )
& ( ( X2 @ X3 @ X6 )
= X6 )
& ( ( X1 @ X3 @ X6 )
= X3 )
& ( ( X2 @ X3 @ X7 )
= X7 )
& ( ( X1 @ X3 @ X7 )
= X3 )
& ( ( X2 @ X3 @ X8 )
= X8 )
& ( ( X1 @ X3 @ X8 )
= X3 )
& ( ( X2 @ X6 @ X7 )
= X4 )
& ( ( X1 @ X6 @ X7 )
= X3 )
& ( ( X2 @ X6 @ X8 )
= X6 )
& ( ( X1 @ X6 @ X8 )
= X8 )
& ( ( X2 @ X6 @ X4 )
= X4 )
& ( ( X1 @ X6 @ X4 )
= X6 )
& ( ( X2 @ X7 @ X8 )
= X4 )
& ( ( X1 @ X7 @ X8 )
= X3 )
& ( ( X2 @ X7 @ X4 )
= X4 )
& ( ( X1 @ X7 @ X4 )
= X7 )
& ( ( X2 @ X8 @ X4 )
= X4 )
& ( ( X1 @ X8 @ X4 )
= X8 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.xZSq8XCNQI/E---3.1_14671.p',cPENTAGON_THM2D_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a > a > a,X2: a > a > a] :
( ( ! [X3: a] :
( ( X1 @ X3 @ X3 )
= X3 )
& ! [X3: a] :
( ( X2 @ X3 @ X3 )
= X3 )
& ! [X3: a,X4: a,X5: a] :
( ( X1 @ ( X1 @ X3 @ X4 ) @ X5 )
= ( X1 @ X3 @ ( X1 @ X4 @ X5 ) ) )
& ! [X3: a,X4: a,X5: a] :
( ( X2 @ ( X2 @ X3 @ X4 ) @ X5 )
= ( X2 @ X3 @ ( X2 @ X4 @ X5 ) ) )
& ! [X3: a,X4: a] :
( ( X1 @ X3 @ X4 )
= ( X1 @ X4 @ X3 ) )
& ! [X3: a,X4: a] :
( ( X2 @ X3 @ X4 )
= ( X2 @ X4 @ X3 ) )
& ! [X3: a,X4: a] :
( ( X1 @ ( X2 @ X3 @ X4 ) @ X4 )
= X4 )
& ! [X3: a,X4: a] :
( ( X2 @ ( X1 @ X3 @ X4 ) @ X4 )
= X4 )
& ? [X3: a,X4: a,X6: a,X7: a,X8: a] :
( ( X6 != X7 )
& ( X6 != X8 )
& ( X6 != X3 )
& ( X6 != X4 )
& ( X7 != X8 )
& ( X7 != X3 )
& ( X7 != X4 )
& ( X8 != X3 )
& ( X8 != X4 )
& ( X3 != X4 ) )
& ~ ! [X3: a,X4: a,X5: a] :
( ( X1 @ X3 @ ( X2 @ X4 @ ( X1 @ X3 @ X5 ) ) )
= ( X2 @ ( X1 @ X3 @ X4 ) @ ( X1 @ X3 @ X5 ) ) ) )
=> ? [X3: a,X4: a,X6: a,X7: a,X8: a] :
( ( ( X2 @ X3 @ X4 )
= X4 )
& ( ( X1 @ X3 @ X4 )
= X3 )
& ( ( X2 @ X3 @ X6 )
= X6 )
& ( ( X1 @ X3 @ X6 )
= X3 )
& ( ( X2 @ X3 @ X7 )
= X7 )
& ( ( X1 @ X3 @ X7 )
= X3 )
& ( ( X2 @ X3 @ X8 )
= X8 )
& ( ( X1 @ X3 @ X8 )
= X3 )
& ( ( X2 @ X6 @ X7 )
= X4 )
& ( ( X1 @ X6 @ X7 )
= X3 )
& ( ( X2 @ X6 @ X8 )
= X6 )
& ( ( X1 @ X6 @ X8 )
= X8 )
& ( ( X2 @ X6 @ X4 )
= X4 )
& ( ( X1 @ X6 @ X4 )
= X6 )
& ( ( X2 @ X7 @ X8 )
= X4 )
& ( ( X1 @ X7 @ X8 )
= X3 )
& ( ( X2 @ X7 @ X4 )
= X4 )
& ( ( X1 @ X7 @ X4 )
= X7 )
& ( ( X2 @ X8 @ X4 )
= X4 )
& ( ( X1 @ X8 @ X4 )
= X8 ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cPENTAGON_THM2D_pme])]) ).
thf(c_0_2,negated_conjecture,
! [X42: a,X43: a,X44: a,X45: a,X46: a,X47: a,X48: a,X49: a,X50: a,X51: a,X52: a,X53: a,X54: a,X55: a,X56: a,X57: a,X66: a,X67: a,X68: a,X69: a,X70: a] :
( ( ( esk1_0 @ X42 @ X42 )
= X42 )
& ( ( esk2_0 @ X43 @ X43 )
= X43 )
& ( ( esk1_0 @ ( esk1_0 @ X44 @ X45 ) @ X46 )
= ( esk1_0 @ X44 @ ( esk1_0 @ X45 @ X46 ) ) )
& ( ( esk2_0 @ ( esk2_0 @ X47 @ X48 ) @ X49 )
= ( esk2_0 @ X47 @ ( esk2_0 @ X48 @ X49 ) ) )
& ( ( esk1_0 @ X50 @ X51 )
= ( esk1_0 @ X51 @ X50 ) )
& ( ( esk2_0 @ X52 @ X53 )
= ( esk2_0 @ X53 @ X52 ) )
& ( ( esk1_0 @ ( esk2_0 @ X54 @ X55 ) @ X55 )
= X55 )
& ( ( esk2_0 @ ( esk1_0 @ X56 @ X57 ) @ X57 )
= X57 )
& ( esk5_0 != esk6_0 )
& ( esk5_0 != esk7_0 )
& ( esk5_0 != esk3_0 )
& ( esk5_0 != esk4_0 )
& ( esk6_0 != esk7_0 )
& ( esk6_0 != esk3_0 )
& ( esk6_0 != esk4_0 )
& ( esk7_0 != esk3_0 )
& ( esk7_0 != esk4_0 )
& ( esk3_0 != esk4_0 )
& ( ( esk1_0 @ esk8_0 @ ( esk2_0 @ esk9_0 @ ( esk1_0 @ esk8_0 @ esk10_0 ) ) )
!= ( esk2_0 @ ( esk1_0 @ esk8_0 @ esk9_0 ) @ ( esk1_0 @ esk8_0 @ esk10_0 ) ) )
& ( ( ( esk2_0 @ X66 @ X67 )
!= X67 )
| ( ( esk1_0 @ X66 @ X67 )
!= X66 )
| ( ( esk2_0 @ X66 @ X68 )
!= X68 )
| ( ( esk1_0 @ X66 @ X68 )
!= X66 )
| ( ( esk2_0 @ X66 @ X69 )
!= X69 )
| ( ( esk1_0 @ X66 @ X69 )
!= X66 )
| ( ( esk2_0 @ X66 @ X70 )
!= X70 )
| ( ( esk1_0 @ X66 @ X70 )
!= X66 )
| ( ( esk2_0 @ X68 @ X69 )
!= X67 )
| ( ( esk1_0 @ X68 @ X69 )
!= X66 )
| ( ( esk2_0 @ X68 @ X70 )
!= X68 )
| ( ( esk1_0 @ X68 @ X70 )
!= X70 )
| ( ( esk2_0 @ X68 @ X67 )
!= X67 )
| ( ( esk1_0 @ X68 @ X67 )
!= X68 )
| ( ( esk2_0 @ X69 @ X70 )
!= X67 )
| ( ( esk1_0 @ X69 @ X70 )
!= X66 )
| ( ( esk2_0 @ X69 @ X67 )
!= X67 )
| ( ( esk1_0 @ X69 @ X67 )
!= X69 )
| ( ( esk2_0 @ X70 @ X67 )
!= X67 )
| ( ( esk1_0 @ X70 @ X67 )
!= X70 ) ) ),
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,
! [X3: a,X4: a] :
( ( esk1_0 @ ( esk2_0 @ X3 @ X4 ) @ X4 )
= X4 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X4: a,X3: a] :
( ( esk1_0 @ X3 @ X4 )
= ( esk1_0 @ X4 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X3: a,X5: a,X4: a,X6: a,X7: a] :
( ( ( esk2_0 @ X3 @ X4 )
!= X4 )
| ( ( esk1_0 @ X3 @ X4 )
!= X3 )
| ( ( esk2_0 @ X3 @ X5 )
!= X5 )
| ( ( esk1_0 @ X3 @ X5 )
!= X3 )
| ( ( esk2_0 @ X3 @ X6 )
!= X6 )
| ( ( esk1_0 @ X3 @ X6 )
!= X3 )
| ( ( esk2_0 @ X3 @ X7 )
!= X7 )
| ( ( esk1_0 @ X3 @ X7 )
!= X3 )
| ( ( esk2_0 @ X5 @ X6 )
!= X4 )
| ( ( esk1_0 @ X5 @ X6 )
!= X3 )
| ( ( esk2_0 @ X5 @ X7 )
!= X5 )
| ( ( esk1_0 @ X5 @ X7 )
!= X7 )
| ( ( esk2_0 @ X5 @ X4 )
!= X4 )
| ( ( esk1_0 @ X5 @ X4 )
!= X5 )
| ( ( esk2_0 @ X6 @ X7 )
!= X4 )
| ( ( esk1_0 @ X6 @ X7 )
!= X3 )
| ( ( esk2_0 @ X6 @ X4 )
!= X4 )
| ( ( esk1_0 @ X6 @ X4 )
!= X6 )
| ( ( esk2_0 @ X7 @ X4 )
!= X4 )
| ( ( esk1_0 @ X7 @ X4 )
!= X7 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X4: a,X3: a] :
( ( esk1_0 @ X3 @ ( esk2_0 @ X4 @ X3 ) )
= X3 ),
inference(rw,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X3: a,X4: a,X5: a] :
( ( esk1_0 @ ( esk1_0 @ X3 @ X4 ) @ X5 )
= ( esk1_0 @ X3 @ ( esk1_0 @ X4 @ X5 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
! [X3: a] :
( ( esk1_0 @ X3 @ X3 )
= X3 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
! [X4: a,X3: a] :
( ( esk2_0 @ X3 @ X4 )
= ( esk2_0 @ X4 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_10,negated_conjecture,
! [X3: a,X4: a] :
( ( esk2_0 @ ( esk1_0 @ X3 @ X4 ) @ X4 )
= X4 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_11,negated_conjecture,
! [X3: a,X4: a,X5: a] :
( ( ( esk2_0 @ ( esk1_0 @ X3 @ X4 ) @ ( esk2_0 @ X3 @ X4 ) )
!= ( esk2_0 @ X3 @ X4 ) )
| ( ( esk1_0 @ X3 @ ( esk1_0 @ X4 @ X3 ) )
!= ( esk1_0 @ X3 @ X4 ) )
| ( ( esk1_0 @ X3 @ ( esk1_0 @ X4 @ X5 ) )
!= ( esk1_0 @ X3 @ X4 ) )
| ( ( esk2_0 @ X4 @ ( esk2_0 @ X3 @ X4 ) )
!= ( esk2_0 @ X3 @ X4 ) )
| ( ( esk2_0 @ X3 @ ( esk2_0 @ X3 @ X4 ) )
!= ( esk2_0 @ X3 @ X4 ) )
| ( ( esk2_0 @ X5 @ ( esk2_0 @ X3 @ X4 ) )
!= ( esk2_0 @ X3 @ X4 ) )
| ( ( esk1_0 @ X3 @ ( esk2_0 @ X3 @ X4 ) )
!= X3 )
| ( ( esk1_0 @ X5 @ X3 )
!= ( esk1_0 @ X3 @ X4 ) )
| ( ( esk1_0 @ X5 @ ( esk2_0 @ X3 @ X4 ) )
!= X5 )
| ( ( esk2_0 @ X5 @ X3 )
!= ( esk2_0 @ X3 @ X4 ) )
| ( ( esk2_0 @ X4 @ ( esk1_0 @ X3 @ X4 ) )
!= X4 )
| ( ( esk2_0 @ X3 @ ( esk1_0 @ X3 @ X4 ) )
!= X3 )
| ( ( esk2_0 @ ( esk1_0 @ X3 @ X4 ) @ X5 )
!= X5 )
| ( ( esk1_0 @ X5 @ X4 )
!= X4 )
| ( ( esk2_0 @ X5 @ X4 )
!= X5 ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_5])]),c_0_6]),c_0_7]),c_0_8]),c_0_7]),c_0_7]),c_0_7]),c_0_6])]),c_0_9]),c_0_9]) ).
thf(c_0_12,negated_conjecture,
! [X4: a,X3: a] :
( ( esk2_0 @ X3 @ ( esk1_0 @ X4 @ X3 ) )
= X3 ),
inference(rw,[status(thm)],[c_0_10,c_0_9]) ).
thf(c_0_13,negated_conjecture,
! [X3: a,X4: a,X5: a] :
( ( ( esk2_0 @ ( esk1_0 @ X3 @ X4 ) @ ( esk2_0 @ X3 @ X4 ) )
!= ( esk2_0 @ X3 @ X4 ) )
| ( ( esk1_0 @ X3 @ ( esk1_0 @ X4 @ X3 ) )
!= ( esk1_0 @ X3 @ X4 ) )
| ( ( esk1_0 @ X3 @ ( esk1_0 @ X4 @ X5 ) )
!= ( esk1_0 @ X3 @ X4 ) )
| ( ( esk2_0 @ X4 @ ( esk2_0 @ X3 @ X4 ) )
!= ( esk2_0 @ X3 @ X4 ) )
| ( ( esk2_0 @ X3 @ ( esk2_0 @ X3 @ X4 ) )
!= ( esk2_0 @ X3 @ X4 ) )
| ( ( esk2_0 @ X5 @ ( esk2_0 @ X3 @ X4 ) )
!= ( esk2_0 @ X3 @ X4 ) )
| ( ( esk1_0 @ X3 @ ( esk2_0 @ X3 @ X4 ) )
!= X3 )
| ( ( esk1_0 @ X5 @ X3 )
!= ( esk1_0 @ X3 @ X4 ) )
| ( ( esk1_0 @ X5 @ ( esk2_0 @ X3 @ X4 ) )
!= X5 )
| ( ( esk2_0 @ X5 @ X3 )
!= ( esk2_0 @ X3 @ X4 ) )
| ( ( esk2_0 @ X3 @ ( esk1_0 @ X3 @ X4 ) )
!= X3 )
| ( ( esk2_0 @ ( esk1_0 @ X3 @ X4 ) @ X5 )
!= X5 )
| ( ( esk1_0 @ X5 @ X4 )
!= X4 )
| ( ( esk2_0 @ X5 @ X4 )
!= X5 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]) ).
thf(c_0_14,negated_conjecture,
! [X3: a] :
( ( esk2_0 @ X3 @ X3 )
= X3 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_15,negated_conjecture,
! [X3: a,X4: a] :
( ( ( esk1_0 @ X3 @ ( esk1_0 @ X3 @ X4 ) )
!= X3 )
| ( ( esk2_0 @ X4 @ X3 )
!= X3 )
| ( ( esk1_0 @ X4 @ X3 )
!= X3 )
| ( ( esk1_0 @ X4 @ X3 )
!= X4 )
| ( ( esk2_0 @ X3 @ X4 )
!= X4 )
| ( ( esk2_0 @ X4 @ X3 )
!= X4 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_8]),c_0_14]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_14]),c_0_8]),c_0_8]),c_0_8]),c_0_14]),c_0_8])]) ).
thf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_8]),c_0_8]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.09 % Problem : SEV006^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.09 % Command : run_E %s %d THM
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 300
% 0.09/0.28 % DateTime : Fri Jun 21 19:09:08 EDT 2024
% 0.09/0.28 % CPUTime :
% 0.15/0.39 Running higher-order theorem proving
% 0.15/0.39 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/tmp/tmp.xZSq8XCNQI/E---3.1_14671.p
% 0.15/0.40 # Version: 3.2.0-ho
% 0.15/0.40 # Preprocessing class: HSMSSMSSSSSNSSA.
% 0.15/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.40 # Starting post_as_ho1 with 1500s (5) cores
% 0.15/0.40 # Starting post_as_ho12 with 300s (1) cores
% 0.15/0.40 # Starting new_ho_3 with 300s (1) cores
% 0.15/0.40 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.15/0.40 # post_as_ho1 with pid 14749 completed with status 0
% 0.15/0.40 # Result found by post_as_ho1
% 0.15/0.40 # Preprocessing class: HSMSSMSSSSSNSSA.
% 0.15/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.40 # Starting post_as_ho1 with 1500s (5) cores
% 0.15/0.40 # No SInE strategy applied
% 0.15/0.40 # Search class: HUHPM-FFMF00-MSSFFFNN
% 0.15/0.40 # partial match(3): HUHPF-FFSF00-SSSFFFNN
% 0.15/0.40 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.40 # Starting new_ho_10 with 811s (1) cores
% 0.15/0.40 # Starting post_as_ho1 with 151s (1) cores
% 0.15/0.40 # Starting new_bool_1 with 136s (1) cores
% 0.15/0.40 # Starting new_bool_2 with 136s (1) cores
% 0.15/0.40 # Starting new_bool_9 with 136s (1) cores
% 0.15/0.40 # post_as_ho1 with pid 14756 completed with status 0
% 0.15/0.40 # Result found by post_as_ho1
% 0.15/0.40 # Preprocessing class: HSMSSMSSSSSNSSA.
% 0.15/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.40 # Starting post_as_ho1 with 1500s (5) cores
% 0.15/0.40 # No SInE strategy applied
% 0.15/0.40 # Search class: HUHPM-FFMF00-MSSFFFNN
% 0.15/0.40 # partial match(3): HUHPF-FFSF00-SSSFFFNN
% 0.15/0.40 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.40 # Starting new_ho_10 with 811s (1) cores
% 0.15/0.40 # Starting post_as_ho1 with 151s (1) cores
% 0.15/0.40 # Preprocessing time : 0.001 s
% 0.15/0.40 # Presaturation interreduction done
% 0.15/0.40
% 0.15/0.40 # Proof found!
% 0.15/0.40 # SZS status Theorem
% 0.15/0.40 # SZS output start CNFRefutation
% See solution above
% 0.15/0.40 # Parsed axioms : 2
% 0.15/0.40 # Removed by relevancy pruning/SinE : 0
% 0.15/0.40 # Initial clauses : 21
% 0.15/0.40 # Removed in clause preprocessing : 1
% 0.15/0.40 # Initial clauses in saturation : 20
% 0.15/0.40 # Processed clauses : 45
% 0.15/0.40 # ...of these trivial : 0
% 0.15/0.40 # ...subsumed : 0
% 0.15/0.40 # ...remaining for further processing : 45
% 0.15/0.40 # Other redundant clauses eliminated : 2
% 0.15/0.40 # Clauses deleted for lack of memory : 0
% 0.15/0.40 # Backward-subsumed : 0
% 0.15/0.40 # Backward-rewritten : 3
% 0.15/0.40 # Generated clauses : 49
% 0.15/0.40 # ...of the previous two non-redundant : 41
% 0.15/0.40 # ...aggressively subsumed : 0
% 0.15/0.40 # Contextual simplify-reflections : 0
% 0.15/0.40 # Paramodulations : 48
% 0.15/0.40 # Factorizations : 0
% 0.15/0.40 # NegExts : 0
% 0.15/0.40 # Equation resolutions : 2
% 0.15/0.40 # Disequality decompositions : 0
% 0.15/0.40 # Total rewrite steps : 80
% 0.15/0.40 # ...of those cached : 49
% 0.15/0.40 # Propositional unsat checks : 0
% 0.15/0.40 # Propositional check models : 0
% 0.15/0.40 # Propositional check unsatisfiable : 0
% 0.15/0.40 # Propositional clauses : 0
% 0.15/0.40 # Propositional clauses after purity: 0
% 0.15/0.40 # Propositional unsat core size : 0
% 0.15/0.40 # Propositional preprocessing time : 0.000
% 0.15/0.40 # Propositional encoding time : 0.000
% 0.15/0.40 # Propositional solver time : 0.000
% 0.15/0.40 # Success case prop preproc time : 0.000
% 0.15/0.40 # Success case prop encoding time : 0.000
% 0.15/0.40 # Success case prop solver time : 0.000
% 0.15/0.40 # Current number of processed clauses : 21
% 0.15/0.40 # Positive orientable unit clauses : 6
% 0.15/0.40 # Positive unorientable unit clauses: 2
% 0.15/0.40 # Negative unit clauses : 11
% 0.15/0.40 # Non-unit-clauses : 2
% 0.15/0.40 # Current number of unprocessed clauses: 32
% 0.15/0.40 # ...number of literals in the above : 130
% 0.15/0.40 # Current number of archived formulas : 0
% 0.15/0.40 # Current number of archived clauses : 23
% 0.15/0.40 # Clause-clause subsumption calls (NU) : 1
% 0.15/0.40 # Rec. Clause-clause subsumption calls : 0
% 0.15/0.40 # Non-unit clause-clause subsumptions : 0
% 0.15/0.40 # Unit Clause-clause subsumption calls : 1
% 0.15/0.40 # Rewrite failures with RHS unbound : 0
% 0.15/0.40 # BW rewrite match attempts : 61
% 0.15/0.40 # BW rewrite match successes : 53
% 0.15/0.40 # Condensation attempts : 0
% 0.15/0.40 # Condensation successes : 0
% 0.15/0.40 # Termbank termtop insertions : 2838
% 0.15/0.40 # Search garbage collected termcells : 922
% 0.15/0.40
% 0.15/0.40 # -------------------------------------------------
% 0.15/0.40 # User time : 0.005 s
% 0.15/0.40 # System time : 0.002 s
% 0.15/0.40 # Total time : 0.006 s
% 0.15/0.40 # Maximum resident set size: 1940 pages
% 0.15/0.40
% 0.15/0.40 # -------------------------------------------------
% 0.15/0.40 # User time : 0.017 s
% 0.15/0.40 # System time : 0.006 s
% 0.15/0.40 # Total time : 0.023 s
% 0.15/0.40 # Maximum resident set size: 1728 pages
% 0.15/0.40 % E---3.1 exiting
% 0.15/0.40 % E exiting
%------------------------------------------------------------------------------