%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV089^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Sep 30 08:34:51 AM UTC 2026
% Result : Theorem 0.11s 0.26s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 31 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 115 ( 56 equ; 0 cnn)
% Maximal formula atoms : 36 ( 3 avg)
% Number of connectives : 413 ( 50 ~; 60 |; 23 &; 263 @)
% ( 2 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 7 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 21 ( 21 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 76 ( 12 ^; 52 !; 12 ?; 76 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_23,type,
epred1_0: a > $o ).
thf(decl_24,type,
epred2_0: a > $o ).
thf(decl_25,type,
esk1_0: a > a ).
thf(decl_26,type,
esk2_1: a > a ).
thf(decl_27,type,
esk3_1: ( a > a ) > a ).
thf(decl_28,type,
esk4_1: ( a > a ) > a ).
thf(decl_29,type,
esk5_2: ( a > a ) > a > a ).
thf(cEQP_1B_pme,conjecture,
! [X1: a > $o,X2: a > $o] :
( ? [X3: a > a] :
( ! [X4: a] :
( ( X1 @ X4 )
=> ( X2 @ ( X3 @ X4 ) ) )
& ! [X5: a] :
( ( X2 @ X5 )
=> ? [X6: a] :
( ( ^ [X4: a] :
( ( X1 @ X4 )
& ( X5
= ( X3 @ X4 ) ) ) )
= ( ^ [X7: a,X8: a] : ( X7 = X8 )
@ X6 ) ) ) )
=> ? [X3: a > a] :
( ! [X4: a] :
( ( X2 @ X4 )
=> ( X1 @ ( X3 @ X4 ) ) )
& ! [X5: a] :
( ( X1 @ X5 )
=> ? [X9: a] :
( ( ^ [X4: a] :
( ( X2 @ X4 )
& ( X5
= ( X3 @ X4 ) ) ) )
= ( ^ [X10: a,X11: a] : ( X10 = X11 )
@ X9 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.xEXbRN3e9s/E---3.1_844093.p',cEQP_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 )
=> ? [X6: a] :
( ( ^ [X4: a] :
( ( X1 @ X4 )
& ( X5
= ( X3 @ X4 ) ) ) )
= ( ^ [X7: a,X8: a] : ( X7 = X8 )
@ X6 ) ) ) )
=> ? [X3: a > a] :
( ! [X4: a] :
( ( X2 @ X4 )
=> ( X1 @ ( X3 @ X4 ) ) )
& ! [X5: a] :
( ( X1 @ X5 )
=> ? [X9: a] :
( ( ^ [X4: a] :
( ( X2 @ X4 )
& ( X5
= ( X3 @ X4 ) ) ) )
= ( ^ [X10: a,X11: a] : ( X10 = X11 )
@ X9 ) ) ) ) ),
inference(assume_negation,[status(cth)],[cEQP_1B_pme]) ).
thf(c_0_2,negated_conjecture,
~ ! [X1: a > $o,X2: a > $o] :
( ? [X3: a > a] :
( ! [X4: a] :
( ( X1 @ X4 )
=> ( X2 @ ( X3 @ X4 ) ) )
& ! [X5: a] :
( ( X2 @ X5 )
=> ? [X6: a] :
! [X22: a] :
( ( ( X1 @ X22 )
& ( X5
= ( X3 @ X22 ) ) )
<=> ( X6 = X22 ) ) ) )
=> ? [X3: a > a] :
( ! [X4: a] :
( ( X2 @ X4 )
=> ( X1 @ ( X3 @ X4 ) ) )
& ! [X5: a] :
( ( X1 @ X5 )
=> ? [X9: a] :
! [X23: a] :
( ( ( X2 @ X23 )
& ( X5
= ( X3 @ X23 ) ) )
<=> ( X9 = X23 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_1])]) ).
thf(c_0_3,negated_conjecture,
! [X27: a,X28: a,X30: a,X31: a > a,X34: a] :
( ( ~ ( epred1_0 @ X27 )
| ( epred2_0 @ ( esk1_0 @ X27 ) ) )
& ( ~ ( epred1_0 @ X30 )
| ( X28
!= ( esk1_0 @ X30 ) )
| ( ( esk2_1 @ X28 )
= X30 )
| ~ ( epred2_0 @ X28 ) )
& ( ( epred1_0 @ X30 )
| ( ( esk2_1 @ X28 )
!= X30 )
| ~ ( epred2_0 @ X28 ) )
& ( ( X28
= ( esk1_0 @ X30 ) )
| ( ( esk2_1 @ X28 )
!= X30 )
| ~ ( epred2_0 @ X28 ) )
& ( ( epred1_0 @ ( esk4_1 @ X31 ) )
| ( epred2_0 @ ( esk3_1 @ X31 ) ) )
& ( ~ ( epred2_0 @ ( esk5_2 @ X31 @ X34 ) )
| ( ( esk4_1 @ X31 )
!= ( X31 @ ( esk5_2 @ X31 @ X34 ) ) )
| ( X34
!= ( esk5_2 @ X31 @ X34 ) )
| ( epred2_0 @ ( esk3_1 @ X31 ) ) )
& ( ( epred2_0 @ ( esk5_2 @ X31 @ X34 ) )
| ( X34
= ( esk5_2 @ X31 @ X34 ) )
| ( epred2_0 @ ( esk3_1 @ X31 ) ) )
& ( ( ( esk4_1 @ X31 )
= ( X31 @ ( esk5_2 @ X31 @ X34 ) ) )
| ( X34
= ( esk5_2 @ X31 @ X34 ) )
| ( epred2_0 @ ( esk3_1 @ X31 ) ) )
& ( ( epred1_0 @ ( esk4_1 @ X31 ) )
| ~ ( epred1_0 @ ( X31 @ ( esk3_1 @ X31 ) ) ) )
& ( ~ ( epred2_0 @ ( esk5_2 @ X31 @ X34 ) )
| ( ( esk4_1 @ X31 )
!= ( X31 @ ( esk5_2 @ X31 @ X34 ) ) )
| ( X34
!= ( esk5_2 @ X31 @ X34 ) )
| ~ ( epred1_0 @ ( X31 @ ( esk3_1 @ X31 ) ) ) )
& ( ( epred2_0 @ ( esk5_2 @ X31 @ X34 ) )
| ( X34
= ( esk5_2 @ X31 @ X34 ) )
| ~ ( epred1_0 @ ( X31 @ ( esk3_1 @ X31 ) ) ) )
& ( ( ( esk4_1 @ X31 )
= ( X31 @ ( esk5_2 @ X31 @ X34 ) ) )
| ( X34
= ( esk5_2 @ X31 @ X34 ) )
| ~ ( epred1_0 @ ( X31 @ ( esk3_1 @ X31 ) ) ) ) ),
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_2])])])])])]) ).
thf(c_0_4,negated_conjecture,
! [X4: a,X5: a] :
( ( epred1_0 @ X4 )
| ( ( esk2_1 @ X5 )
!= X4 )
| ~ ( epred2_0 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X5: a,X4: a] :
( ( X4
= ( esk1_0 @ X5 ) )
| ( ( esk2_1 @ X4 )
!= X5 )
| ~ ( epred2_0 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
! [X4: a,X3: a > a] :
( ( ( esk4_1 @ X3 )
= ( X3 @ ( esk5_2 @ X3 @ X4 ) ) )
| ( X4
= ( esk5_2 @ X3 @ X4 ) )
| ~ ( epred1_0 @ ( X3 @ ( esk3_1 @ X3 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_7,negated_conjecture,
! [X4: a] :
( ( epred1_0 @ ( esk2_1 @ X4 ) )
| ~ ( epred2_0 @ X4 ) ),
inference(er,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
! [X4: a,X3: a > a] :
( ( ( esk4_1 @ X3 )
= ( X3 @ ( esk5_2 @ X3 @ X4 ) ) )
| ( X4
= ( esk5_2 @ X3 @ X4 ) )
| ( epred2_0 @ ( esk3_1 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_9,negated_conjecture,
! [X4: a,X3: a > a] :
( ( epred2_0 @ ( esk5_2 @ X3 @ X4 ) )
| ( X4
= ( esk5_2 @ X3 @ X4 ) )
| ~ ( epred1_0 @ ( X3 @ ( esk3_1 @ X3 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_10,negated_conjecture,
! [X4: a,X3: a > a] :
( ( epred2_0 @ ( esk5_2 @ X3 @ X4 ) )
| ( X4
= ( esk5_2 @ X3 @ X4 ) )
| ( epred2_0 @ ( esk3_1 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_11,negated_conjecture,
! [X4: a] :
( ( ( esk1_0 @ ( esk2_1 @ X4 ) )
= X4 )
| ~ ( epred2_0 @ X4 ) ),
inference(er,[status(thm)],[c_0_5]) ).
thf(c_0_12,negated_conjecture,
! [X4: a] :
( ( ( esk2_1 @ ( esk5_2 @ esk2_1 @ X4 ) )
= ( esk4_1 @ esk2_1 ) )
| ( ( esk5_2 @ esk2_1 @ X4 )
= X4 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
thf(c_0_13,negated_conjecture,
! [X4: a] :
( ( ( esk5_2 @ esk2_1 @ X4 )
= X4 )
| ( epred2_0 @ ( esk5_2 @ esk2_1 @ X4 ) ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_7]),c_0_10]) ).
thf(c_0_14,negated_conjecture,
! [X4: a] :
( ( ( esk1_0 @ ( esk4_1 @ esk2_1 ) )
= ( esk5_2 @ esk2_1 @ X4 ) )
| ( ( esk5_2 @ esk2_1 @ X4 )
= X4 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
thf(c_0_15,negated_conjecture,
! [X3: a > a,X4: a] :
( ( epred2_0 @ ( esk3_1 @ X3 ) )
| ~ ( epred2_0 @ ( esk5_2 @ X3 @ X4 ) )
| ( ( esk4_1 @ X3 )
!= ( X3 @ ( esk5_2 @ X3 @ X4 ) ) )
| ( X4
!= ( esk5_2 @ X3 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_16,negated_conjecture,
( ( esk5_2 @ esk2_1 @ ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) )
= ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_14])]) ).
thf(c_0_17,negated_conjecture,
! [X4: a,X5: a] :
( ( ( esk2_1 @ X5 )
= X4 )
| ~ ( epred1_0 @ X4 )
| ( X5
!= ( esk1_0 @ X4 ) )
| ~ ( epred2_0 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_18,negated_conjecture,
! [X4: a] :
( ( epred2_0 @ ( esk1_0 @ X4 ) )
| ~ ( epred1_0 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_19,negated_conjecture,
! [X3: a > a] :
( ( epred1_0 @ ( esk4_1 @ X3 ) )
| ~ ( epred1_0 @ ( X3 @ ( esk3_1 @ X3 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_20,negated_conjecture,
! [X3: a > a] :
( ( epred1_0 @ ( esk4_1 @ X3 ) )
| ( epred2_0 @ ( esk3_1 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_21,negated_conjecture,
! [X4: a,X3: a > a] :
( ~ ( epred2_0 @ ( esk5_2 @ X3 @ X4 ) )
| ( ( esk4_1 @ X3 )
!= ( X3 @ ( esk5_2 @ X3 @ X4 ) ) )
| ( X4
!= ( esk5_2 @ X3 @ X4 ) )
| ~ ( epred1_0 @ ( X3 @ ( esk3_1 @ X3 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_22,negated_conjecture,
( ( epred2_0 @ ( esk3_1 @ esk2_1 ) )
| ( ( esk2_1 @ ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) )
!= ( esk4_1 @ esk2_1 ) )
| ~ ( epred2_0 @ ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) ) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_23,negated_conjecture,
! [X4: a] :
( ( ( esk2_1 @ ( esk1_0 @ X4 ) )
= X4 )
| ~ ( epred1_0 @ X4 ) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_17]),c_0_18]) ).
thf(c_0_24,negated_conjecture,
epred1_0 @ ( esk4_1 @ esk2_1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_7]),c_0_20]) ).
thf(c_0_25,negated_conjecture,
( ( ( esk2_1 @ ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) )
!= ( esk4_1 @ esk2_1 ) )
| ~ ( epred2_0 @ ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) )
| ~ ( epred1_0 @ ( esk2_1 @ ( esk3_1 @ esk2_1 ) ) ) ),
inference(spm,[status(thm)],[c_0_21,c_0_16]) ).
thf(c_0_26,negated_conjecture,
( ( epred2_0 @ ( esk3_1 @ esk2_1 ) )
| ~ ( epred2_0 @ ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
thf(c_0_27,negated_conjecture,
( ~ ( epred2_0 @ ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) )
| ~ ( epred1_0 @ ( esk2_1 @ ( esk3_1 @ esk2_1 ) ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_23]),c_0_24])]) ).
thf(c_0_28,negated_conjecture,
epred2_0 @ ( esk3_1 @ esk2_1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_18]),c_0_24])]) ).
thf(c_0_29,negated_conjecture,
~ ( epred2_0 @ ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_7]),c_0_28])]) ).
thf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_18]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV089^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.17 % Computer : n006.cluster.edu
% 0.11/0.17 % Model : x86_64 x86_64
% 0.11/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.17 % Memory : 8046.5625MB
% 0.11/0.17 % OS : Linux 6.8.0-71-generic
% 0.11/0.17 % CPULimit : 300
% 0.11/0.17 % WCLimit : 300
% 0.11/0.17 % DateTime : Tue Sep 29 15:06:54 UTC 2026
% 0.11/0.17 % CPUTime :
% 0.11/0.17 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.22 Running higher-order theorem proving
% 0.11/0.23 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/tmp/tmp.xEXbRN3e9s/E---3.1_844093.p
% 0.11/0.26 % Version: 3.5.1-ho
% 0.11/0.26 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.11/0.26 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.26 % Starting post_as_ho12 with 300s (1) cores
% 0.11/0.26 % Starting new_bool_9 with 300s (1) cores
% 0.11/0.26 % Starting post_as_ho1 with 300s (1) cores
% 0.11/0.26 % Starting post_as_ho4 with 300s (1) cores
% 0.11/0.26 % Starting post_as_ho2 with 300s (1) cores
% 0.11/0.26 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.11/0.26 % Starting full_lambda_10 with 300s (1) cores
% 0.11/0.26 % Starting new_ho_8 with 300s (1) cores
% 0.11/0.26 % post_as_ho4 with pid 844123 completed with status 0
% 0.11/0.26 % Result found by post_as_ho4
% 0.11/0.26 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.11/0.26 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.26 % Starting post_as_ho12 with 300s (1) cores
% 0.11/0.26 % Starting new_bool_9 with 300s (1) cores
% 0.11/0.26 % Starting post_as_ho1 with 300s (1) cores
% 0.11/0.26 % Starting post_as_ho4 with 300s (1) cores
% 0.11/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.26 % No SInE strategy applied
% 0.11/0.26 % Search class: HGHSF-FFSF21-SSSFFSNN
% 0.11/0.26 % partial match(1): HGHSF-FFSF21-SSSFFMNN
% 0.11/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.26 % SubtermCWHack with pid 844129 completed with status 0
% 0.11/0.26 % Result found by SubtermCWHack
% 0.11/0.26 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.11/0.26 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.26 % Starting post_as_ho12 with 300s (1) cores
% 0.11/0.26 % Starting new_bool_9 with 300s (1) cores
% 0.11/0.26 % Starting post_as_ho1 with 300s (1) cores
% 0.11/0.26 % Starting post_as_ho4 with 300s (1) cores
% 0.11/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.26 % No SInE strategy applied
% 0.11/0.26 % Search class: HGHSF-FFSF21-SSSFFSNN
% 0.11/0.26 % partial match(1): HGHSF-FFSF21-SSSFFMNN
% 0.11/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.26 % Preprocessing time : 0.001 s
% 0.11/0.26
% 0.11/0.26 % Proof found!
% 0.11/0.26 % SZS status Theorem
% 0.11/0.26 % SZS output start CNFRefutation
% See solution above
% 0.11/0.26 % Parsed axioms : 2
% 0.11/0.26 % Removed by relevancy pruning/SinE : 0
% 0.11/0.26 % Initial clauses : 13
% 0.11/0.26 % Removed in clause preprocessing : 1
% 0.11/0.26 % Initial clauses in saturation : 12
% 0.11/0.26 % Processed clauses : 38
% 0.11/0.26 % ...of these trivial : 2
% 0.11/0.26 % ...subsumed : 4
% 0.11/0.26 % ...remaining for further processing : 32
% 0.11/0.26 % Other redundant clauses eliminated : 7
% 0.11/0.26 % Clauses deleted for lack of memory : 0
% 0.11/0.26 % Backward-subsumed : 4
% 0.11/0.26 % Backward-rewritten : 1
% 0.11/0.26 % Generated clauses : 109
% 0.11/0.26 % ...of the previous two non-redundant : 91
% 0.11/0.26 % ...aggressively subsumed : 0
% 0.11/0.26 % Contextual simplify-reflections : 5
% 0.11/0.26 % Paramodulations : 98
% 0.11/0.26 % Factorizations : 3
% 0.11/0.26 % NegExts : 0
% 0.11/0.26 % Equation resolutions : 7
% 0.11/0.26 % Disequality decompositions : 0
% 0.11/0.26 % Total rewrite steps : 18
% 0.11/0.26 % ...of those cached : 15
% 0.11/0.26 % Propositional unsat checks : 0
% 0.11/0.26 % Propositional check models : 0
% 0.11/0.26 % Propositional check unsatisfiable : 0
% 0.11/0.26 % Propositional clauses : 0
% 0.11/0.26 % Propositional clauses after purity: 0
% 0.11/0.26 % Propositional unsat core size : 0
% 0.11/0.26 % Propositional preprocessing time : 0.000
% 0.11/0.26 % Propositional encoding time : 0.000
% 0.11/0.26 % Propositional solver time : 0.000
% 0.11/0.26 % Success case prop preproc time : 0.000
% 0.11/0.26 % Success case prop encoding time : 0.000
% 0.11/0.26 % Success case prop solver time : 0.000
% 0.11/0.26 % Current number of processed clauses : 23
% 0.11/0.26 % Positive orientable unit clauses : 3
% 0.11/0.26 % Positive unorientable unit clauses: 0
% 0.11/0.26 % Negative unit clauses : 1
% 0.11/0.26 % Non-unit-clauses : 19
% 0.11/0.26 % Current number of unprocessed clauses: 58
% 0.11/0.26 % ...number of literals in the above : 252
% 0.11/0.26 % Current number of archived formulas : 0
% 0.11/0.26 % Current number of archived clauses : 6
% 0.11/0.26 % Clause-clause subsumption calls (NU) : 51
% 0.11/0.26 % Rec. Clause-clause subsumption calls : 40
% 0.11/0.26 % Non-unit clause-clause subsumptions : 12
% 0.11/0.26 % Unit Clause-clause subsumption calls : 1
% 0.11/0.26 % Rewrite failures with RHS unbound : 0
% 0.11/0.26 % BW rewrite match attempts : 1
% 0.11/0.26 % BW rewrite match successes : 1
% 0.11/0.26 % Condensation attempts : 0
% 0.11/0.26 % Condensation successes : 0
% 0.11/0.26 % Termbank termtop insertions : 3015
% 0.11/0.26 % Search garbage collected termcells : 481
% 0.11/0.26
% 0.11/0.26 % -------------------------------------------------
% 0.11/0.26 % User time : 0.005 s
% 0.11/0.26 % System time : 0.001 s
% 0.11/0.26 % Total time : 0.006 s
% 0.11/0.26 % Maximum resident set size: 3584 pages
% 0.11/0.26
% 0.11/0.26 % -------------------------------------------------
% 0.11/0.26 % User time : 0.006 s
% 0.11/0.26 % System time : 0.007 s
% 0.11/0.26 % Total time : 0.013 s
% 0.11/0.26 % Maximum resident set size: 4864 pages
% 0.11/0.26 % E exiting
%------------------------------------------------------------------------------