TSTP Solution File: SEV300^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV300^5 : TPTP v8.2.0. Bugfixed v6.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:08:09 EDT 2024
% Result : Theorem 0.15s 0.46s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 13
% Syntax : Number of formulae : 56 ( 10 unt; 9 typ; 0 def)
% Number of atoms : 164 ( 84 equ; 0 cnn)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 337 ( 58 ~; 91 |; 18 &; 164 @)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 34 ( 34 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 74 ( 13 ^ 49 !; 12 ?; 74 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
cONE: ( $i > $o ) > $o ).
thf(decl_23,type,
cSUCC: ( ( $i > $o ) > $o ) > ( $i > $o ) > $o ).
thf(decl_24,type,
cZERO: ( $i > $o ) > $o ).
thf(decl_25,type,
esk1_2: ( $i > $i ) > ( $i > $i ) > $i ).
thf(decl_26,type,
epred1_0: $i > $o ).
thf(decl_27,type,
esk2_1: $i > $i ).
thf(decl_28,type,
esk3_1: $i > $i ).
thf(decl_29,type,
esk4_0: $i ).
thf(decl_30,type,
esk5_0: $i ).
thf(cSUCC_def,axiom,
( cSUCC
= ( ^ [X3: ( $i > $o ) > $o,X1: $i > $o] :
? [X2: $i] :
( ( X1 @ X2 )
& ( X3
@ ^ [X4: $i] :
( ( X4 != X2 )
& ( X1 @ X4 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cSUCC_def) ).
thf(cZERO_def,axiom,
( cZERO
= ( ^ [X1: $i > $o] :
~ ? [X2: $i] : ( X1 @ X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cZERO_def) ).
thf(cONE_def,axiom,
( cONE
= ( ^ [Z0: $i > $o] :
? [X13: $i] :
( ( Z0 @ X13 )
& ~ ? [X12: $i] :
( ( X12 != X13 )
& ( Z0 @ X12 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cONE_def) ).
thf(cX6101_EXT_pme,conjecture,
( ! [X5: $i > $i,X6: $i > $i] :
( ! [X2: $i] :
( ( X5 @ X2 )
= ( X6 @ X2 ) )
=> ( X5 = X6 ) )
=> ( cONE
= ( ^ [X7: $i > $o] :
? [X8: $i] :
( X7
= ( ^ [X2: $i,X8: $i] : ( X2 = X8 )
@ X8 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cX6101_EXT_pme) ).
thf(c_0_4,plain,
( cSUCC
= ( ^ [Z0: ( $i > $o ) > $o,Z1: $i > $o] :
? [X2: $i] :
( ( Z1 @ X2 )
& ( Z0
@ ^ [Z2: $i] :
( ( Z2 != X2 )
& ( Z1 @ Z2 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[cSUCC_def]) ).
thf(c_0_5,plain,
( cZERO
= ( ^ [Z0: $i > $o] :
~ ? [X2: $i] : ( Z0 @ X2 ) ) ),
inference(fof_simplification,[status(thm)],[cZERO_def]) ).
thf(c_0_6,axiom,
( cONE
= ( ^ [Z0: $i > $o] :
? [X13: $i] :
( ( Z0 @ X13 )
& ~ ? [X12: $i] :
( ( X12 != X13 )
& ( Z0 @ X12 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[cONE_def,c_0_4]),c_0_5]) ).
thf(c_0_7,negated_conjecture,
~ ( ! [X5: $i > $i,X6: $i > $i] :
( ! [X2: $i] :
( ( X5 @ X2 )
= ( X6 @ X2 ) )
=> ( X5 = X6 ) )
=> ! [X16: $i > $o] :
( ? [X14: $i] :
( ( X16 @ X14 )
& ~ ? [X15: $i] :
( ( X15 != X14 )
& ( X16 @ X15 ) ) )
<=> ? [X8: $i] :
! [X17: $i] :
( ( X16 @ X17 )
<=> ( X8 = X17 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cX6101_EXT_pme])]),c_0_6])])]) ).
thf(c_0_8,negated_conjecture,
! [X18: $i > $i,X19: $i > $i,X22: $i,X24: $i,X27: $i,X29: $i] :
( ( ( ( X18 @ ( esk1_2 @ X18 @ X19 ) )
!= ( X19 @ ( esk1_2 @ X18 @ X19 ) ) )
| ( X18 = X19 ) )
& ( ~ ( epred1_0 @ ( esk3_1 @ X24 ) )
| ( X24
!= ( esk3_1 @ X24 ) )
| ( ( esk2_1 @ X22 )
!= X22 )
| ~ ( epred1_0 @ X22 ) )
& ( ( epred1_0 @ ( esk3_1 @ X24 ) )
| ( X24
= ( esk3_1 @ X24 ) )
| ( ( esk2_1 @ X22 )
!= X22 )
| ~ ( epred1_0 @ X22 ) )
& ( ~ ( epred1_0 @ ( esk3_1 @ X24 ) )
| ( X24
!= ( esk3_1 @ X24 ) )
| ( epred1_0 @ ( esk2_1 @ X22 ) )
| ~ ( epred1_0 @ X22 ) )
& ( ( epred1_0 @ ( esk3_1 @ X24 ) )
| ( X24
= ( esk3_1 @ X24 ) )
| ( epred1_0 @ ( esk2_1 @ X22 ) )
| ~ ( epred1_0 @ X22 ) )
& ( ~ ( epred1_0 @ X29 )
| ( esk5_0 = X29 )
| ( epred1_0 @ esk4_0 ) )
& ( ( esk5_0 != X29 )
| ( epred1_0 @ X29 )
| ( epred1_0 @ esk4_0 ) )
& ( ~ ( epred1_0 @ X29 )
| ( esk5_0 = X29 )
| ( X27 = esk4_0 )
| ~ ( epred1_0 @ X27 ) )
& ( ( esk5_0 != X29 )
| ( epred1_0 @ X29 )
| ( X27 = esk4_0 )
| ~ ( epred1_0 @ X27 ) ) ),
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_7])])])])])]) ).
thf(c_0_9,negated_conjecture,
! [X2: $i] :
( ( epred1_0 @ X2 )
| ( epred1_0 @ esk4_0 )
| ( esk5_0 != X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_10,negated_conjecture,
! [X2: $i,X4: $i] :
( ( epred1_0 @ X2 )
| ( X4 = esk4_0 )
| ( esk5_0 != X2 )
| ~ ( epred1_0 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_11,negated_conjecture,
! [X2: $i,X4: $i] :
( ( epred1_0 @ ( esk3_1 @ X2 ) )
| ( X2
= ( esk3_1 @ X2 ) )
| ( epred1_0 @ ( esk2_1 @ X4 ) )
| ~ ( epred1_0 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,negated_conjecture,
( ( epred1_0 @ esk5_0 )
| ( epred1_0 @ esk4_0 ) ),
inference(er,[status(thm)],[c_0_9]) ).
thf(c_0_13,negated_conjecture,
! [X2: $i] :
( ( X2 = esk4_0 )
| ( epred1_0 @ esk5_0 )
| ~ ( epred1_0 @ X2 ) ),
inference(er,[status(thm)],[c_0_10]) ).
thf(c_0_14,negated_conjecture,
! [X2: $i] :
( ( ( esk3_1 @ X2 )
= X2 )
| ( epred1_0 @ ( esk2_1 @ esk4_0 ) )
| ( epred1_0 @ ( esk3_1 @ X2 ) )
| ( epred1_0 @ esk5_0 ) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_15,negated_conjecture,
! [X2: $i,X4: $i] :
( ( epred1_0 @ ( esk3_1 @ X2 ) )
| ( X2
= ( esk3_1 @ X2 ) )
| ( ( esk2_1 @ X4 )
!= X4 )
| ~ ( epred1_0 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_16,negated_conjecture,
! [X2: $i] :
( ( ( esk2_1 @ esk4_0 )
= esk4_0 )
| ( ( esk3_1 @ X2 )
= X2 )
| ( epred1_0 @ ( esk3_1 @ X2 ) )
| ( epred1_0 @ esk5_0 ) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_17,negated_conjecture,
! [X2: $i] :
( ( ( esk3_1 @ X2 )
= X2 )
| ( epred1_0 @ ( esk3_1 @ X2 ) )
| ( epred1_0 @ esk5_0 ) ),
inference(csr,[status(thm)],[inference(condense,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16])]),c_0_12]) ).
thf(c_0_18,negated_conjecture,
! [X2: $i] :
( ( ( esk3_1 @ X2 )
= esk4_0 )
| ( ( esk3_1 @ X2 )
= X2 )
| ( epred1_0 @ esk5_0 ) ),
inference(spm,[status(thm)],[c_0_13,c_0_17]) ).
thf(c_0_19,negated_conjecture,
! [X2: $i,X4: $i] :
( ( epred1_0 @ ( esk2_1 @ X4 ) )
| ~ ( epred1_0 @ ( esk3_1 @ X2 ) )
| ( X2
!= ( esk3_1 @ X2 ) )
| ~ ( epred1_0 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_20,negated_conjecture,
( ( ( esk3_1 @ esk4_0 )
= esk4_0 )
| ( epred1_0 @ esk5_0 ) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_18])]) ).
thf(c_0_21,negated_conjecture,
! [X2: $i,X4: $i] :
( ~ ( epred1_0 @ ( esk3_1 @ X2 ) )
| ( X2
!= ( esk3_1 @ X2 ) )
| ( ( esk2_1 @ X4 )
!= X4 )
| ~ ( epred1_0 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_22,negated_conjecture,
! [X2: $i] :
( ( epred1_0 @ ( esk2_1 @ X2 ) )
| ( epred1_0 @ esk5_0 )
| ~ ( epred1_0 @ X2 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_12]) ).
thf(c_0_23,negated_conjecture,
! [X2: $i] :
( ( epred1_0 @ esk5_0 )
| ( ( esk2_1 @ X2 )
!= X2 )
| ~ ( epred1_0 @ X2 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_20]),c_0_12]) ).
thf(c_0_24,negated_conjecture,
! [X2: $i] :
( ( ( esk2_1 @ X2 )
= esk4_0 )
| ( epred1_0 @ esk5_0 )
| ~ ( epred1_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_13,c_0_22]) ).
thf(c_0_25,negated_conjecture,
! [X2: $i,X4: $i] :
( ( esk5_0 = X2 )
| ( X4 = esk4_0 )
| ~ ( epred1_0 @ X2 )
| ~ ( epred1_0 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_26,negated_conjecture,
epred1_0 @ esk5_0,
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24])]),c_0_12]) ).
thf(c_0_27,negated_conjecture,
! [X2: $i] :
( ( esk4_0 = esk5_0 )
| ( esk5_0 = X2 )
| ~ ( epred1_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
thf(c_0_28,negated_conjecture,
! [X2: $i] :
( ( ( esk3_1 @ X2 )
= X2 )
| ( epred1_0 @ ( esk2_1 @ esk5_0 ) )
| ( epred1_0 @ ( esk3_1 @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_11,c_0_26]) ).
thf(c_0_29,negated_conjecture,
! [X2: $i] :
( ( ( esk2_1 @ esk5_0 )
= esk5_0 )
| ( ( esk3_1 @ X2 )
= X2 )
| ( esk4_0 = esk5_0 )
| ( epred1_0 @ ( esk3_1 @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
thf(c_0_30,negated_conjecture,
! [X2: $i] :
( ( esk4_0 = esk5_0 )
| ( ( esk3_1 @ X2 )
= X2 )
| ( epred1_0 @ ( esk3_1 @ X2 ) ) ),
inference(condense,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_29]),c_0_26])])]) ).
thf(c_0_31,negated_conjecture,
! [X2: $i] :
( ( ( esk3_1 @ X2 )
= esk5_0 )
| ( ( esk3_1 @ X2 )
= X2 )
| ( esk4_0 = esk5_0 ) ),
inference(spm,[status(thm)],[c_0_27,c_0_30]) ).
thf(c_0_32,negated_conjecture,
( ( ( esk3_1 @ esk5_0 )
= esk5_0 )
| ( esk4_0 = esk5_0 ) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_31])]) ).
thf(c_0_33,negated_conjecture,
! [X2: $i] :
( ( esk4_0 = esk5_0 )
| ( epred1_0 @ ( esk2_1 @ X2 ) )
| ~ ( epred1_0 @ X2 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_32]),c_0_26])]) ).
thf(c_0_34,negated_conjecture,
! [X2: $i] :
( ( esk4_0 = esk5_0 )
| ( ( esk2_1 @ X2 )
!= X2 )
| ~ ( epred1_0 @ X2 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_32]),c_0_26])]) ).
thf(c_0_35,negated_conjecture,
! [X2: $i] :
( ( ( esk2_1 @ X2 )
= esk5_0 )
| ( esk4_0 = esk5_0 )
| ~ ( epred1_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_27,c_0_33]) ).
thf(c_0_36,negated_conjecture,
esk4_0 = esk5_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35])]),c_0_26])]) ).
thf(c_0_37,negated_conjecture,
! [X2: $i] :
( ( X2 = esk5_0 )
| ~ ( epred1_0 @ X2 ) ),
inference(condense,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_36])]) ).
thf(c_0_38,negated_conjecture,
! [X2: $i] :
( ( ( esk3_1 @ X2 )
= esk5_0 )
| ( ( esk3_1 @ X2 )
= X2 )
| ( epred1_0 @ ( esk2_1 @ esk5_0 ) ) ),
inference(spm,[status(thm)],[c_0_37,c_0_28]) ).
thf(c_0_39,negated_conjecture,
( ( ( esk3_1 @ esk5_0 )
= esk5_0 )
| ( epred1_0 @ ( esk2_1 @ esk5_0 ) ) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_38])]) ).
thf(c_0_40,negated_conjecture,
( ( ( esk3_1 @ esk5_0 )
= esk5_0 )
| ( ( esk2_1 @ esk5_0 )
= esk5_0 ) ),
inference(spm,[status(thm)],[c_0_37,c_0_39]) ).
thf(c_0_41,negated_conjecture,
! [X2: $i] :
( ( ( esk3_1 @ esk5_0 )
= esk5_0 )
| ( ( esk3_1 @ X2 )
= X2 )
| ( epred1_0 @ ( esk3_1 @ X2 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_40]),c_0_26])]) ).
thf(c_0_42,negated_conjecture,
( ( esk3_1 @ esk5_0 )
= esk5_0 ),
inference(condense,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_41])]) ).
thf(c_0_43,negated_conjecture,
! [X2: $i] :
( ( epred1_0 @ ( esk2_1 @ X2 ) )
| ~ ( epred1_0 @ X2 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_42]),c_0_26])]) ).
thf(c_0_44,negated_conjecture,
! [X2: $i] :
( ( ( esk2_1 @ X2 )
!= X2 )
| ~ ( epred1_0 @ X2 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_42]),c_0_26])]) ).
thf(c_0_45,negated_conjecture,
! [X2: $i] :
( ( ( esk2_1 @ X2 )
= esk5_0 )
| ~ ( epred1_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_37,c_0_43]) ).
thf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45])]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SEV300^5 : TPTP v8.2.0. Bugfixed v6.2.0.
% 0.09/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n004.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Sun May 19 18:56:08 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.15/0.41 Running higher-order theorem proving
% 0.15/0.41 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.15/0.46 # Version: 3.1.0-ho
% 0.15/0.46 # Preprocessing class: HSSSSMSSSLSNHHA.
% 0.15/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.15/0.46 # Starting sh3l with 300s (1) cores
% 0.15/0.46 # Starting lpo6_lambda_fix with 300s (1) cores
% 0.15/0.46 # Starting full_lambda_8 with 300s (1) cores
% 0.15/0.46 # sh3l with pid 12815 completed with status 0
% 0.15/0.46 # Result found by sh3l
% 0.15/0.46 # Preprocessing class: HSSSSMSSSLSNHHA.
% 0.15/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.15/0.46 # Starting sh3l with 300s (1) cores
% 0.15/0.46 # SinE strategy is gf120_gu_RUU_F100_L01000
% 0.15/0.46 # Search class: HGHSF-FFSF21-SHHFMSNN
% 0.15/0.46 # partial match(2): HGHSF-FFSF21-SHHFMMBN
% 0.15/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.46 # Starting new_ho_10_cnf2 with 78s (1) cores
% 0.15/0.46 # new_ho_10_cnf2 with pid 12819 completed with status 0
% 0.15/0.46 # Result found by new_ho_10_cnf2
% 0.15/0.46 # Preprocessing class: HSSSSMSSSLSNHHA.
% 0.15/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.15/0.46 # Starting sh3l with 300s (1) cores
% 0.15/0.46 # SinE strategy is gf120_gu_RUU_F100_L01000
% 0.15/0.46 # Search class: HGHSF-FFSF21-SHHFMSNN
% 0.15/0.46 # partial match(2): HGHSF-FFSF21-SHHFMMBN
% 0.15/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.46 # Starting new_ho_10_cnf2 with 78s (1) cores
% 0.15/0.46 # Preprocessing time : 0.001 s
% 0.15/0.46 # Presaturation interreduction done
% 0.15/0.46
% 0.15/0.46 # Proof found!
% 0.15/0.46 # SZS status Theorem
% 0.15/0.46 # SZS output start CNFRefutation
% See solution above
% 0.15/0.46 # Parsed axioms : 7
% 0.15/0.46 # Removed by relevancy pruning/SinE : 3
% 0.15/0.46 # Initial clauses : 9
% 0.15/0.46 # Removed in clause preprocessing : 0
% 0.15/0.46 # Initial clauses in saturation : 9
% 0.15/0.46 # Processed clauses : 228
% 0.15/0.46 # ...of these trivial : 1
% 0.15/0.46 # ...subsumed : 103
% 0.15/0.46 # ...remaining for further processing : 124
% 0.15/0.46 # Other redundant clauses eliminated : 72
% 0.15/0.46 # Clauses deleted for lack of memory : 0
% 0.15/0.46 # Backward-subsumed : 45
% 0.15/0.46 # Backward-rewritten : 48
% 0.15/0.46 # Generated clauses : 1096
% 0.15/0.46 # ...of the previous two non-redundant : 779
% 0.15/0.46 # ...aggressively subsumed : 0
% 0.15/0.46 # Contextual simplify-reflections : 4
% 0.15/0.46 # Paramodulations : 971
% 0.15/0.46 # Factorizations : 33
% 0.15/0.46 # NegExts : 0
% 0.15/0.46 # Equation resolutions : 74
% 0.15/0.46 # Disequality decompositions : 0
% 0.15/0.46 # Total rewrite steps : 333
% 0.15/0.46 # ...of those cached : 330
% 0.15/0.46 # Propositional unsat checks : 0
% 0.15/0.46 # Propositional check models : 0
% 0.15/0.46 # Propositional check unsatisfiable : 0
% 0.15/0.46 # Propositional clauses : 0
% 0.15/0.46 # Propositional clauses after purity: 0
% 0.15/0.46 # Propositional unsat core size : 0
% 0.15/0.46 # Propositional preprocessing time : 0.000
% 0.15/0.46 # Propositional encoding time : 0.000
% 0.15/0.46 # Propositional solver time : 0.000
% 0.15/0.46 # Success case prop preproc time : 0.000
% 0.15/0.46 # Success case prop encoding time : 0.000
% 0.15/0.46 # Success case prop solver time : 0.000
% 0.15/0.46 # Current number of processed clauses : 20
% 0.15/0.46 # Positive orientable unit clauses : 3
% 0.15/0.46 # Positive unorientable unit clauses: 0
% 0.15/0.46 # Negative unit clauses : 0
% 0.15/0.46 # Non-unit-clauses : 17
% 0.15/0.46 # Current number of unprocessed clauses: 132
% 0.15/0.46 # ...number of literals in the above : 656
% 0.15/0.46 # Current number of archived formulas : 0
% 0.15/0.46 # Current number of archived clauses : 102
% 0.15/0.46 # Clause-clause subsumption calls (NU) : 1336
% 0.15/0.46 # Rec. Clause-clause subsumption calls : 411
% 0.15/0.46 # Non-unit clause-clause subsumptions : 161
% 0.15/0.46 # Unit Clause-clause subsumption calls : 17
% 0.15/0.46 # Rewrite failures with RHS unbound : 0
% 0.15/0.46 # BW rewrite match attempts : 3
% 0.15/0.46 # BW rewrite match successes : 3
% 0.15/0.46 # Condensation attempts : 228
% 0.15/0.46 # Condensation successes : 10
% 0.15/0.46 # Termbank termtop insertions : 19147
% 0.15/0.46 # Search garbage collected termcells : 399
% 0.15/0.46
% 0.15/0.46 # -------------------------------------------------
% 0.15/0.46 # User time : 0.021 s
% 0.15/0.46 # System time : 0.001 s
% 0.15/0.46 # Total time : 0.022 s
% 0.15/0.46 # Maximum resident set size: 1916 pages
% 0.15/0.46
% 0.15/0.46 # -------------------------------------------------
% 0.15/0.46 # User time : 0.022 s
% 0.15/0.46 # System time : 0.002 s
% 0.15/0.46 # Total time : 0.025 s
% 0.15/0.46 # Maximum resident set size: 1740 pages
% 0.15/0.46 % E---3.1 exiting
% 0.15/0.46 % E exiting
%------------------------------------------------------------------------------