TSTP Solution File: SEV198^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV198^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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 04:07:58 EDT 2024
% Result : Theorem 4.27s 1.21s
% Output : CNFRefutation 4.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of formulae : 33 ( 9 unt; 13 typ; 0 def)
% Number of atoms : 133 ( 107 equ; 0 cnn)
% Maximal formula atoms : 79 ( 6 avg)
% Number of connectives : 747 ( 49 ~; 135 |; 42 &; 511 @)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 38 ( 12 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 98 ( 98 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 12 usr; 4 con; 0-2 aty)
% Number of variables : 118 ( 60 ^ 46 !; 12 ?; 118 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
c0: a ).
thf(decl_23,type,
x: a ).
thf(decl_24,type,
cP: a > a > a ).
thf(decl_25,type,
esk1_1: ( a > a > a > $o ) > a ).
thf(decl_26,type,
esk2_1: ( a > a > a > $o ) > a ).
thf(decl_27,type,
esk3_1: ( a > a > a > $o ) > a ).
thf(decl_28,type,
esk4_1: ( a > a > a > $o ) > a ).
thf(decl_29,type,
esk5_1: ( a > a > a > $o ) > a ).
thf(decl_30,type,
esk6_1: ( a > a > a > $o ) > a ).
thf(decl_31,type,
esk7_1: ( a > a > a > $o ) > a ).
thf(decl_32,type,
esk8_1: ( a > a > a > $o ) > a ).
thf(decl_33,type,
esk9_1: ( a > a > a > $o ) > a ).
thf(cS_INCL_LEM6_pme,conjecture,
( ( ! [X1: a,X2: a,X3: a,X4: a] :
( ( ( cP @ X1 @ X3 )
= ( cP @ X2 @ X4 ) )
=> ( ( X1 = X2 )
& ( X3 = X4 ) ) )
& ! [X1: a,X2: a] :
( ( cP @ X1 @ X2 )
!= c0 ) )
=> ( ! [X5: a > a > a > $o] :
( ( $true
& ! [X6: a,X7: a,X8: a] :
( ( ( ( X6 = c0 )
& ( X7 = X8 ) )
| ( ( X7 = c0 )
& ( X6 = X8 ) )
| ? [X9: a,X10: a,X11: a,X12: a,X13: a,X14: a] :
( ( X6
= ( cP @ X9 @ X10 ) )
& ( X7
= ( cP @ X11 @ X12 ) )
& ( X8
= ( cP @ X13 @ X14 ) )
& ( X5 @ X9 @ X11 @ X13 )
& ( X5 @ X10 @ X12 @ X14 ) ) )
=> ( X5 @ X6 @ X7 @ X8 ) ) )
=> ( X5 @ x @ c0 @ c0 ) )
=> ( x = c0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cS_INCL_LEM6_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ( ! [X1: a,X2: a,X3: a,X4: a] :
( ( ( cP @ X1 @ X3 )
= ( cP @ X2 @ X4 ) )
=> ( ( X1 = X2 )
& ( X3 = X4 ) ) )
& ! [X1: a,X2: a] :
( ( cP @ X1 @ X2 )
!= c0 ) )
=> ( ! [X5: a > a > a > $o] :
( ( $true
& ! [X6: a,X7: a,X8: a] :
( ( ( ( X6 = c0 )
& ( X7 = X8 ) )
| ( ( X7 = c0 )
& ( X6 = X8 ) )
| ? [X9: a,X10: a,X11: a,X12: a,X13: a,X14: a] :
( ( X6
= ( cP @ X9 @ X10 ) )
& ( X7
= ( cP @ X11 @ X12 ) )
& ( X8
= ( cP @ X13 @ X14 ) )
& ( X5 @ X9 @ X11 @ X13 )
& ( X5 @ X10 @ X12 @ X14 ) ) )
=> ( X5 @ X6 @ X7 @ X8 ) ) )
=> ( X5 @ x @ c0 @ c0 ) )
=> ( x = c0 ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cS_INCL_LEM6_pme])]) ).
thf(c_0_2,negated_conjecture,
! [X31: a,X32: a,X33: a,X34: a,X35: a,X36: a,X37: a > a > a > $o] :
( ( ( X31 = X32 )
| ( ( cP @ X31 @ X33 )
!= ( cP @ X32 @ X34 ) ) )
& ( ( X33 = X34 )
| ( ( cP @ X31 @ X33 )
!= ( cP @ X32 @ X34 ) ) )
& ( ( cP @ X35 @ X36 )
!= c0 )
& ( ( ( esk1_1 @ X37 )
= ( cP @ ( esk4_1 @ X37 ) @ ( esk5_1 @ X37 ) ) )
| ( ( esk2_1 @ X37 )
= c0 )
| ( ( esk1_1 @ X37 )
= c0 )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( ( esk2_1 @ X37 )
= ( cP @ ( esk6_1 @ X37 ) @ ( esk7_1 @ X37 ) ) )
| ( ( esk2_1 @ X37 )
= c0 )
| ( ( esk1_1 @ X37 )
= c0 )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( ( esk3_1 @ X37 )
= ( cP @ ( esk8_1 @ X37 ) @ ( esk9_1 @ X37 ) ) )
| ( ( esk2_1 @ X37 )
= c0 )
| ( ( esk1_1 @ X37 )
= c0 )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( X37 @ ( esk4_1 @ X37 ) @ ( esk6_1 @ X37 ) @ ( esk8_1 @ X37 ) )
| ( ( esk2_1 @ X37 )
= c0 )
| ( ( esk1_1 @ X37 )
= c0 )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( X37 @ ( esk5_1 @ X37 ) @ ( esk7_1 @ X37 ) @ ( esk9_1 @ X37 ) )
| ( ( esk2_1 @ X37 )
= c0 )
| ( ( esk1_1 @ X37 )
= c0 )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( ( esk1_1 @ X37 )
= ( cP @ ( esk4_1 @ X37 ) @ ( esk5_1 @ X37 ) ) )
| ( ( esk1_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ( ( esk1_1 @ X37 )
= c0 )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( ( esk2_1 @ X37 )
= ( cP @ ( esk6_1 @ X37 ) @ ( esk7_1 @ X37 ) ) )
| ( ( esk1_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ( ( esk1_1 @ X37 )
= c0 )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( ( esk3_1 @ X37 )
= ( cP @ ( esk8_1 @ X37 ) @ ( esk9_1 @ X37 ) ) )
| ( ( esk1_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ( ( esk1_1 @ X37 )
= c0 )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( X37 @ ( esk4_1 @ X37 ) @ ( esk6_1 @ X37 ) @ ( esk8_1 @ X37 ) )
| ( ( esk1_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ( ( esk1_1 @ X37 )
= c0 )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( X37 @ ( esk5_1 @ X37 ) @ ( esk7_1 @ X37 ) @ ( esk9_1 @ X37 ) )
| ( ( esk1_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ( ( esk1_1 @ X37 )
= c0 )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( ( esk1_1 @ X37 )
= ( cP @ ( esk4_1 @ X37 ) @ ( esk5_1 @ X37 ) ) )
| ( ( esk2_1 @ X37 )
= c0 )
| ( ( esk2_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( ( esk2_1 @ X37 )
= ( cP @ ( esk6_1 @ X37 ) @ ( esk7_1 @ X37 ) ) )
| ( ( esk2_1 @ X37 )
= c0 )
| ( ( esk2_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( ( esk3_1 @ X37 )
= ( cP @ ( esk8_1 @ X37 ) @ ( esk9_1 @ X37 ) ) )
| ( ( esk2_1 @ X37 )
= c0 )
| ( ( esk2_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( X37 @ ( esk4_1 @ X37 ) @ ( esk6_1 @ X37 ) @ ( esk8_1 @ X37 ) )
| ( ( esk2_1 @ X37 )
= c0 )
| ( ( esk2_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( X37 @ ( esk5_1 @ X37 ) @ ( esk7_1 @ X37 ) @ ( esk9_1 @ X37 ) )
| ( ( esk2_1 @ X37 )
= c0 )
| ( ( esk2_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( ( esk1_1 @ X37 )
= ( cP @ ( esk4_1 @ X37 ) @ ( esk5_1 @ X37 ) ) )
| ( ( esk1_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ( ( esk2_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( ( esk2_1 @ X37 )
= ( cP @ ( esk6_1 @ X37 ) @ ( esk7_1 @ X37 ) ) )
| ( ( esk1_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ( ( esk2_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( ( esk3_1 @ X37 )
= ( cP @ ( esk8_1 @ X37 ) @ ( esk9_1 @ X37 ) ) )
| ( ( esk1_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ( ( esk2_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( X37 @ ( esk4_1 @ X37 ) @ ( esk6_1 @ X37 ) @ ( esk8_1 @ X37 ) )
| ( ( esk1_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ( ( esk2_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ( X37 @ ( esk5_1 @ X37 ) @ ( esk7_1 @ X37 ) @ ( esk9_1 @ X37 ) )
| ( ( esk1_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ( ( esk2_1 @ X37 )
= ( esk3_1 @ X37 ) )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( ~ ( X37 @ ( esk1_1 @ X37 ) @ ( esk2_1 @ X37 ) @ ( esk3_1 @ X37 ) )
| ~ $true
| ( X37 @ x @ c0 @ c0 ) )
& ( x != c0 ) ),
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_1])])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X5: a > a > a > $o] :
( ( X5 @ x @ c0 @ c0 )
| ~ ( X5 @ ( esk1_1 @ X5 ) @ ( esk2_1 @ X5 ) @ ( esk3_1 @ X5 ) )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X5: a > a > a > $o] :
( ( X5 @ x @ c0 @ c0 )
| ~ ( X5 @ ( esk1_1 @ X5 ) @ ( esk2_1 @ X5 ) @ ( esk3_1 @ X5 ) ) ),
inference(cn,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X5: a > a > a > $o] :
( ( ( esk3_1 @ X5 )
= ( cP @ ( esk8_1 @ X5 ) @ ( esk9_1 @ X5 ) ) )
| ( ( esk1_1 @ X5 )
= ( esk3_1 @ X5 ) )
| ( ( esk1_1 @ X5 )
= c0 )
| ( X5 @ x @ c0 @ c0 )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X51: a > a > a > $o,X50: a > a > a > $o] :
( ( X51 @ x @ c0 @ c0 )
| ( X50 @ x @ c0 @ c0 )
| ~ ( ( X51
@ ( esk1_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X51 @ Z0 @ Z1 @ Z2 )
| ( X50 @ Z0 @ Z1 @ Z2 ) ) )
@ ( esk2_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X51 @ Z0 @ Z1 @ Z2 )
| ( X50 @ Z0 @ Z1 @ Z2 ) ) )
@ ( esk3_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X51 @ Z0 @ Z1 @ Z2 )
| ( X50 @ Z0 @ Z1 @ Z2 ) ) ) )
| ( X50
@ ( esk1_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X51 @ Z0 @ Z1 @ Z2 )
| ( X50 @ Z0 @ Z1 @ Z2 ) ) )
@ ( esk2_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X51 @ Z0 @ Z1 @ Z2 )
| ( X50 @ Z0 @ Z1 @ Z2 ) ) )
@ ( esk3_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X51 @ Z0 @ Z1 @ Z2 )
| ( X50 @ Z0 @ Z1 @ Z2 ) ) ) ) ) ),
inference(primitive_enumeration,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X1: a,X2: a] :
( ( cP @ X1 @ X2 )
!= c0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
! [X5: a > a > a > $o] :
( ( ( esk1_1 @ X5 )
= c0 )
| ( ( esk3_1 @ X5 )
= ( esk1_1 @ X5 ) )
| ( ( esk3_1 @ X5 )
= ( cP @ ( esk8_1 @ X5 ) @ ( esk9_1 @ X5 ) ) )
| ( X5 @ x @ c0 @ c0 ) ),
inference(cn,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
! [X21: a > a > a > $o,X5: a > a > a > $o] :
( ( X5 @ x @ c0 @ c0 )
| ( X21 @ x @ c0 @ c0 )
| ~ ( X5
@ ( esk1_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X21 @ Z0 @ Z1 @ Z2 )
| ( X5 @ Z0 @ Z1 @ Z2 ) ) )
@ ( esk2_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X21 @ Z0 @ Z1 @ Z2 )
| ( X5 @ Z0 @ Z1 @ Z2 ) ) )
@ ( esk3_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X21 @ Z0 @ Z1 @ Z2 )
| ( X5 @ Z0 @ Z1 @ Z2 ) ) ) ) ),
inference(dynamic_cnf,[status(thm)],[c_0_6]) ).
thf(c_0_10,negated_conjecture,
! [X5: a > a > a > $o] :
( ( ( esk3_1 @ X5 )
= ( esk1_1 @ X5 ) )
| ( ( esk1_1 @ X5 )
= c0 )
| ( X5 @ x @ c0 @ c0 )
| ( ( esk3_1 @ X5 )
!= c0 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_11,negated_conjecture,
! [X5: a > a > a > $o] :
( ( ( esk3_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X5 @ Z0 @ Z1 @ Z2 )
| ( Z2 != c0 ) ) )
= c0 )
| ( X5 @ x @ c0 @ c0 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_9]) ).
thf(c_0_12,negated_conjecture,
! [X5: a > a > a > $o] :
( ( ( esk1_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X5 @ Z0 @ Z1 @ Z2 )
| ( Z2 != c0 ) ) )
= c0 )
| ( X5 @ x @ c0 @ c0 ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11])])]) ).
thf(c_0_13,negated_conjecture,
! [X5: a > a > a > $o] :
( ( X5 @ x @ c0 @ c0 )
| ~ ( ( X5 @ c0
@ ( esk2_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X5 @ Z0 @ Z1 @ Z2 )
| ( Z2 != c0 ) ) )
@ ( esk3_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X5 @ Z0 @ Z1 @ Z2 )
| ( Z2 != c0 ) ) ) )
| ( ( esk3_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X5 @ Z0 @ Z1 @ Z2 )
| ( Z2 != c0 ) ) )
!= c0 ) ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_12])])]) ).
thf(c_0_14,negated_conjecture,
! [X5: a > a > a > $o] :
( ( ( esk3_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X5 @ Z0 @ Z1 @ Z2 )
| ( Z2 != c0 ) ) )
= c0 )
| ( X5 @ x @ c0 @ c0 ) ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_13])]) ).
thf(c_0_15,negated_conjecture,
! [X21: a > a > a > $o,X5: a > a > a > $o] :
( ( X5 @ x @ c0 @ c0 )
| ( X21 @ x @ c0 @ c0 )
| ~ ( X21
@ ( esk1_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X21 @ Z0 @ Z1 @ Z2 )
| ( X5 @ Z0 @ Z1 @ Z2 ) ) )
@ ( esk2_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X21 @ Z0 @ Z1 @ Z2 )
| ( X5 @ Z0 @ Z1 @ Z2 ) ) )
@ ( esk3_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X21 @ Z0 @ Z1 @ Z2 )
| ( X5 @ Z0 @ Z1 @ Z2 ) ) ) ) ),
inference(dynamic_cnf,[status(thm)],[c_0_6]) ).
thf(c_0_16,negated_conjecture,
! [X5: a > a > a > $o] :
( ( ( esk1_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( X5 @ Z0 @ Z1 @ Z2 )
| ( Z2 != c0 ) ) )
= c0 )
| ( X5 @ x @ c0 @ c0 ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_14])])]) ).
thf(c_0_17,negated_conjecture,
! [X5: a > a > a > $o] :
( ( ( esk1_1
@ ^ [Z0: a,Z1: a,Z2: a] :
( ( Z0 != x )
| ( X5 @ Z0 @ Z1 @ Z2 ) ) )
= x )
| ( X5 @ x @ c0 @ c0 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_15]) ).
thf(c_0_18,negated_conjecture,
x != c0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17])])]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEV198^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n023.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % 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 18:39:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running higher-order theorem proving
% 0.19/0.46 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
% 4.27/1.21 # Version: 3.1.0-ho
% 4.27/1.21 # Preprocessing class: HSMSSMSSSSSNSSA.
% 4.27/1.21 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.27/1.21 # Starting post_as_ho1 with 1500s (5) cores
% 4.27/1.21 # Starting post_as_ho12 with 300s (1) cores
% 4.27/1.21 # Starting new_ho_3 with 300s (1) cores
% 4.27/1.21 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 4.27/1.21 # post_as_ho1 with pid 7031 completed with status 0
% 4.27/1.21 # Result found by post_as_ho1
% 4.27/1.21 # Preprocessing class: HSMSSMSSSSSNSSA.
% 4.27/1.21 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.27/1.21 # Starting post_as_ho1 with 1500s (5) cores
% 4.27/1.21 # No SInE strategy applied
% 4.27/1.21 # Search class: HGUSF-FFMF21-SSSFFMBN
% 4.27/1.21 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 4.27/1.21 # Starting ehoh_best2_full_lfho with 772s (1) cores
% 4.27/1.21 # Starting post_as_ho1 with 151s (1) cores
% 4.27/1.21 # Starting sh2lt with 145s (1) cores
% 4.27/1.21 # Starting full_lambda_9 with 145s (1) cores
% 4.27/1.21 # Starting new_bool_3 with 145s (1) cores
% 4.27/1.21 # post_as_ho1 with pid 7037 completed with status 9
% 4.27/1.21 # Starting lpo8_s with 142s (1) cores
% 4.27/1.21 # full_lambda_9 with pid 7041 completed with status 9
% 4.27/1.21 # lpo8_s with pid 7043 completed with status 9
% 4.27/1.21 # sh2lt with pid 7039 completed with status 9
% 4.27/1.21 # ehoh_best2_full_lfho with pid 7036 completed with status 0
% 4.27/1.21 # Result found by ehoh_best2_full_lfho
% 4.27/1.21 # Preprocessing class: HSMSSMSSSSSNSSA.
% 4.27/1.21 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.27/1.21 # Starting post_as_ho1 with 1500s (5) cores
% 4.27/1.21 # No SInE strategy applied
% 4.27/1.21 # Search class: HGUSF-FFMF21-SSSFFMBN
% 4.27/1.21 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 4.27/1.21 # Starting ehoh_best2_full_lfho with 772s (1) cores
% 4.27/1.21 # Preprocessing time : 0.001 s
% 4.27/1.21
% 4.27/1.21 # Proof found!
% 4.27/1.21 # SZS status Theorem
% 4.27/1.21 # SZS output start CNFRefutation
% See solution above
% 4.27/1.21 # Parsed axioms : 5
% 4.27/1.21 # Removed by relevancy pruning/SinE : 0
% 4.27/1.21 # Initial clauses : 29
% 4.27/1.21 # Removed in clause preprocessing : 4
% 4.27/1.21 # Initial clauses in saturation : 25
% 4.27/1.21 # Processed clauses : 2284
% 4.27/1.21 # ...of these trivial : 3
% 4.27/1.21 # ...subsumed : 1004
% 4.27/1.21 # ...remaining for further processing : 1277
% 4.27/1.21 # Other redundant clauses eliminated : 0
% 4.27/1.21 # Clauses deleted for lack of memory : 0
% 4.27/1.21 # Backward-subsumed : 107
% 4.27/1.21 # Backward-rewritten : 0
% 4.27/1.21 # Generated clauses : 12454
% 4.27/1.21 # ...of the previous two non-redundant : 11329
% 4.27/1.21 # ...aggressively subsumed : 0
% 4.27/1.21 # Contextual simplify-reflections : 0
% 4.27/1.21 # Paramodulations : 4924
% 4.27/1.21 # Factorizations : 3
% 4.27/1.21 # NegExts : 530
% 4.27/1.21 # Equation resolutions : 101
% 4.27/1.21 # Disequality decompositions : 0
% 4.27/1.21 # Total rewrite steps : 1230
% 4.27/1.21 # ...of those cached : 1225
% 4.27/1.21 # Propositional unsat checks : 0
% 4.27/1.21 # Propositional check models : 0
% 4.27/1.21 # Propositional check unsatisfiable : 0
% 4.27/1.21 # Propositional clauses : 0
% 4.27/1.21 # Propositional clauses after purity: 0
% 4.27/1.21 # Propositional unsat core size : 0
% 4.27/1.21 # Propositional preprocessing time : 0.000
% 4.27/1.21 # Propositional encoding time : 0.000
% 4.27/1.21 # Propositional solver time : 0.000
% 4.27/1.21 # Success case prop preproc time : 0.000
% 4.27/1.21 # Success case prop encoding time : 0.000
% 4.27/1.21 # Success case prop solver time : 0.000
% 4.27/1.21 # Current number of processed clauses : 989
% 4.27/1.21 # Positive orientable unit clauses : 8
% 4.27/1.21 # Positive unorientable unit clauses: 0
% 4.27/1.21 # Negative unit clauses : 2
% 4.27/1.21 # Non-unit-clauses : 979
% 4.27/1.21 # Current number of unprocessed clauses: 8692
% 4.27/1.21 # ...number of literals in the above : 63447
% 4.27/1.21 # Current number of archived formulas : 0
% 4.27/1.21 # Current number of archived clauses : 288
% 4.27/1.21 # Clause-clause subsumption calls (NU) : 114471
% 4.27/1.21 # Rec. Clause-clause subsumption calls : 10194
% 4.27/1.21 # Non-unit clause-clause subsumptions : 1046
% 4.27/1.21 # Unit Clause-clause subsumption calls : 156
% 4.27/1.21 # Rewrite failures with RHS unbound : 0
% 4.27/1.21 # BW rewrite match attempts : 5
% 4.27/1.21 # BW rewrite match successes : 3
% 4.27/1.21 # Condensation attempts : 0
% 4.27/1.21 # Condensation successes : 0
% 4.27/1.21 # Termbank termtop insertions : 963120
% 4.27/1.21 # Search garbage collected termcells : 574
% 4.27/1.21
% 4.27/1.21 # -------------------------------------------------
% 4.27/1.21 # User time : 1.183 s
% 4.27/1.21 # System time : 0.031 s
% 4.27/1.21 # Total time : 1.214 s
% 4.27/1.21 # Maximum resident set size: 1900 pages
% 4.27/1.21
% 4.27/1.21 # -------------------------------------------------
% 4.27/1.21 # User time : 1.902 s
% 4.27/1.21 # System time : 0.043 s
% 4.27/1.21 # Total time : 1.945 s
% 4.27/1.21 # Maximum resident set size: 1728 pages
% 4.27/1.21 % E---3.1 exiting
% 4.27/1.21 % E exiting
%------------------------------------------------------------------------------