%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU974^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:28:11 AM UTC 2026
% Result : Theorem 0.11s 0.22s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 21 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 104 ( 69 equ; 0 cnn)
% Maximal formula atoms : 25 ( 4 avg)
% Number of connectives : 624 ( 50 ~; 43 |; 54 &; 444 @)
% ( 6 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 9 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 14 ( 14 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 75 ( 0 ^; 69 !; 6 ?; 75 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_23,type,
cR: a > a ).
thf(decl_24,type,
cP: a > a > a ).
thf(decl_25,type,
cL: a > a ).
thf(decl_26,type,
cZ: a ).
thf(decl_27,type,
esk1_1: ( a > $o ) > a ).
thf(decl_28,type,
esk2_1: ( a > $o ) > a ).
thf(decl_29,type,
esk3_0: a ).
thf(decl_30,type,
esk4_0: a ).
thf(decl_31,type,
epred1_0: a > $o ).
thf(decl_32,type,
esk5_1: ( a > $o ) > a ).
thf(decl_33,type,
esk6_1: ( a > $o ) > a ).
thf(cPU_LEM2C_pme,conjecture,
( ( ( ( cL @ cZ )
= cZ )
& ( ( cR @ cZ )
= cZ )
& ! [X1: a,X2: a] :
( ( cL @ ( cP @ X1 @ X2 ) )
= X1 )
& ! [X1: a,X2: a] :
( ( cR @ ( cP @ X1 @ X2 ) )
= X2 )
& ! [X3: a] :
( ( X3 != cZ )
<=> ( X3
= ( cP @ ( cL @ X3 ) @ ( cR @ X3 ) ) ) )
& ! [X4: a > $o] :
( ! [X3: a,X5: a] :
( ( X4 @ ( cP @ X3 @ X5 ) )
=> ( ( ( X3 = cZ )
<=> ( X5 = cZ ) )
& ( X4 @ ( cP @ ( cL @ X3 ) @ ( cL @ X5 ) ) )
& ( X4 @ ( cP @ ( cR @ X3 ) @ ( cR @ X5 ) ) ) ) )
=> ! [X3: a,X5: a] :
( ( X4 @ ( cP @ X3 @ X5 ) )
=> ( X3 = X5 ) ) ) )
=> ! [X1: a,X2: a] :
( ? [X4: a > $o] :
( ( X4 @ ( cP @ X1 @ X2 ) )
& ! [X3: a,X5: a] :
( ( X4 @ ( cP @ X3 @ X5 ) )
=> ( ( ( X5 = cZ )
=> ( X3 = cZ ) )
& ( X4 @ ( cP @ ( cL @ X3 ) @ ( cL @ X5 ) ) )
& ( X4 @ ( cP @ ( cR @ X3 ) @ ( cR @ X5 ) ) ) ) ) )
=> ? [X4: a > $o] :
( ( X4 @ ( cP @ ( cR @ X1 ) @ ( cR @ X2 ) ) )
& ! [X3: a,X5: a] :
( ( X4 @ ( cP @ X3 @ X5 ) )
=> ( ( ( X5 = cZ )
=> ( X3 = cZ ) )
& ( X4 @ ( cP @ ( cL @ X3 ) @ ( cL @ X5 ) ) )
& ( X4 @ ( cP @ ( cR @ X3 ) @ ( cR @ X5 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.62PeCsiwYU/E---3.1_2770218.p',cPU_LEM2C_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ( ( ( cL @ cZ )
= cZ )
& ( ( cR @ cZ )
= cZ )
& ! [X1: a,X2: a] :
( ( cL @ ( cP @ X1 @ X2 ) )
= X1 )
& ! [X1: a,X2: a] :
( ( cR @ ( cP @ X1 @ X2 ) )
= X2 )
& ! [X3: a] :
( ( X3 != cZ )
<=> ( X3
= ( cP @ ( cL @ X3 ) @ ( cR @ X3 ) ) ) )
& ! [X4: a > $o] :
( ! [X3: a,X5: a] :
( ( X4 @ ( cP @ X3 @ X5 ) )
=> ( ( ( X3 = cZ )
<=> ( X5 = cZ ) )
& ( X4 @ ( cP @ ( cL @ X3 ) @ ( cL @ X5 ) ) )
& ( X4 @ ( cP @ ( cR @ X3 ) @ ( cR @ X5 ) ) ) ) )
=> ! [X3: a,X5: a] :
( ( X4 @ ( cP @ X3 @ X5 ) )
=> ( X3 = X5 ) ) ) )
=> ! [X1: a,X2: a] :
( ? [X4: a > $o] :
( ( X4 @ ( cP @ X1 @ X2 ) )
& ! [X3: a,X5: a] :
( ( X4 @ ( cP @ X3 @ X5 ) )
=> ( ( ( X5 = cZ )
=> ( X3 = cZ ) )
& ( X4 @ ( cP @ ( cL @ X3 ) @ ( cL @ X5 ) ) )
& ( X4 @ ( cP @ ( cR @ X3 ) @ ( cR @ X5 ) ) ) ) ) )
=> ? [X4: a > $o] :
( ( X4 @ ( cP @ ( cR @ X1 ) @ ( cR @ X2 ) ) )
& ! [X3: a,X5: a] :
( ( X4 @ ( cP @ X3 @ X5 ) )
=> ( ( ( X5 = cZ )
=> ( X3 = cZ ) )
& ( X4 @ ( cP @ ( cL @ X3 ) @ ( cL @ X5 ) ) )
& ( X4 @ ( cP @ ( cR @ X3 ) @ ( cR @ X5 ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[cPU_LEM2C_pme]) ).
thf(c_0_2,negated_conjecture,
~ ( ( ( ( cL @ cZ )
= cZ )
& ( ( cR @ cZ )
= cZ )
& ! [X1: a,X2: a] :
( ( cL @ ( cP @ X1 @ X2 ) )
= X1 )
& ! [X1: a,X2: a] :
( ( cR @ ( cP @ X1 @ X2 ) )
= X2 )
& ! [X3: a] :
( ( X3 != cZ )
<=> ( X3
= ( cP @ ( cL @ X3 ) @ ( cR @ X3 ) ) ) )
& ! [X4: a > $o] :
( ! [X3: a,X5: a] :
( ( X4 @ ( cP @ X3 @ X5 ) )
=> ( ( ( X3 = cZ )
<=> ( X5 = cZ ) )
& ( X4 @ ( cP @ ( cL @ X3 ) @ ( cL @ X5 ) ) )
& ( X4 @ ( cP @ ( cR @ X3 ) @ ( cR @ X5 ) ) ) ) )
=> ! [X3: a,X5: a] :
( ( X4 @ ( cP @ X3 @ X5 ) )
=> ( X3 = X5 ) ) ) )
=> ! [X1: a,X2: a] :
( ? [X4: a > $o] :
( ( X4 @ ( cP @ X1 @ X2 ) )
& ! [X3: a,X5: a] :
( ( X4 @ ( cP @ X3 @ X5 ) )
=> ( ( ( X5 = cZ )
=> ( X3 = cZ ) )
& ( X4 @ ( cP @ ( cL @ X3 ) @ ( cL @ X5 ) ) )
& ( X4 @ ( cP @ ( cR @ X3 ) @ ( cR @ X5 ) ) ) ) ) )
=> ? [X4: a > $o] :
( ( X4 @ ( cP @ ( cR @ X1 ) @ ( cR @ X2 ) ) )
& ! [X3: a,X5: a] :
( ( X4 @ ( cP @ X3 @ X5 ) )
=> ( ( ( X5 = cZ )
=> ( X3 = cZ ) )
& ( X4 @ ( cP @ ( cL @ X3 ) @ ( cL @ X5 ) ) )
& ( X4 @ ( cP @ ( cR @ X3 ) @ ( cR @ X5 ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
thf(c_0_3,negated_conjecture,
! [X24: a,X25: a,X26: a,X27: a,X28: a,X29: a > $o,X32: a,X33: a,X37: a,X38: a,X39: a > $o] :
( ( ( cL @ cZ )
= cZ )
& ( ( cR @ cZ )
= cZ )
& ( ( cL @ ( cP @ X24 @ X25 ) )
= X24 )
& ( ( cR @ ( cP @ X26 @ X27 ) )
= X27 )
& ( ( X28 = cZ )
| ( X28
= ( cP @ ( cL @ X28 ) @ ( cR @ X28 ) ) ) )
& ( ( X28
!= ( cP @ ( cL @ X28 ) @ ( cR @ X28 ) ) )
| ( X28 != cZ ) )
& ( ( X29 @ ( cP @ ( esk1_1 @ X29 ) @ ( esk2_1 @ X29 ) ) )
| ~ ( X29 @ ( cP @ X32 @ X33 ) )
| ( X32 = X33 ) )
& ( ( ( esk1_1 @ X29 )
!= cZ )
| ( ( esk2_1 @ X29 )
!= cZ )
| ~ ( X29 @ ( cP @ ( cL @ ( esk1_1 @ X29 ) ) @ ( cL @ ( esk2_1 @ X29 ) ) ) )
| ~ ( X29 @ ( cP @ ( cR @ ( esk1_1 @ X29 ) ) @ ( cR @ ( esk2_1 @ X29 ) ) ) )
| ~ ( X29 @ ( cP @ X32 @ X33 ) )
| ( X32 = X33 ) )
& ( ( ( esk1_1 @ X29 )
= cZ )
| ( ( esk2_1 @ X29 )
= cZ )
| ~ ( X29 @ ( cP @ ( cL @ ( esk1_1 @ X29 ) ) @ ( cL @ ( esk2_1 @ X29 ) ) ) )
| ~ ( X29 @ ( cP @ ( cR @ ( esk1_1 @ X29 ) ) @ ( cR @ ( esk2_1 @ X29 ) ) ) )
| ~ ( X29 @ ( cP @ X32 @ X33 ) )
| ( X32 = X33 ) )
& ( epred1_0 @ ( cP @ esk3_0 @ esk4_0 ) )
& ( ( X38 != cZ )
| ( X37 = cZ )
| ~ ( epred1_0 @ ( cP @ X37 @ X38 ) ) )
& ( ( epred1_0 @ ( cP @ ( cL @ X37 ) @ ( cL @ X38 ) ) )
| ~ ( epred1_0 @ ( cP @ X37 @ X38 ) ) )
& ( ( epred1_0 @ ( cP @ ( cR @ X37 ) @ ( cR @ X38 ) ) )
| ~ ( epred1_0 @ ( cP @ X37 @ X38 ) ) )
& ( ( X39 @ ( cP @ ( esk5_1 @ X39 ) @ ( esk6_1 @ X39 ) ) )
| ~ ( X39 @ ( cP @ ( cR @ esk3_0 ) @ ( cR @ esk4_0 ) ) ) )
& ( ( ( esk6_1 @ X39 )
= cZ )
| ~ ( X39 @ ( cP @ ( cL @ ( esk5_1 @ X39 ) ) @ ( cL @ ( esk6_1 @ X39 ) ) ) )
| ~ ( X39 @ ( cP @ ( cR @ ( esk5_1 @ X39 ) ) @ ( cR @ ( esk6_1 @ X39 ) ) ) )
| ~ ( X39 @ ( cP @ ( cR @ esk3_0 ) @ ( cR @ esk4_0 ) ) ) )
& ( ( ( esk5_1 @ X39 )
!= cZ )
| ~ ( X39 @ ( cP @ ( cL @ ( esk5_1 @ X39 ) ) @ ( cL @ ( esk6_1 @ X39 ) ) ) )
| ~ ( X39 @ ( cP @ ( cR @ ( esk5_1 @ X39 ) ) @ ( cR @ ( esk6_1 @ X39 ) ) ) )
| ~ ( X39 @ ( cP @ ( cR @ esk3_0 ) @ ( cR @ esk4_0 ) ) ) ) ),
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 > $o] :
( ( X4 @ ( cP @ ( esk5_1 @ X4 ) @ ( esk6_1 @ X4 ) ) )
| ~ ( X4 @ ( cP @ ( cR @ esk3_0 ) @ ( cR @ esk4_0 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X1: a,X2: a] :
( ( epred1_0 @ ( cP @ ( cR @ X1 ) @ ( cR @ X2 ) ) )
| ~ ( epred1_0 @ ( cP @ X1 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
epred1_0 @ ( cP @ esk3_0 @ esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_7,negated_conjecture,
! [X4: a > $o] :
( ( ( esk6_1 @ X4 )
= cZ )
| ~ ( X4 @ ( cP @ ( cL @ ( esk5_1 @ X4 ) ) @ ( cL @ ( esk6_1 @ X4 ) ) ) )
| ~ ( X4 @ ( cP @ ( cR @ ( esk5_1 @ X4 ) ) @ ( cR @ ( esk6_1 @ X4 ) ) ) )
| ~ ( X4 @ ( cP @ ( cR @ esk3_0 ) @ ( cR @ esk4_0 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_8,negated_conjecture,
epred1_0 @ ( cP @ ( esk5_1 @ epred1_0 ) @ ( esk6_1 @ epred1_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6])]) ).
thf(c_0_9,negated_conjecture,
( ( ( esk6_1 @ epred1_0 )
= cZ )
| ~ ( epred1_0 @ ( cP @ ( cL @ ( esk5_1 @ epred1_0 ) ) @ ( cL @ ( esk6_1 @ epred1_0 ) ) ) )
| ~ ( epred1_0 @ ( cP @ ( cR @ esk3_0 ) @ ( cR @ esk4_0 ) ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_5]),c_0_8])]) ).
thf(c_0_10,negated_conjecture,
! [X1: a,X2: a] :
( ( epred1_0 @ ( cP @ ( cL @ X1 ) @ ( cL @ X2 ) ) )
| ~ ( epred1_0 @ ( cP @ X1 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_11,negated_conjecture,
! [X4: a > $o] :
( ( ( esk5_1 @ X4 )
!= cZ )
| ~ ( X4 @ ( cP @ ( cL @ ( esk5_1 @ X4 ) ) @ ( cL @ ( esk6_1 @ X4 ) ) ) )
| ~ ( X4 @ ( cP @ ( cR @ ( esk5_1 @ X4 ) ) @ ( cR @ ( esk6_1 @ X4 ) ) ) )
| ~ ( X4 @ ( cP @ ( cR @ esk3_0 ) @ ( cR @ esk4_0 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_12,negated_conjecture,
( ( ( esk6_1 @ epred1_0 )
= cZ )
| ~ ( epred1_0 @ ( cP @ ( cR @ esk3_0 ) @ ( cR @ esk4_0 ) ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_8])]) ).
thf(c_0_13,negated_conjecture,
( ( ( esk5_1 @ epred1_0 )
!= cZ )
| ~ ( epred1_0 @ ( cP @ ( cL @ ( esk5_1 @ epred1_0 ) ) @ ( cL @ ( esk6_1 @ epred1_0 ) ) ) )
| ~ ( epred1_0 @ ( cP @ ( cR @ esk3_0 ) @ ( cR @ esk4_0 ) ) ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_5]),c_0_4]) ).
thf(c_0_14,negated_conjecture,
! [X2: a,X1: a] :
( ( X2 = cZ )
| ( X1 != cZ )
| ~ ( epred1_0 @ ( cP @ X2 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_15,negated_conjecture,
( ( esk6_1 @ epred1_0 )
= cZ ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_5]),c_0_6])]) ).
thf(c_0_16,negated_conjecture,
( ( ( esk5_1 @ epred1_0 )
!= cZ )
| ~ ( epred1_0 @ ( cP @ ( cR @ esk3_0 ) @ ( cR @ esk4_0 ) ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_10]),c_0_8])]) ).
thf(c_0_17,negated_conjecture,
! [X1: a] :
( ( X1 = cZ )
| ~ ( epred1_0 @ ( cP @ X1 @ cZ ) ) ),
inference(er,[status(thm)],[c_0_14]) ).
thf(c_0_18,negated_conjecture,
epred1_0 @ ( cP @ ( esk5_1 @ epred1_0 ) @ cZ ),
inference(spm,[status(thm)],[c_0_8,c_0_15]) ).
thf(c_0_19,negated_conjecture,
( ( esk5_1 @ epred1_0 )
!= cZ ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_5]),c_0_6])]) ).
thf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU974^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.15 % Computer : n014.cluster.edu
% 0.11/0.15 % Model : x86_64 x86_64
% 0.11/0.15 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.15 % Memory : 8046.5625MB
% 0.11/0.15 % OS : Linux 6.8.0-71-generic
% 0.11/0.15 % CPULimit : 300
% 0.11/0.15 % WCLimit : 300
% 0.11/0.15 % DateTime : Tue Sep 29 14:54:29 UTC 2026
% 0.11/0.16 % CPUTime :
% 0.11/0.16 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.19 Running higher-order theorem proving
% 0.11/0.20 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/tmp/tmp.62PeCsiwYU/E---3.1_2770218.p
% 0.11/0.22 % Version: 3.5.1-ho
% 0.11/0.22 % Preprocessing class: HSMSSMSSSSSNSSA.
% 0.11/0.22 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.22 % Starting post_as_ho1 with 1500s (5) cores
% 0.11/0.22 % Starting post_as_ho12 with 300s (1) cores
% 0.11/0.22 % Starting new_ho_3 with 300s (1) cores
% 0.11/0.22 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.11/0.22 % post_as_ho1 with pid 2770231 completed with status 0
% 0.11/0.22 % Result found by post_as_ho1
% 0.11/0.22 % Preprocessing class: HSMSSMSSSSSNSSA.
% 0.11/0.22 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.22 % Starting post_as_ho1 with 1500s (5) cores
% 0.11/0.22 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.22 % No SInE strategy applied
% 0.11/0.22 % Search class: HGHSS-FFMS21-MSSFFSBN
% 0.11/0.22 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.22 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.22 % Starting post_as_ho1 with 151s (1) cores
% 0.11/0.22 % Starting sh5l with 203s (1) cores
% 0.11/0.22 % Starting new_bool_1 with 203s (1) cores
% 0.11/0.22 % Starting new_bool_2 with 203s (1) cores
% 0.11/0.22 % sh5l with pid 2770240 completed with status 0
% 0.11/0.22 % Result found by sh5l
% 0.11/0.22 % Preprocessing class: HSMSSMSSSSSNSSA.
% 0.11/0.22 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.22 % Starting post_as_ho1 with 1500s (5) cores
% 0.11/0.22 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.22 % No SInE strategy applied
% 0.11/0.22 % Search class: HGHSS-FFMS21-MSSFFSBN
% 0.11/0.22 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.22 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.22 % Starting post_as_ho1 with 151s (1) cores
% 0.11/0.22 % Starting sh5l with 203s (1) cores
% 0.11/0.22 % Preprocessing time : 0.001 s
% 0.11/0.22 % Presaturation interreduction done
% 0.11/0.22
% 0.11/0.22 % Proof found!
% 0.11/0.22 % SZS status Theorem
% 0.11/0.22 % SZS output start CNFRefutation
% See solution above
% 0.11/0.22 % Parsed axioms : 6
% 0.11/0.22 % Removed by relevancy pruning/SinE : 0
% 0.11/0.22 % Initial clauses : 21
% 0.11/0.22 % Removed in clause preprocessing : 5
% 0.11/0.22 % Initial clauses in saturation : 16
% 0.11/0.22 % Processed clauses : 51
% 0.11/0.22 % ...of these trivial : 0
% 0.11/0.22 % ...subsumed : 1
% 0.11/0.22 % ...remaining for further processing : 50
% 0.11/0.22 % Other redundant clauses eliminated : 2
% 0.11/0.22 % Clauses deleted for lack of memory : 0
% 0.11/0.22 % Backward-subsumed : 4
% 0.11/0.22 % Backward-rewritten : 2
% 0.11/0.22 % Generated clauses : 50
% 0.11/0.22 % ...of the previous two non-redundant : 43
% 0.11/0.22 % ...aggressively subsumed : 0
% 0.11/0.22 % Contextual simplify-reflections : 1
% 0.11/0.22 % Paramodulations : 46
% 0.11/0.22 % Factorizations : 0
% 0.11/0.22 % NegExts : 0
% 0.11/0.22 % Equation resolutions : 2
% 0.11/0.22 % Disequality decompositions : 0
% 0.11/0.22 % Total rewrite steps : 18
% 0.11/0.22 % ...of those cached : 10
% 0.11/0.22 % Propositional unsat checks : 0
% 0.11/0.22 % Propositional check models : 0
% 0.11/0.22 % Propositional check unsatisfiable : 0
% 0.11/0.22 % Propositional clauses : 0
% 0.11/0.22 % Propositional clauses after purity: 0
% 0.11/0.22 % Propositional unsat core size : 0
% 0.11/0.22 % Propositional preprocessing time : 0.000
% 0.11/0.22 % Propositional encoding time : 0.000
% 0.11/0.22 % Propositional solver time : 0.000
% 0.11/0.22 % Success case prop preproc time : 0.000
% 0.11/0.22 % Success case prop encoding time : 0.000
% 0.11/0.22 % Success case prop solver time : 0.000
% 0.11/0.22 % Current number of processed clauses : 26
% 0.11/0.22 % Positive orientable unit clauses : 9
% 0.11/0.22 % Positive unorientable unit clauses: 0
% 0.11/0.22 % Negative unit clauses : 2
% 0.11/0.22 % Non-unit-clauses : 15
% 0.11/0.22 % Current number of unprocessed clauses: 23
% 0.11/0.22 % ...number of literals in the above : 67
% 0.11/0.22 % Current number of archived formulas : 0
% 0.11/0.22 % Current number of archived clauses : 22
% 0.11/0.22 % Clause-clause subsumption calls (NU) : 75
% 0.11/0.22 % Rec. Clause-clause subsumption calls : 31
% 0.11/0.22 % Non-unit clause-clause subsumptions : 4
% 0.11/0.22 % Unit Clause-clause subsumption calls : 7
% 0.11/0.22 % Rewrite failures with RHS unbound : 0
% 0.11/0.22 % BW rewrite match attempts : 2
% 0.11/0.22 % BW rewrite match successes : 2
% 0.11/0.22 % Condensation attempts : 51
% 0.11/0.22 % Condensation successes : 0
% 0.11/0.22 % Termbank termtop insertions : 5045
% 0.11/0.22 % Search garbage collected termcells : 625
% 0.11/0.22
% 0.11/0.22 % -------------------------------------------------
% 0.11/0.22 % User time : 0.005 s
% 0.11/0.22 % System time : 0.004 s
% 0.11/0.22 % Total time : 0.009 s
% 0.11/0.22 % Maximum resident set size: 3588 pages
% 0.11/0.22
% 0.11/0.22 % -------------------------------------------------
% 0.11/0.22 % User time : 0.023 s
% 0.11/0.22 % System time : 0.011 s
% 0.11/0.22 % Total time : 0.034 s
% 0.11/0.22 % Maximum resident set size: 4864 pages
% 0.11/0.22 % E exiting
%------------------------------------------------------------------------------