TSTP Solution File: SEV094^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV094^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:34 EDT 2024
% Result : Theorem 0.64s 0.62s
% Output : CNFRefutation 0.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 46 ( 4 unt; 8 typ; 0 def)
% Number of atoms : 146 ( 61 equ; 0 cnn)
% Maximal formula atoms : 38 ( 3 avg)
% Number of connectives : 565 ( 79 ~; 87 |; 27 &; 358 @)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 8 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 36 ( 36 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 78 ( 12 ^ 58 !; 8 ?; 78 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
epred1_0: a > $o ).
thf(decl_23,type,
epred2_0: a > $o ).
thf(decl_24,type,
esk1_0: a > a ).
thf(decl_25,type,
esk2_1: a > a ).
thf(decl_26,type,
esk3_1: ( a > a ) > a ).
thf(decl_27,type,
esk4_1: ( a > a ) > a ).
thf(decl_28,type,
esk5_2: ( a > a ) > a > a ).
thf(cEQP1_1B_pme,conjecture,
! [X1: a > $o,X2: a > $o] :
( ? [X3: a > a] :
( ! [X4: a] :
( ( X1 @ X4 )
=> ( X2 @ ( X3 @ X4 ) ) )
& ! [X5: a] :
( ( X2 @ X5 )
=> ? [X4: a] :
( ( X1 @ X4 )
& ( X5
= ( X3 @ X4 ) )
& ! [X6: a] :
( ( ( X1 @ X6 )
& ( X5
= ( X3 @ X6 ) ) )
=> ( X6 = X4 ) ) ) ) )
=> ? [X3: a > a] :
( ! [X4: a] :
( ( X2 @ X4 )
=> ( X1 @ ( X3 @ X4 ) ) )
& ! [X5: a] :
( ( X1 @ X5 )
=> ? [X4: a] :
( ( X2 @ X4 )
& ( X5
= ( X3 @ X4 ) )
& ! [X6: a] :
( ( ( X2 @ X6 )
& ( X5
= ( X3 @ X6 ) ) )
=> ( X6 = X4 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cEQP1_1B_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a > $o,X2: a > $o] :
( ? [X3: a > a] :
( ! [X4: a] :
( ( X1 @ X4 )
=> ( X2 @ ( X3 @ X4 ) ) )
& ! [X5: a] :
( ( X2 @ X5 )
=> ? [X4: a] :
( ( X1 @ X4 )
& ( X5
= ( X3 @ X4 ) )
& ! [X6: a] :
( ( ( X1 @ X6 )
& ( X5
= ( X3 @ X6 ) ) )
=> ( X6 = X4 ) ) ) ) )
=> ? [X3: a > a] :
( ! [X4: a] :
( ( X2 @ X4 )
=> ( X1 @ ( X3 @ X4 ) ) )
& ! [X5: a] :
( ( X1 @ X5 )
=> ? [X4: a] :
( ( X2 @ X4 )
& ( X5
= ( X3 @ X4 ) )
& ! [X6: a] :
( ( ( X2 @ X6 )
& ( X5
= ( X3 @ X6 ) ) )
=> ( X6 = X4 ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[cEQP1_1B_pme]) ).
thf(c_0_2,negated_conjecture,
! [X22: a,X23: a,X25: a,X26: a > a,X29: a] :
( ( ~ ( epred1_0 @ X22 )
| ( epred2_0 @ ( esk1_0 @ X22 ) ) )
& ( ( epred1_0 @ ( esk2_1 @ X23 ) )
| ~ ( epred2_0 @ X23 ) )
& ( ( X23
= ( esk1_0 @ ( esk2_1 @ X23 ) ) )
| ~ ( epred2_0 @ X23 ) )
& ( ~ ( epred1_0 @ X25 )
| ( X23
!= ( esk1_0 @ X25 ) )
| ( X25
= ( esk2_1 @ X23 ) )
| ~ ( epred2_0 @ X23 ) )
& ( ( epred1_0 @ ( esk4_1 @ X26 ) )
| ( epred2_0 @ ( esk3_1 @ X26 ) ) )
& ( ( epred2_0 @ ( esk5_2 @ X26 @ X29 ) )
| ~ ( epred2_0 @ X29 )
| ( ( esk4_1 @ X26 )
!= ( X26 @ X29 ) )
| ( epred2_0 @ ( esk3_1 @ X26 ) ) )
& ( ( ( esk4_1 @ X26 )
= ( X26 @ ( esk5_2 @ X26 @ X29 ) ) )
| ~ ( epred2_0 @ X29 )
| ( ( esk4_1 @ X26 )
!= ( X26 @ X29 ) )
| ( epred2_0 @ ( esk3_1 @ X26 ) ) )
& ( ( ( esk5_2 @ X26 @ X29 )
!= X29 )
| ~ ( epred2_0 @ X29 )
| ( ( esk4_1 @ X26 )
!= ( X26 @ X29 ) )
| ( epred2_0 @ ( esk3_1 @ X26 ) ) )
& ( ( epred1_0 @ ( esk4_1 @ X26 ) )
| ~ ( epred1_0 @ ( X26 @ ( esk3_1 @ X26 ) ) ) )
& ( ( epred2_0 @ ( esk5_2 @ X26 @ X29 ) )
| ~ ( epred2_0 @ X29 )
| ( ( esk4_1 @ X26 )
!= ( X26 @ X29 ) )
| ~ ( epred1_0 @ ( X26 @ ( esk3_1 @ X26 ) ) ) )
& ( ( ( esk4_1 @ X26 )
= ( X26 @ ( esk5_2 @ X26 @ X29 ) ) )
| ~ ( epred2_0 @ X29 )
| ( ( esk4_1 @ X26 )
!= ( X26 @ X29 ) )
| ~ ( epred1_0 @ ( X26 @ ( esk3_1 @ X26 ) ) ) )
& ( ( ( esk5_2 @ X26 @ X29 )
!= X29 )
| ~ ( epred2_0 @ X29 )
| ( ( esk4_1 @ X26 )
!= ( X26 @ X29 ) )
| ~ ( epred1_0 @ ( X26 @ ( esk3_1 @ X26 ) ) ) ) ),
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,
! [X3: a > a] :
( ( epred1_0 @ ( esk4_1 @ X3 ) )
| ~ ( epred1_0 @ ( X3 @ ( esk3_1 @ X3 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X4: a] :
( ( epred1_0 @ ( esk2_1 @ X4 ) )
| ~ ( epred2_0 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X3: a > a,X4: a] :
( ( ( esk4_1 @ X3 )
= ( X3 @ ( esk5_2 @ X3 @ X4 ) ) )
| ( epred2_0 @ ( esk3_1 @ X3 ) )
| ~ ( epred2_0 @ X4 )
| ( ( esk4_1 @ X3 )
!= ( X3 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X4: a] :
( ( epred2_0 @ ( esk1_0 @ X4 ) )
| ~ ( epred1_0 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X3: a > a] :
( ( epred1_0
@ ( esk4_1
@ ^ [Z0: a] : ( esk2_1 @ ( X3 @ Z0 ) ) ) )
| ~ ( epred2_0
@ ( X3
@ ( esk3_1
@ ^ [Z0: a] : ( esk2_1 @ ( X3 @ Z0 ) ) ) ) ) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_8,negated_conjecture,
! [X3: a > a] :
( ( epred1_0 @ ( esk4_1 @ X3 ) )
| ( epred2_0 @ ( esk3_1 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
! [X3: a > a,X4: a] :
( ( epred2_0 @ ( esk5_2 @ X3 @ X4 ) )
| ( epred2_0 @ ( esk3_1 @ X3 ) )
| ~ ( epred2_0 @ X4 )
| ( ( esk4_1 @ X3 )
!= ( X3 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_10,negated_conjecture,
! [X3: a > a,X4: a] :
( ( ( esk4_1 @ X3 )
= ( X3 @ ( esk5_2 @ X3 @ ( esk1_0 @ X4 ) ) ) )
| ( epred2_0 @ ( esk3_1 @ X3 ) )
| ( ( esk4_1 @ X3 )
!= ( X3 @ ( esk1_0 @ X4 ) ) )
| ~ ( epred1_0 @ X4 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_11,negated_conjecture,
epred1_0 @ ( esk4_1 @ esk2_1 ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_12,negated_conjecture,
! [X4: a,X5: a] :
( ( X4
= ( esk2_1 @ X5 ) )
| ~ ( epred1_0 @ X4 )
| ( X5
!= ( esk1_0 @ X4 ) )
| ~ ( epred2_0 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_13,negated_conjecture,
! [X3: a > a,X4: a] :
( ( epred2_0 @ ( esk5_2 @ X3 @ ( esk1_0 @ X4 ) ) )
| ( epred2_0 @ ( esk3_1 @ X3 ) )
| ( ( esk4_1 @ X3 )
!= ( X3 @ ( esk1_0 @ X4 ) ) )
| ~ ( epred1_0 @ X4 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_6]) ).
thf(c_0_14,negated_conjecture,
! [X3: a > a] :
( ( ( esk4_1 @ X3 )
= ( X3 @ ( esk5_2 @ X3 @ ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) ) ) )
| ( epred2_0 @ ( esk3_1 @ X3 ) )
| ( ( esk4_1 @ X3 )
!= ( X3 @ ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) ) ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_15,negated_conjecture,
! [X4: a] :
( ( ( esk2_1 @ ( esk1_0 @ X4 ) )
= X4 )
| ~ ( epred1_0 @ X4 ) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_12]),c_0_6]) ).
thf(c_0_16,negated_conjecture,
! [X3: a > a] :
( ( epred2_0 @ ( esk5_2 @ X3 @ ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) ) )
| ( epred2_0 @ ( esk3_1 @ X3 ) )
| ( ( esk4_1 @ X3 )
!= ( X3 @ ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) ) ) ),
inference(spm,[status(thm)],[c_0_13,c_0_11]) ).
thf(c_0_17,negated_conjecture,
! [X4: a] :
( ( X4
= ( esk1_0 @ ( esk2_1 @ X4 ) ) )
| ~ ( epred2_0 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_18,negated_conjecture,
( ( ( esk2_1 @ ( esk5_2 @ esk2_1 @ ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) ) )
= ( esk4_1 @ esk2_1 ) )
| ( epred2_0 @ ( esk3_1 @ esk2_1 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_11])]) ).
thf(c_0_19,negated_conjecture,
( ( epred2_0 @ ( esk5_2 @ esk2_1 @ ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) ) )
| ( epred2_0 @ ( esk3_1 @ esk2_1 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_15]),c_0_11])]) ).
thf(c_0_20,negated_conjecture,
( ( ( esk5_2 @ esk2_1 @ ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) )
= ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) )
| ( epred2_0 @ ( esk3_1 @ esk2_1 ) ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
thf(c_0_21,negated_conjecture,
! [X4: a,X3: a > a] :
( ( ( esk4_1 @ X3 )
= ( X3 @ ( esk5_2 @ X3 @ X4 ) ) )
| ~ ( epred2_0 @ X4 )
| ( ( esk4_1 @ X3 )
!= ( X3 @ X4 ) )
| ~ ( epred1_0 @ ( X3 @ ( esk3_1 @ X3 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_22,negated_conjecture,
! [X3: a > a,X4: a] :
( ( epred2_0 @ ( esk3_1 @ X3 ) )
| ( ( esk5_2 @ X3 @ X4 )
!= X4 )
| ~ ( epred2_0 @ X4 )
| ( ( esk4_1 @ X3 )
!= ( X3 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_23,negated_conjecture,
( ( epred2_0 @ ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) )
| ( epred2_0 @ ( esk3_1 @ esk2_1 ) ) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_24,negated_conjecture,
( ( ( esk2_1 @ ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) )
= ( esk4_1 @ esk2_1 ) )
| ( epred2_0 @ ( esk3_1 @ esk2_1 ) ) ),
inference(spm,[status(thm)],[c_0_18,c_0_20]) ).
thf(c_0_25,negated_conjecture,
! [X4: a,X3: a > a] :
( ( epred2_0 @ ( esk5_2 @ X3 @ X4 ) )
| ~ ( epred2_0 @ X4 )
| ( ( esk4_1 @ X3 )
!= ( X3 @ X4 ) )
| ~ ( epred1_0 @ ( X3 @ ( esk3_1 @ X3 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_26,negated_conjecture,
! [X4: a,X3: a > a] :
( ( ( esk5_2 @ X3 @ X4 )
!= X4 )
| ~ ( epred2_0 @ X4 )
| ( ( esk4_1 @ X3 )
!= ( X3 @ X4 ) )
| ~ ( epred1_0 @ ( X3 @ ( esk3_1 @ X3 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_27,negated_conjecture,
! [X3: a > a,X4: a] :
( ( ( esk4_1
@ ^ [Z0: a] : ( esk2_1 @ ( X3 @ Z0 ) ) )
= ( esk2_1
@ ( X3
@ ( esk5_2
@ ^ [Z0: a] : ( esk2_1 @ ( X3 @ Z0 ) )
@ X4 ) ) ) )
| ( ( esk4_1
@ ^ [Z0: a] : ( esk2_1 @ ( X3 @ Z0 ) ) )
!= ( esk2_1 @ ( X3 @ X4 ) ) )
| ~ ( epred2_0
@ ( X3
@ ( esk3_1
@ ^ [Z0: a] : ( esk2_1 @ ( X3 @ Z0 ) ) ) ) )
| ~ ( epred2_0 @ X4 ) ),
inference(spm,[status(thm)],[c_0_21,c_0_4]) ).
thf(c_0_28,negated_conjecture,
epred2_0 @ ( esk3_1 @ esk2_1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_20]),c_0_23]),c_0_24]) ).
thf(c_0_29,negated_conjecture,
! [X3: a > a,X4: a] :
( ( epred2_0
@ ( esk5_2
@ ^ [Z0: a] : ( esk2_1 @ ( X3 @ Z0 ) )
@ X4 ) )
| ( ( esk4_1
@ ^ [Z0: a] : ( esk2_1 @ ( X3 @ Z0 ) ) )
!= ( esk2_1 @ ( X3 @ X4 ) ) )
| ~ ( epred2_0
@ ( X3
@ ( esk3_1
@ ^ [Z0: a] : ( esk2_1 @ ( X3 @ Z0 ) ) ) ) )
| ~ ( epred2_0 @ X4 ) ),
inference(spm,[status(thm)],[c_0_25,c_0_4]) ).
thf(c_0_30,negated_conjecture,
! [X3: a > a,X4: a] :
( ( ( esk4_1
@ ^ [Z0: a] : ( esk2_1 @ ( X3 @ Z0 ) ) )
!= ( esk2_1 @ ( X3 @ X4 ) ) )
| ( ( esk5_2
@ ^ [Z0: a] : ( esk2_1 @ ( X3 @ Z0 ) )
@ X4 )
!= X4 )
| ~ ( epred2_0
@ ( X3
@ ( esk3_1
@ ^ [Z0: a] : ( esk2_1 @ ( X3 @ Z0 ) ) ) ) )
| ~ ( epred2_0 @ X4 ) ),
inference(spm,[status(thm)],[c_0_26,c_0_4]) ).
thf(c_0_31,negated_conjecture,
! [X4: a] :
( ( ( esk2_1 @ ( esk5_2 @ esk2_1 @ X4 ) )
= ( esk4_1 @ esk2_1 ) )
| ( ( esk4_1 @ esk2_1 )
!= ( esk2_1 @ X4 ) )
| ~ ( epred2_0 @ X4 ) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
thf(c_0_32,negated_conjecture,
! [X4: a] :
( ( epred2_0 @ ( esk5_2 @ esk2_1 @ X4 ) )
| ( ( esk4_1 @ esk2_1 )
!= ( esk2_1 @ X4 ) )
| ~ ( epred2_0 @ X4 ) ),
inference(spm,[status(thm)],[c_0_29,c_0_28]) ).
thf(c_0_33,negated_conjecture,
! [X4: a] :
( ( ( esk4_1 @ esk2_1 )
!= ( esk2_1 @ X4 ) )
| ( ( esk5_2 @ esk2_1 @ X4 )
!= X4 )
| ~ ( epred2_0 @ X4 ) ),
inference(spm,[status(thm)],[c_0_30,c_0_28]) ).
thf(c_0_34,negated_conjecture,
! [X4: a] :
( ( ( esk1_0 @ ( esk4_1 @ esk2_1 ) )
= ( esk5_2 @ esk2_1 @ X4 ) )
| ( ( esk4_1 @ esk2_1 )
!= ( esk2_1 @ X4 ) )
| ~ ( epred2_0 @ X4 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_31]),c_0_32]) ).
thf(c_0_35,negated_conjecture,
( ( ( esk2_1 @ ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) )
!= ( esk4_1 @ esk2_1 ) )
| ~ ( epred2_0 @ ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) ) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34])]) ).
thf(c_0_36,negated_conjecture,
~ ( epred2_0 @ ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_15]),c_0_11])]) ).
thf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_6]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEV094^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 18:22:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.49 Running higher-order theorem proving
% 0.21/0.49 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/benchmark/theBenchmark.p
% 0.64/0.62 # Version: 3.1.0-ho
% 0.64/0.62 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.64/0.62 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.62 # Starting post_as_ho12 with 300s (1) cores
% 0.64/0.62 # Starting new_bool_9 with 300s (1) cores
% 0.64/0.62 # Starting post_as_ho1 with 300s (1) cores
% 0.64/0.62 # Starting post_as_ho4 with 300s (1) cores
% 0.64/0.62 # Starting post_as_ho2 with 300s (1) cores
% 0.64/0.62 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.64/0.62 # Starting full_lambda_10 with 300s (1) cores
% 0.64/0.62 # Starting new_ho_8 with 300s (1) cores
% 0.64/0.62 # new_ho_8 with pid 28805 completed with status 0
% 0.64/0.62 # Result found by new_ho_8
% 0.64/0.62 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.64/0.62 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.62 # Starting post_as_ho12 with 300s (1) cores
% 0.64/0.62 # Starting new_bool_9 with 300s (1) cores
% 0.64/0.62 # Starting post_as_ho1 with 300s (1) cores
% 0.64/0.62 # Starting post_as_ho4 with 300s (1) cores
% 0.64/0.62 # Starting post_as_ho2 with 300s (1) cores
% 0.64/0.62 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.64/0.62 # Starting full_lambda_10 with 300s (1) cores
% 0.64/0.62 # Starting new_ho_8 with 300s (1) cores
% 0.64/0.62 # SinE strategy is GSinE(CountTerms,hypos,10,,2,20000,1.0,true)
% 0.64/0.62 # Search class: HGHSF-FFSF21-SSSFFMNN
% 0.64/0.62 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.64/0.62 # Starting post_as_ho5 with 181s (1) cores
% 0.64/0.62 # post_as_ho5 with pid 28807 completed with status 0
% 0.64/0.62 # Result found by post_as_ho5
% 0.64/0.62 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.64/0.62 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.62 # Starting post_as_ho12 with 300s (1) cores
% 0.64/0.62 # Starting new_bool_9 with 300s (1) cores
% 0.64/0.62 # Starting post_as_ho1 with 300s (1) cores
% 0.64/0.62 # Starting post_as_ho4 with 300s (1) cores
% 0.64/0.62 # Starting post_as_ho2 with 300s (1) cores
% 0.64/0.62 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.64/0.62 # Starting full_lambda_10 with 300s (1) cores
% 0.64/0.62 # Starting new_ho_8 with 300s (1) cores
% 0.64/0.62 # SinE strategy is GSinE(CountTerms,hypos,10,,2,20000,1.0,true)
% 0.64/0.62 # Search class: HGHSF-FFSF21-SSSFFMNN
% 0.64/0.62 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.64/0.62 # Starting post_as_ho5 with 181s (1) cores
% 0.64/0.62 # Preprocessing time : 0.001 s
% 0.64/0.62 # Presaturation interreduction done
% 0.64/0.62
% 0.64/0.62 # Proof found!
% 0.64/0.62 # SZS status Theorem
% 0.64/0.62 # SZS output start CNFRefutation
% See solution above
% 0.64/0.62 # Parsed axioms : 2
% 0.64/0.62 # Removed by relevancy pruning/SinE : 1
% 0.64/0.62 # Initial clauses : 12
% 0.64/0.62 # Removed in clause preprocessing : 0
% 0.64/0.62 # Initial clauses in saturation : 12
% 0.64/0.62 # Processed clauses : 245
% 0.64/0.62 # ...of these trivial : 0
% 0.64/0.62 # ...subsumed : 26
% 0.64/0.62 # ...remaining for further processing : 219
% 0.64/0.62 # Other redundant clauses eliminated : 3
% 0.64/0.62 # Clauses deleted for lack of memory : 0
% 0.64/0.62 # Backward-subsumed : 3
% 0.64/0.62 # Backward-rewritten : 14
% 0.64/0.62 # Generated clauses : 839
% 0.64/0.62 # ...of the previous two non-redundant : 806
% 0.64/0.62 # ...aggressively subsumed : 0
% 0.64/0.62 # Contextual simplify-reflections : 6
% 0.64/0.62 # Paramodulations : 812
% 0.64/0.62 # Factorizations : 0
% 0.64/0.62 # NegExts : 2
% 0.64/0.62 # Equation resolutions : 4
% 0.64/0.62 # Disequality decompositions : 0
% 0.64/0.62 # Total rewrite steps : 92
% 0.64/0.62 # ...of those cached : 84
% 0.64/0.62 # Propositional unsat checks : 0
% 0.64/0.62 # Propositional check models : 0
% 0.64/0.62 # Propositional check unsatisfiable : 0
% 0.64/0.62 # Propositional clauses : 0
% 0.64/0.62 # Propositional clauses after purity: 0
% 0.64/0.62 # Propositional unsat core size : 0
% 0.64/0.62 # Propositional preprocessing time : 0.000
% 0.64/0.62 # Propositional encoding time : 0.000
% 0.64/0.62 # Propositional solver time : 0.000
% 0.64/0.62 # Success case prop preproc time : 0.000
% 0.64/0.62 # Success case prop encoding time : 0.000
% 0.64/0.62 # Success case prop solver time : 0.000
% 0.64/0.62 # Current number of processed clauses : 189
% 0.64/0.62 # Positive orientable unit clauses : 9
% 0.64/0.62 # Positive unorientable unit clauses: 0
% 0.64/0.62 # Negative unit clauses : 1
% 0.64/0.62 # Non-unit-clauses : 179
% 0.64/0.62 # Current number of unprocessed clauses: 555
% 0.64/0.62 # ...number of literals in the above : 3013
% 0.64/0.62 # Current number of archived formulas : 0
% 0.64/0.62 # Current number of archived clauses : 29
% 0.64/0.62 # Clause-clause subsumption calls (NU) : 3995
% 0.64/0.62 # Rec. Clause-clause subsumption calls : 713
% 0.64/0.62 # Non-unit clause-clause subsumptions : 34
% 0.64/0.62 # Unit Clause-clause subsumption calls : 104
% 0.64/0.62 # Rewrite failures with RHS unbound : 0
% 0.64/0.62 # BW rewrite match attempts : 71
% 0.64/0.62 # BW rewrite match successes : 3
% 0.64/0.62 # Condensation attempts : 0
% 0.64/0.62 # Condensation successes : 0
% 0.64/0.62 # Termbank termtop insertions : 318093
% 0.64/0.62 # Search garbage collected termcells : 401
% 0.64/0.62
% 0.64/0.62 # -------------------------------------------------
% 0.64/0.62 # User time : 0.108 s
% 0.64/0.62 # System time : 0.009 s
% 0.64/0.62 # Total time : 0.117 s
% 0.64/0.62 # Maximum resident set size: 1912 pages
% 0.64/0.62
% 0.64/0.62 # -------------------------------------------------
% 0.64/0.62 # User time : 0.110 s
% 0.64/0.62 # System time : 0.011 s
% 0.64/0.62 # Total time : 0.121 s
% 0.64/0.62 # Maximum resident set size: 1720 pages
% 0.64/0.62 % E---3.1 exiting
% 0.64/0.62 % E exiting
%------------------------------------------------------------------------------