TSTP Solution File: PHI007^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PHI007^5 : TPTP v8.2.0. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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 02:18:07 EDT 2024
% Result : ContradictoryAxioms 0.16s 0.49s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 27
% Syntax : Number of formulae : 64 ( 11 unt; 20 typ; 0 def)
% Number of atoms : 127 ( 7 equ; 0 cnn)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 475 ( 62 ~; 45 |; 12 &; 336 @)
% ( 3 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 8 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 128 ( 128 >; 0 *; 0 +; 0 <<)
% Number of symbols : 21 ( 18 usr; 6 con; 0-5 aty)
% Number of variables : 140 ( 38 ^ 100 !; 2 ?; 140 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
qML_mu: $tType ).
thf(decl_sort2,type,
qML_i: $tType ).
thf(decl_22,type,
inconsistency_G: qML_mu > qML_i > $o ).
thf(decl_23,type,
incons1905966852QML_mu: qML_mu > qML_i > $o ).
thf(decl_24,type,
inconsistency_P: ( qML_mu > qML_i > $o ) > qML_i > $o ).
thf(decl_25,type,
incons1389517216QML_mu: ( qML_mu > qML_i > $o ) > qML_mu > qML_i > $o ).
thf(decl_26,type,
qML_r: qML_i > qML_i > $o ).
thf(decl_27,type,
esk1_3: qML_i > ( qML_mu > qML_i > $o ) > ( qML_mu > qML_i > $o ) > qML_i ).
thf(decl_28,type,
esk2_3: qML_i > ( qML_mu > qML_i > $o ) > ( qML_mu > qML_i > $o ) > qML_mu ).
thf(decl_29,type,
epred1_2: qML_mu > qML_i > qML_mu > qML_i > $o ).
thf(decl_30,type,
esk3_4: qML_mu > qML_i > ( qML_mu > qML_i > $o ) > qML_i > qML_mu ).
thf(decl_31,type,
epred2_2: qML_mu > qML_i > qML_mu > qML_i > $o ).
thf(decl_32,type,
esk4_2: qML_mu > qML_i > qML_i ).
thf(decl_33,type,
epred3_3: ( qML_mu > qML_i > $o ) > qML_mu > qML_i > qML_mu > qML_i > $o ).
thf(decl_34,type,
esk5_3: ( qML_mu > qML_i > $o ) > qML_mu > qML_i > qML_i ).
thf(decl_35,type,
esk6_3: ( qML_mu > qML_i > $o ) > qML_mu > qML_i > qML_mu ).
thf(decl_75,type,
esk46_0: qML_mu ).
thf(decl_76,type,
esk47_0: qML_i ).
thf(decl_79,type,
esk50_0: qML_mu ).
thf(decl_83,type,
esk54_0: qML_i ).
thf(fact_0_A1a,axiom,
! [X1: qML_i,X2: qML_mu > qML_i > $o] :
( ( inconsistency_P
@ ^ [X3: qML_mu,X4: qML_i] :
~ ( X2 @ X3 @ X4 )
@ X1 )
=> ~ ( inconsistency_P @ X2 @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_A1a) ).
thf(fact_3_A3,axiom,
! [X8: qML_i] : ( inconsistency_P @ inconsistency_G @ X8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_3_A3) ).
thf(fact_2_A2,axiom,
! [X1: qML_i,X2: qML_mu > qML_i > $o,X5: qML_mu > qML_i > $o] :
( ( ( inconsistency_P @ X2 @ X1 )
& ! [X6: qML_i] :
( ( qML_r @ X1 @ X6 )
=> ! [X7: qML_mu] :
( ( X2 @ X7 @ X6 )
=> ( X5 @ X7 @ X6 ) ) ) )
=> ( inconsistency_P @ X5 @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2_A2) ).
thf(fact_6_G__def,axiom,
( inconsistency_G
= ( ^ [X10: qML_mu,X11: qML_i] :
! [X12: qML_mu > qML_i > $o] :
( ( inconsistency_P @ X12 @ X11 )
=> ( X12 @ X10 @ X11 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_6_G__def) ).
thf(fact_5_A5,axiom,
! [X8: qML_i] : ( inconsistency_P @ incons1905966852QML_mu @ X8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_5_A5) ).
thf(fact_7_NE__def,axiom,
( incons1905966852QML_mu
= ( ^ [X10: qML_mu,X11: qML_i] :
! [X13: qML_mu > qML_i > $o] :
( ( incons1389517216QML_mu @ X13 @ X10 @ X11 )
=> ! [X14: qML_i] :
( ( qML_r @ X11 @ X14 )
=> ? [X15: qML_mu] : ( X13 @ X15 @ X14 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_7_NE__def) ).
thf(fact_8_ess__def,axiom,
( incons1389517216QML_mu
= ( ^ [X16: qML_mu > qML_i > $o,X10: qML_mu,X11: qML_i] :
! [X17: qML_mu > qML_i > $o] :
( ( X17 @ X10 @ X11 )
=> ! [X14: qML_i] :
( ( qML_r @ X11 @ X14 )
=> ! [X18: qML_mu] :
( ( X16 @ X18 @ X14 )
=> ( X17 @ X18 @ X14 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_8_ess__def) ).
thf(c_0_7,plain,
! [X1: qML_i,X2: qML_mu > qML_i > $o] :
( ( inconsistency_P
@ ^ [Z0: qML_mu,Z1: qML_i] :
~ ( X2 @ Z0 @ Z1 )
@ X1 )
=> ~ ( inconsistency_P @ X2 @ X1 ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_0_A1a])]) ).
thf(c_0_8,plain,
! [X40: qML_i,X41: qML_mu > qML_i > $o] :
( ~ ( inconsistency_P
@ ^ [Z0: qML_mu,Z1: qML_i] :
~ ( X41 @ Z0 @ Z1 )
@ X40 )
| ~ ( inconsistency_P @ X41 @ X40 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
thf(c_0_9,plain,
! [X49: qML_i] : ( inconsistency_P @ inconsistency_G @ X49 ),
inference(variable_rename,[status(thm)],[fact_3_A3]) ).
thf(c_0_10,plain,
! [X44: qML_i,X45: qML_mu > qML_i > $o,X46: qML_mu > qML_i > $o] :
( ( ( qML_r @ X44 @ ( esk1_3 @ X44 @ X45 @ X46 ) )
| ~ ( inconsistency_P @ X45 @ X44 )
| ( inconsistency_P @ X46 @ X44 ) )
& ( ( X45 @ ( esk2_3 @ X44 @ X45 @ X46 ) @ ( esk1_3 @ X44 @ X45 @ X46 ) )
| ~ ( inconsistency_P @ X45 @ X44 )
| ( inconsistency_P @ X46 @ X44 ) )
& ( ~ ( X46 @ ( esk2_3 @ X44 @ X45 @ X46 ) @ ( esk1_3 @ X44 @ X45 @ X46 ) )
| ~ ( inconsistency_P @ X45 @ X44 )
| ( inconsistency_P @ X46 @ X44 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_2_A2])])])])]) ).
thf(c_0_11,plain,
! [X33: qML_mu,X34: qML_i] :
( ( inconsistency_G @ X33 @ X34 )
<=> ! [X12: qML_mu > qML_i > $o] :
( ( inconsistency_P @ X12 @ X34 )
=> ( X12 @ X33 @ X34 ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_6_G__def])]) ).
thf(c_0_12,plain,
! [X2: qML_mu > qML_i > $o,X1: qML_i] :
( ~ ( inconsistency_P
@ ^ [Z0: qML_mu,Z1: qML_i] :
~ ( X2 @ Z0 @ Z1 )
@ X1 )
| ~ ( inconsistency_P @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_13,plain,
! [X1: qML_i] : ( inconsistency_P @ inconsistency_G @ X1 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_14,plain,
! [X5: qML_mu > qML_i > $o,X2: qML_mu > qML_i > $o,X1: qML_i] :
( ( inconsistency_P @ X2 @ X1 )
| ~ ( X2 @ ( esk2_3 @ X1 @ X5 @ X2 ) @ ( esk1_3 @ X1 @ X5 @ X2 ) )
| ~ ( inconsistency_P @ X5 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_15,plain,
! [X54: qML_mu,X55: qML_i,X56: qML_mu > qML_i > $o,X57: qML_mu,X58: qML_i] :
( ( ~ ( inconsistency_G @ X54 @ X55 )
| ~ ( inconsistency_P @ X56 @ X55 )
| ( X56 @ X54 @ X55 ) )
& ( ( inconsistency_P @ ( epred1_2 @ X57 @ X58 ) @ X58 )
| ( inconsistency_G @ X57 @ X58 ) )
& ( ~ ( epred1_2 @ X57 @ X58 @ X57 @ X58 )
| ( inconsistency_G @ X57 @ X58 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])])])]) ).
thf(c_0_16,plain,
! [X1: qML_i] :
~ ( inconsistency_P
@ ^ [Z0: qML_mu,Z1: qML_i] :
~ ( inconsistency_G @ Z0 @ Z1 )
@ X1 ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_17,plain,
! [X2: qML_mu > qML_i > $o,X1: qML_i] :
( ( inconsistency_P
@ ^ [Z0: qML_mu,Z1: qML_i] : $true
@ X1 )
| ~ ( inconsistency_P @ X2 @ X1 ) ),
inference(primitive_enumeration,[status(thm)],[c_0_14]) ).
thf(c_0_18,plain,
! [X3: qML_mu,X2: qML_mu > qML_i > $o,X1: qML_i] :
( ( X2 @ X3 @ X1 )
| ~ ( inconsistency_G @ X3 @ X1 )
| ~ ( inconsistency_P @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_19,plain,
! [X53: qML_i] : ( inconsistency_P @ incons1905966852QML_mu @ X53 ),
inference(variable_rename,[status(thm)],[fact_5_A5]) ).
thf(c_0_20,plain,
! [X2: qML_mu > qML_i > $o,X1: qML_i] :
( ( ( ^ [Z0: qML_mu,Z1: qML_i] :
~ ( inconsistency_G @ Z0 @ Z1 ) )
!= ( ^ [Z0: qML_mu,Z1: qML_i] : $true ) )
| ~ ( inconsistency_P @ X2 @ X1 ) ),
inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_16,c_0_17])]) ).
thf(c_0_21,plain,
! [X3: qML_mu,X1: qML_i] :
( ~ ( inconsistency_P
@ ^ [Z0: qML_mu,Z1: qML_i] : ~ $true
@ X1 )
| ~ ( inconsistency_G @ X3 @ X1 ) ),
inference(primitive_enumeration,[status(thm)],[c_0_18]) ).
thf(c_0_22,plain,
! [X1: qML_i] : ( inconsistency_P @ incons1905966852QML_mu @ X1 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_23,plain,
! [X2: qML_mu > qML_i > $o,X1: qML_i] :
( ( inconsistency_G @ esk46_0 @ esk47_0 )
| ~ ( inconsistency_P @ X2 @ X1 ) ),
inference(cn,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_20])]) ).
thf(c_0_24,plain,
! [X35: qML_mu,X36: qML_i] :
( ( incons1905966852QML_mu @ X35 @ X36 )
<=> ! [X13: qML_mu > qML_i > $o] :
( ( incons1389517216QML_mu @ X13 @ X35 @ X36 )
=> ! [X14: qML_i] :
( ( qML_r @ X36 @ X14 )
=> ? [X15: qML_mu] : ( X13 @ X15 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_7_NE__def])]) ).
thf(c_0_25,plain,
! [X3: qML_mu,X1: qML_i] :
( ( ( ^ [Z0: qML_mu,Z1: qML_i] : ~ $true )
!= incons1905966852QML_mu )
| ~ ( inconsistency_G @ X3 @ X1 ) ),
inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_21,c_0_22])]) ).
thf(c_0_26,plain,
inconsistency_G @ esk46_0 @ esk47_0,
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
thf(c_0_27,plain,
! [X60: qML_mu,X61: qML_i,X62: qML_mu > qML_i > $o,X63: qML_i,X65: qML_mu,X66: qML_i,X69: qML_mu] :
( ( ~ ( incons1905966852QML_mu @ X60 @ X61 )
| ~ ( incons1389517216QML_mu @ X62 @ X60 @ X61 )
| ~ ( qML_r @ X61 @ X63 )
| ( X62 @ ( esk3_4 @ X60 @ X61 @ X62 @ X63 ) @ X63 ) )
& ( ( incons1389517216QML_mu @ ( epred2_2 @ X65 @ X66 ) @ X65 @ X66 )
| ( incons1905966852QML_mu @ X65 @ X66 ) )
& ( ( qML_r @ X66 @ ( esk4_2 @ X65 @ X66 ) )
| ( incons1905966852QML_mu @ X65 @ X66 ) )
& ( ~ ( epred2_2 @ X65 @ X66 @ X69 @ ( esk4_2 @ X65 @ X66 ) )
| ( incons1905966852QML_mu @ X65 @ X66 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])])])])])]) ).
thf(c_0_28,plain,
( ( ^ [Z0: qML_mu,Z1: qML_i] : ~ $true )
!= incons1905966852QML_mu ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
thf(c_0_29,plain,
! [X37: qML_mu > qML_i > $o,X38: qML_mu,X39: qML_i] :
( ( incons1389517216QML_mu @ X37 @ X38 @ X39 )
<=> ! [X17: qML_mu > qML_i > $o] :
( ( X17 @ X38 @ X39 )
=> ! [X14: qML_i] :
( ( qML_r @ X39 @ X14 )
=> ! [X18: qML_mu] :
( ( X37 @ X18 @ X14 )
=> ( X17 @ X18 @ X14 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_8_ess__def])]) ).
thf(c_0_30,plain,
! [X1: qML_i,X3: qML_mu,X2: qML_mu > qML_i > $o,X4: qML_i] :
( ( X2 @ ( esk3_4 @ X3 @ X1 @ X2 @ X4 ) @ X4 )
| ~ ( incons1905966852QML_mu @ X3 @ X1 )
| ~ ( incons1389517216QML_mu @ X2 @ X3 @ X1 )
| ~ ( qML_r @ X1 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_31,plain,
( ( ^ [Z0: qML_i] : ~ $true )
!= ( incons1905966852QML_mu @ esk50_0 ) ),
inference(neg_ext,[status(thm)],[c_0_28]) ).
thf(c_0_32,plain,
! [X70: qML_mu > qML_i > $o,X71: qML_mu,X72: qML_i,X73: qML_mu > qML_i > $o,X74: qML_i,X75: qML_mu,X76: qML_mu > qML_i > $o,X77: qML_mu,X78: qML_i] :
( ( ~ ( incons1389517216QML_mu @ X70 @ X71 @ X72 )
| ~ ( X73 @ X71 @ X72 )
| ~ ( qML_r @ X72 @ X74 )
| ~ ( X70 @ X75 @ X74 )
| ( X73 @ X75 @ X74 ) )
& ( ( epred3_3 @ X76 @ X77 @ X78 @ X77 @ X78 )
| ( incons1389517216QML_mu @ X76 @ X77 @ X78 ) )
& ( ( qML_r @ X78 @ ( esk5_3 @ X76 @ X77 @ X78 ) )
| ( incons1389517216QML_mu @ X76 @ X77 @ X78 ) )
& ( ( X76 @ ( esk6_3 @ X76 @ X77 @ X78 ) @ ( esk5_3 @ X76 @ X77 @ X78 ) )
| ( incons1389517216QML_mu @ X76 @ X77 @ X78 ) )
& ( ~ ( epred3_3 @ X76 @ X77 @ X78 @ ( esk6_3 @ X76 @ X77 @ X78 ) @ ( esk5_3 @ X76 @ X77 @ X78 ) )
| ( incons1389517216QML_mu @ X76 @ X77 @ X78 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])])])])])]) ).
thf(c_0_33,plain,
! [X1: qML_i,X3: qML_mu,X4: qML_i] :
( ~ ( incons1389517216QML_mu
@ ^ [Z0: qML_mu,Z1: qML_i] : ~ $true
@ X3
@ X1 )
| ~ ( incons1905966852QML_mu @ X3 @ X1 )
| ~ ( qML_r @ X1 @ X4 ) ),
inference(primitive_enumeration,[status(thm)],[c_0_30]) ).
thf(c_0_34,plain,
incons1905966852QML_mu @ esk50_0 @ esk54_0,
inference(neg_ext,[status(thm)],[c_0_31]) ).
thf(c_0_35,plain,
! [X3: qML_mu,X2: qML_mu > qML_i > $o,X1: qML_i] :
( ( X2 @ ( esk6_3 @ X2 @ X3 @ X1 ) @ ( esk5_3 @ X2 @ X3 @ X1 ) )
| ( incons1389517216QML_mu @ X2 @ X3 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
thf(c_0_36,plain,
! [X1: qML_i] :
( ~ ( incons1389517216QML_mu
@ ^ [Z0: qML_mu,Z1: qML_i] : ~ $true
@ esk50_0
@ esk54_0 )
| ~ ( qML_r @ esk54_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
thf(c_0_37,plain,
! [X3: qML_mu,X1: qML_i] :
( incons1389517216QML_mu
@ ^ [Z0: qML_mu,Z1: qML_i] : ~ $true
@ X3
@ X1 ),
inference(primitive_enumeration,[status(thm)],[c_0_35]) ).
thf(c_0_38,plain,
! [X5: qML_mu > qML_i > $o,X2: qML_mu > qML_i > $o,X1: qML_i] :
( ( qML_r @ X1 @ ( esk1_3 @ X1 @ X2 @ X5 ) )
| ( inconsistency_P @ X5 @ X1 )
| ~ ( inconsistency_P @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_39,plain,
! [X1: qML_i] :
~ ( qML_r @ esk54_0 @ X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]) ).
thf(c_0_40,plain,
! [X2: qML_mu > qML_i > $o,X1: qML_i] :
( ( qML_r @ X1 @ ( esk1_3 @ X1 @ incons1905966852QML_mu @ X2 ) )
| ( inconsistency_P @ X2 @ X1 ) ),
inference(spm,[status(thm)],[c_0_38,c_0_22]) ).
thf(c_0_41,plain,
! [X1: qML_i] :
~ ( inconsistency_P
@ ^ [Z0: qML_mu,Z1: qML_i] :
~ ( incons1905966852QML_mu @ Z0 @ Z1 )
@ X1 ),
inference(spm,[status(thm)],[c_0_12,c_0_22]) ).
thf(c_0_42,plain,
! [X2: qML_mu > qML_i > $o] : ( inconsistency_P @ X2 @ esk54_0 ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
thf(c_0_43,plain,
$false,
inference(spm,[status(thm)],[c_0_41,c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : PHI007^5 : TPTP v8.2.0. Released v6.4.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n012.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Sat May 18 14:42:22 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.45 Running higher-order theorem proving
% 0.16/0.45 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.16/0.49 # Version: 3.1.0-ho
% 0.16/0.49 # Preprocessing class: HSMSSMSSSSMNHFA.
% 0.16/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.49 # Starting ehoh_best_nonlift with 1500s (5) cores
% 0.16/0.49 # Starting lpo6_lambda_fix with 300s (1) cores
% 0.16/0.49 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.16/0.49 # Starting ehoh_best3_fo with 300s (1) cores
% 0.16/0.49 # ehoh_best_nonlift with pid 3908 completed with status 0
% 0.16/0.49 # Result found by ehoh_best_nonlift
% 0.16/0.49 # Preprocessing class: HSMSSMSSSSMNHFA.
% 0.16/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.49 # Starting ehoh_best_nonlift with 1500s (5) cores
% 0.16/0.49 # No SInE strategy applied
% 0.16/0.49 # Search class: HGHNS-FFMF33-MHFFFSBN
% 0.16/0.49 # partial match(3): HGHNS-FFMF32-SHSFFSBN
% 0.16/0.49 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.49 # Starting ho_unfolding_3 with 901s (1) cores
% 0.16/0.49 # Starting ehoh_best_nonlift_rwall with 151s (1) cores
% 0.16/0.49 # Starting ehoh_best_nonlift_nonlambdatoforall with 151s (1) cores
% 0.16/0.49 # Starting ehoh_best8_lambda with 151s (1) cores
% 0.16/0.49 # Starting ehoh_best_nonlift with 146s (1) cores
% 0.16/0.49 # ehoh_best8_lambda with pid 3916 completed with status 0
% 0.16/0.49 # Result found by ehoh_best8_lambda
% 0.16/0.49 # Preprocessing class: HSMSSMSSSSMNHFA.
% 0.16/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.49 # Starting ehoh_best_nonlift with 1500s (5) cores
% 0.16/0.49 # No SInE strategy applied
% 0.16/0.49 # Search class: HGHNS-FFMF33-MHFFFSBN
% 0.16/0.49 # partial match(3): HGHNS-FFMF32-SHSFFSBN
% 0.16/0.49 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.49 # Starting ho_unfolding_3 with 901s (1) cores
% 0.16/0.49 # Starting ehoh_best_nonlift_rwall with 151s (1) cores
% 0.16/0.49 # Starting ehoh_best_nonlift_nonlambdatoforall with 151s (1) cores
% 0.16/0.49 # Starting ehoh_best8_lambda with 151s (1) cores
% 0.16/0.49 # Preprocessing time : 0.001 s
% 0.16/0.49 # Presaturation interreduction done
% 0.16/0.49
% 0.16/0.49 # Proof found!
% 0.16/0.49 # SZS status ContradictoryAxioms
% 0.16/0.49 # SZS output start CNFRefutation
% See solution above
% 0.16/0.49 # Parsed axioms : 17
% 0.16/0.49 # Removed by relevancy pruning/SinE : 0
% 0.16/0.49 # Initial clauses : 28
% 0.16/0.49 # Removed in clause preprocessing : 8
% 0.16/0.49 # Initial clauses in saturation : 20
% 0.16/0.49 # Processed clauses : 265
% 0.16/0.49 # ...of these trivial : 0
% 0.16/0.49 # ...subsumed : 42
% 0.16/0.49 # ...remaining for further processing : 223
% 0.16/0.49 # Other redundant clauses eliminated : 48
% 0.16/0.49 # Clauses deleted for lack of memory : 0
% 0.16/0.49 # Backward-subsumed : 5
% 0.16/0.49 # Backward-rewritten : 18
% 0.16/0.49 # Generated clauses : 738
% 0.16/0.49 # ...of the previous two non-redundant : 579
% 0.16/0.49 # ...aggressively subsumed : 0
% 0.16/0.49 # Contextual simplify-reflections : 0
% 0.16/0.49 # Paramodulations : 482
% 0.16/0.49 # Factorizations : 0
% 0.16/0.49 # NegExts : 87
% 0.16/0.49 # Equation resolutions : 51
% 0.16/0.49 # Disequality decompositions : 0
% 0.16/0.49 # Total rewrite steps : 84
% 0.16/0.49 # ...of those cached : 28
% 0.16/0.49 # Propositional unsat checks : 0
% 0.16/0.49 # Propositional check models : 0
% 0.16/0.49 # Propositional check unsatisfiable : 0
% 0.16/0.49 # Propositional clauses : 0
% 0.16/0.49 # Propositional clauses after purity: 0
% 0.16/0.49 # Propositional unsat core size : 0
% 0.16/0.49 # Propositional preprocessing time : 0.000
% 0.16/0.49 # Propositional encoding time : 0.000
% 0.16/0.49 # Propositional solver time : 0.000
% 0.16/0.49 # Success case prop preproc time : 0.000
% 0.16/0.49 # Success case prop encoding time : 0.000
% 0.16/0.49 # Success case prop solver time : 0.000
% 0.16/0.49 # Current number of processed clauses : 168
% 0.16/0.49 # Positive orientable unit clauses : 32
% 0.16/0.49 # Positive unorientable unit clauses: 0
% 0.16/0.49 # Negative unit clauses : 20
% 0.16/0.49 # Non-unit-clauses : 116
% 0.16/0.49 # Current number of unprocessed clauses: 311
% 0.16/0.49 # ...number of literals in the above : 808
% 0.16/0.49 # Current number of archived formulas : 0
% 0.16/0.49 # Current number of archived clauses : 55
% 0.16/0.49 # Clause-clause subsumption calls (NU) : 1621
% 0.16/0.49 # Rec. Clause-clause subsumption calls : 1192
% 0.16/0.49 # Non-unit clause-clause subsumptions : 23
% 0.16/0.49 # Unit Clause-clause subsumption calls : 300
% 0.16/0.49 # Rewrite failures with RHS unbound : 0
% 0.16/0.49 # BW rewrite match attempts : 19
% 0.16/0.49 # BW rewrite match successes : 18
% 0.16/0.49 # Condensation attempts : 0
% 0.16/0.49 # Condensation successes : 0
% 0.16/0.49 # Termbank termtop insertions : 29315
% 0.16/0.49 # Search garbage collected termcells : 617
% 0.16/0.49
% 0.16/0.49 # -------------------------------------------------
% 0.16/0.49 # User time : 0.034 s
% 0.16/0.49 # System time : 0.002 s
% 0.16/0.49 # Total time : 0.035 s
% 0.16/0.49 # Maximum resident set size: 1920 pages
% 0.16/0.49
% 0.16/0.49 # -------------------------------------------------
% 0.16/0.49 # User time : 0.152 s
% 0.16/0.49 # System time : 0.013 s
% 0.16/0.49 # Total time : 0.165 s
% 0.16/0.49 # Maximum resident set size: 1744 pages
% 0.16/0.49 % E---3.1 exiting
% 0.16/0.49 % E exiting
%------------------------------------------------------------------------------