TSTP Solution File: SEU550^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU550^2 : TPTP v8.2.0. Bugfixed v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 03:28:07 EDT 2024
% Result : Theorem 0.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 9
% Syntax : Number of formulae : 55 ( 7 unt; 7 typ; 0 def)
% Number of atoms : 177 ( 54 equ; 0 cnn)
% Maximal formula atoms : 34 ( 3 avg)
% Number of connectives : 401 ( 89 ~; 112 |; 13 &; 175 @)
% ( 4 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 73 ( 4 ^ 65 !; 4 ?; 73 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
exu: ( $i > $o ) > $o ).
thf(decl_23,type,
epred1_0: $i > $o ).
thf(decl_24,type,
epred2_0: $i > $o ).
thf(decl_25,type,
esk1_1: $i > $i ).
thf(decl_26,type,
esk2_1: $i > $i ).
thf(decl_27,type,
esk3_0: $i ).
thf(decl_28,type,
esk4_0: $i ).
thf(exu_def,axiom,
( exu
= ( ^ [X1: $i > $o] :
? [X2: $i] :
( ( X1 @ X2 )
& ! [X3: $i] :
( ( X1 @ X3 )
=> ( X2 = X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',exu_def) ).
thf(exu__Cong,conjecture,
! [X1: $i > $o,X4: $i > $o] :
( ! [X2: $i,X3: $i] :
( ( X2 = X3 )
=> ( ( X1 @ X2 )
<=> ( X4 @ X3 ) ) )
=> ( ( exu
@ ^ [X2: $i] : ( X1 @ X2 ) )
<=> ( exu
@ ^ [X2: $i] : ( X4 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',exu__Cong) ).
thf(c_0_2,plain,
( exu
= ( ^ [Z0: $i > $o] :
? [X2: $i] :
( ( Z0 @ X2 )
& ! [X3: $i] :
( ( Z0 @ X3 )
=> ( X2 = X3 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[exu_def]) ).
thf(c_0_3,negated_conjecture,
~ ! [X1: $i > $o,X4: $i > $o] :
( ! [X2: $i,X3: $i] :
( ( X2 = X3 )
=> ( ( X1 @ X2 )
<=> ( X4 @ X3 ) ) )
=> ( ? [X9: $i] :
( ( X1 @ X9 )
& ! [X10: $i] :
( ( X1 @ X10 )
=> ( X9 = X10 ) ) )
<=> ? [X11: $i] :
( ( X4 @ X11 )
& ! [X12: $i] :
( ( X4 @ X12 )
=> ( X11 = X12 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[exu__Cong])]),c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X15: $i,X16: $i,X17: $i,X19: $i,X22: $i,X24: $i] :
( ( ~ ( epred1_0 @ X15 )
| ( epred2_0 @ X16 )
| ( X15 != X16 ) )
& ( ~ ( epred2_0 @ X16 )
| ( epred1_0 @ X15 )
| ( X15 != X16 ) )
& ( ( epred2_0 @ ( esk2_1 @ X19 ) )
| ~ ( epred2_0 @ X19 )
| ( epred1_0 @ ( esk1_1 @ X17 ) )
| ~ ( epred1_0 @ X17 ) )
& ( ( X19
!= ( esk2_1 @ X19 ) )
| ~ ( epred2_0 @ X19 )
| ( epred1_0 @ ( esk1_1 @ X17 ) )
| ~ ( epred1_0 @ X17 ) )
& ( ( epred2_0 @ ( esk2_1 @ X19 ) )
| ~ ( epred2_0 @ X19 )
| ( X17
!= ( esk1_1 @ X17 ) )
| ~ ( epred1_0 @ X17 ) )
& ( ( X19
!= ( esk2_1 @ X19 ) )
| ~ ( epred2_0 @ X19 )
| ( X17
!= ( esk1_1 @ X17 ) )
| ~ ( epred1_0 @ X17 ) )
& ( ( epred2_0 @ esk4_0 )
| ( epred1_0 @ esk3_0 ) )
& ( ~ ( epred2_0 @ X24 )
| ( esk4_0 = X24 )
| ( epred1_0 @ esk3_0 ) )
& ( ( epred2_0 @ esk4_0 )
| ~ ( epred1_0 @ X22 )
| ( esk3_0 = X22 ) )
& ( ~ ( epred2_0 @ X24 )
| ( esk4_0 = X24 )
| ~ ( epred1_0 @ X22 )
| ( esk3_0 = X22 ) ) ),
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_3])])])])])]) ).
thf(c_0_5,negated_conjecture,
! [X2: $i,X3: $i] :
( ( epred2_0 @ X3 )
| ~ ( epred1_0 @ X2 )
| ( X2 != X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X2: $i] :
( ( esk4_0 = X2 )
| ( epred1_0 @ esk3_0 )
| ~ ( epred2_0 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X2: $i,X3: $i] :
( ( epred2_0 @ ( esk2_1 @ X2 ) )
| ( epred1_0 @ ( esk1_1 @ X3 ) )
| ~ ( epred2_0 @ X2 )
| ~ ( epred1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
! [X2: $i] :
( ( epred2_0 @ X2 )
| ~ ( epred1_0 @ X2 ) ),
inference(er,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
! [X2: $i,X3: $i] :
( ( epred1_0 @ ( esk1_1 @ X3 ) )
| ( X2
!= ( esk2_1 @ X2 ) )
| ~ ( epred2_0 @ X2 )
| ~ ( epred1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_10,negated_conjecture,
! [X3: $i,X2: $i] :
( ( ( esk2_1 @ X2 )
= esk4_0 )
| ( epred1_0 @ ( esk1_1 @ X3 ) )
| ( epred1_0 @ esk3_0 )
| ~ ( epred1_0 @ X3 )
| ~ ( epred2_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_11,negated_conjecture,
( ( epred2_0 @ esk4_0 )
| ( epred1_0 @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_12,negated_conjecture,
! [X3: $i,X2: $i] :
( ( epred1_0 @ X3 )
| ~ ( epred2_0 @ X2 )
| ( X3 != X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_13,negated_conjecture,
! [X2: $i] :
( ( esk4_0 = X2 )
| ( epred1_0 @ esk3_0 )
| ~ ( epred1_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
thf(c_0_14,negated_conjecture,
! [X2: $i] :
( ( epred1_0 @ ( esk1_1 @ X2 ) )
| ( epred1_0 @ esk3_0 )
| ~ ( epred1_0 @ X2 ) ),
inference(csr,[status(thm)],[inference(condense,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10])])]),c_0_11]) ).
thf(c_0_15,negated_conjecture,
! [X2: $i] :
( ( epred1_0 @ X2 )
| ~ ( epred2_0 @ X2 ) ),
inference(er,[status(thm)],[c_0_12]) ).
thf(c_0_16,negated_conjecture,
! [X2: $i,X3: $i] :
( ( epred2_0 @ ( esk2_1 @ X2 ) )
| ~ ( epred2_0 @ X2 )
| ( X3
!= ( esk1_1 @ X3 ) )
| ~ ( epred1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_17,negated_conjecture,
! [X2: $i] :
( ( ( esk1_1 @ X2 )
= esk4_0 )
| ( epred1_0 @ esk3_0 )
| ~ ( epred1_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_18,negated_conjecture,
( ( epred1_0 @ esk3_0 )
| ( epred1_0 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_15,c_0_11]) ).
thf(c_0_19,negated_conjecture,
! [X2: $i,X3: $i] :
( ( X2
!= ( esk2_1 @ X2 ) )
| ~ ( epred2_0 @ X2 )
| ( X3
!= ( esk1_1 @ X3 ) )
| ~ ( epred1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_20,negated_conjecture,
! [X2: $i] :
( ( epred2_0 @ ( esk2_1 @ X2 ) )
| ( epred1_0 @ esk3_0 )
| ~ ( epred2_0 @ X2 ) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17])]),c_0_18]) ).
thf(c_0_21,negated_conjecture,
! [X2: $i,X3: $i] :
( ( esk4_0 = X2 )
| ( esk3_0 = X3 )
| ~ ( epred2_0 @ X2 )
| ~ ( epred1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_22,negated_conjecture,
! [X2: $i] :
( ( epred1_0 @ esk3_0 )
| ( ( esk2_1 @ X2 )
!= X2 )
| ~ ( epred2_0 @ X2 ) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_17])]),c_0_18]) ).
thf(c_0_23,negated_conjecture,
! [X2: $i] :
( ( ( esk2_1 @ X2 )
= esk4_0 )
| ( epred1_0 @ esk3_0 )
| ~ ( epred2_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_6,c_0_20]) ).
thf(c_0_24,negated_conjecture,
! [X3: $i,X2: $i] :
( ( esk4_0 = X2 )
| ( esk3_0 = X3 )
| ~ ( epred1_0 @ X3 )
| ~ ( epred1_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_21,c_0_8]) ).
thf(c_0_25,negated_conjecture,
epred1_0 @ esk3_0,
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23])]),c_0_11]) ).
thf(c_0_26,negated_conjecture,
! [X2: $i] :
( ( esk3_0 = esk4_0 )
| ( esk3_0 = X2 )
| ~ ( epred1_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
thf(c_0_27,negated_conjecture,
! [X2: $i,X3: $i] :
( ( epred1_0 @ ( esk1_1 @ X2 ) )
| ( epred1_0 @ ( esk2_1 @ X3 ) )
| ~ ( epred1_0 @ X2 )
| ~ ( epred2_0 @ X3 ) ),
inference(spm,[status(thm)],[c_0_15,c_0_7]) ).
thf(c_0_28,negated_conjecture,
! [X3: $i,X2: $i] :
( ( ( esk2_1 @ X2 )
= esk3_0 )
| ( esk3_0 = esk4_0 )
| ( epred1_0 @ ( esk1_1 @ X3 ) )
| ~ ( epred1_0 @ X3 )
| ~ ( epred2_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
thf(c_0_29,negated_conjecture,
! [X2: $i] :
( ( esk3_0 = esk4_0 )
| ( epred1_0 @ ( esk1_1 @ X2 ) )
| ~ ( epred2_0 @ esk3_0 )
| ~ ( epred1_0 @ X2 ) ),
inference(condense,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_28])])]) ).
thf(c_0_30,negated_conjecture,
! [X2: $i] :
( ( ( esk1_1 @ X2 )
= esk3_0 )
| ( esk3_0 = esk4_0 )
| ~ ( epred2_0 @ esk3_0 )
| ~ ( epred1_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_26,c_0_29]) ).
thf(c_0_31,negated_conjecture,
! [X2: $i] :
( ( esk3_0 = esk4_0 )
| ( epred2_0 @ ( esk2_1 @ X2 ) )
| ~ ( epred2_0 @ esk3_0 )
| ~ ( epred2_0 @ X2 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_30])]),c_0_25])]) ).
thf(c_0_32,negated_conjecture,
! [X2: $i] :
( ( esk3_0 = esk4_0 )
| ( epred1_0 @ ( esk2_1 @ X2 ) )
| ~ ( epred2_0 @ esk3_0 )
| ~ ( epred2_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_15,c_0_31]) ).
thf(c_0_33,negated_conjecture,
! [X2: $i] :
( ( esk3_0 = esk4_0 )
| ( ( esk2_1 @ X2 )
!= X2 )
| ~ ( epred2_0 @ esk3_0 )
| ~ ( epred2_0 @ X2 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_30])]),c_0_25])]) ).
thf(c_0_34,negated_conjecture,
! [X2: $i] :
( ( ( esk2_1 @ X2 )
= esk3_0 )
| ( esk3_0 = esk4_0 )
| ~ ( epred2_0 @ esk3_0 )
| ~ ( epred2_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_26,c_0_32]) ).
thf(c_0_35,negated_conjecture,
( ( esk3_0 = esk4_0 )
| ~ ( epred2_0 @ esk3_0 ) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34])]) ).
thf(c_0_36,negated_conjecture,
esk3_0 = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_8]),c_0_25])]) ).
thf(c_0_37,negated_conjecture,
! [X2: $i] :
( ( esk4_0 = X2 )
| ~ ( epred1_0 @ X2 ) ),
inference(condense,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_36])]) ).
thf(c_0_38,negated_conjecture,
! [X3: $i,X2: $i] :
( ( ( esk2_1 @ X2 )
= esk4_0 )
| ( epred1_0 @ ( esk1_1 @ X3 ) )
| ~ ( epred1_0 @ X3 )
| ~ ( epred2_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_37,c_0_27]) ).
thf(c_0_39,negated_conjecture,
! [X2: $i] :
( ( epred1_0 @ ( esk1_1 @ X2 ) )
| ~ ( epred2_0 @ esk4_0 )
| ~ ( epred1_0 @ X2 ) ),
inference(condense,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_38])])]) ).
thf(c_0_40,negated_conjecture,
! [X2: $i] :
( ( ( esk1_1 @ X2 )
= esk4_0 )
| ~ ( epred2_0 @ esk4_0 )
| ~ ( epred1_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_37,c_0_39]) ).
thf(c_0_41,negated_conjecture,
epred1_0 @ esk4_0,
inference(rw,[status(thm)],[c_0_25,c_0_36]) ).
thf(c_0_42,negated_conjecture,
! [X2: $i] :
( ( epred2_0 @ ( esk2_1 @ X2 ) )
| ~ ( epred2_0 @ esk4_0 )
| ~ ( epred2_0 @ X2 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_40])]),c_0_41])]) ).
thf(c_0_43,negated_conjecture,
! [X2: $i] :
( ( epred1_0 @ ( esk2_1 @ X2 ) )
| ~ ( epred2_0 @ esk4_0 )
| ~ ( epred2_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_15,c_0_42]) ).
thf(c_0_44,negated_conjecture,
! [X2: $i] :
( ( ( esk2_1 @ X2 )
!= X2 )
| ~ ( epred2_0 @ esk4_0 )
| ~ ( epred2_0 @ X2 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_40])]),c_0_41])]) ).
thf(c_0_45,negated_conjecture,
! [X2: $i] :
( ( ( esk2_1 @ X2 )
= esk4_0 )
| ~ ( epred2_0 @ esk4_0 )
| ~ ( epred2_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_37,c_0_43]) ).
thf(c_0_46,negated_conjecture,
~ ( epred2_0 @ esk4_0 ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45])]) ).
thf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_8]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10 % Problem : SEU550^2 : TPTP v8.2.0. Bugfixed v5.2.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n026.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 : Sun May 19 15:36:38 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running higher-order theorem proving
% 0.16/0.42 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.16/0.44 # Version: 3.1.0-ho
% 0.16/0.44 # Preprocessing class: HSSSSMSSSLMNHSA.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting new_ho_10 with 1500s (5) cores
% 0.16/0.44 # Starting sh5l with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_2 with 300s (1) cores
% 0.16/0.44 # new_ho_10 with pid 19462 completed with status 0
% 0.16/0.44 # Result found by new_ho_10
% 0.16/0.44 # Preprocessing class: HSSSSMSSSLMNHSA.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting new_ho_10 with 1500s (5) cores
% 0.16/0.44 # No SInE strategy applied
% 0.16/0.44 # Search class: HGHSF-FFSF11-SHSFMFNN
% 0.16/0.44 # partial match(1): HHHSF-FFSF11-SHSFMFNN
% 0.16/0.44 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.44 # Starting new_ho_10 with 901s (1) cores
% 0.16/0.44 # Starting sh5l with 151s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 151s (1) cores
% 0.16/0.44 # Starting new_bool_2 with 151s (1) cores
% 0.16/0.44 # Starting new_bool_9 with 146s (1) cores
% 0.16/0.44 # sh5l with pid 19470 completed with status 0
% 0.16/0.44 # Result found by sh5l
% 0.16/0.44 # Preprocessing class: HSSSSMSSSLMNHSA.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting new_ho_10 with 1500s (5) cores
% 0.16/0.44 # No SInE strategy applied
% 0.16/0.44 # Search class: HGHSF-FFSF11-SHSFMFNN
% 0.16/0.44 # partial match(1): HHHSF-FFSF11-SHSFMFNN
% 0.16/0.44 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.44 # Starting new_ho_10 with 901s (1) cores
% 0.16/0.44 # Starting sh5l with 151s (1) cores
% 0.16/0.44 # Preprocessing time : 0.001 s
% 0.16/0.44 # Presaturation interreduction done
% 0.16/0.44
% 0.16/0.44 # Proof found!
% 0.16/0.44 # SZS status Theorem
% 0.16/0.44 # SZS output start CNFRefutation
% See solution above
% 0.16/0.44 # Parsed axioms : 3
% 0.16/0.44 # Removed by relevancy pruning/SinE : 0
% 0.16/0.44 # Initial clauses : 11
% 0.16/0.44 # Removed in clause preprocessing : 1
% 0.16/0.44 # Initial clauses in saturation : 10
% 0.16/0.44 # Processed clauses : 74
% 0.16/0.44 # ...of these trivial : 0
% 0.16/0.44 # ...subsumed : 13
% 0.16/0.44 # ...remaining for further processing : 61
% 0.16/0.44 # Other redundant clauses eliminated : 27
% 0.16/0.44 # Clauses deleted for lack of memory : 0
% 0.16/0.44 # Backward-subsumed : 18
% 0.16/0.44 # Backward-rewritten : 18
% 0.16/0.44 # Generated clauses : 238
% 0.16/0.44 # ...of the previous two non-redundant : 178
% 0.16/0.44 # ...aggressively subsumed : 0
% 0.16/0.44 # Contextual simplify-reflections : 4
% 0.16/0.44 # Paramodulations : 211
% 0.16/0.44 # Factorizations : 0
% 0.16/0.44 # NegExts : 0
% 0.16/0.44 # Equation resolutions : 27
% 0.16/0.44 # Disequality decompositions : 0
% 0.16/0.44 # Total rewrite steps : 63
% 0.16/0.44 # ...of those cached : 60
% 0.16/0.44 # Propositional unsat checks : 0
% 0.16/0.44 # Propositional check models : 0
% 0.16/0.44 # Propositional check unsatisfiable : 0
% 0.16/0.44 # Propositional clauses : 0
% 0.16/0.44 # Propositional clauses after purity: 0
% 0.16/0.44 # Propositional unsat core size : 0
% 0.16/0.44 # Propositional preprocessing time : 0.000
% 0.16/0.44 # Propositional encoding time : 0.000
% 0.16/0.44 # Propositional solver time : 0.000
% 0.16/0.44 # Success case prop preproc time : 0.000
% 0.16/0.44 # Success case prop encoding time : 0.000
% 0.16/0.44 # Success case prop solver time : 0.000
% 0.16/0.44 # Current number of processed clauses : 13
% 0.16/0.44 # Positive orientable unit clauses : 2
% 0.16/0.44 # Positive unorientable unit clauses: 0
% 0.16/0.44 # Negative unit clauses : 1
% 0.16/0.44 # Non-unit-clauses : 10
% 0.16/0.44 # Current number of unprocessed clauses: 103
% 0.16/0.44 # ...number of literals in the above : 684
% 0.16/0.44 # Current number of archived formulas : 0
% 0.16/0.44 # Current number of archived clauses : 46
% 0.16/0.44 # Clause-clause subsumption calls (NU) : 364
% 0.16/0.44 # Rec. Clause-clause subsumption calls : 238
% 0.16/0.44 # Non-unit clause-clause subsumptions : 31
% 0.16/0.44 # Unit Clause-clause subsumption calls : 18
% 0.16/0.44 # Rewrite failures with RHS unbound : 0
% 0.16/0.44 # BW rewrite match attempts : 2
% 0.16/0.44 # BW rewrite match successes : 2
% 0.16/0.44 # Condensation attempts : 74
% 0.16/0.44 # Condensation successes : 4
% 0.16/0.44 # Termbank termtop insertions : 11851
% 0.16/0.44 # Search garbage collected termcells : 421
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.012 s
% 0.16/0.44 # System time : 0.002 s
% 0.16/0.44 # Total time : 0.014 s
% 0.16/0.44 # Maximum resident set size: 1832 pages
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.055 s
% 0.16/0.44 # System time : 0.006 s
% 0.16/0.44 # Total time : 0.061 s
% 0.16/0.44 # Maximum resident set size: 1712 pages
% 0.16/0.44 % E---3.1 exiting
% 0.16/0.45 % E exiting
%------------------------------------------------------------------------------