%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU768^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:25:33 AM UTC 2026
% Result : Theorem 0.08s 0.25s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 4
% Syntax : Number of formulae : 31 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 119 ( 6 equ; 0 cnn)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 603 ( 46 ~; 60 |; 7 &; 450 @)
% ( 1 <=>; 39 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 10 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 21 ( 21 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 13 usr; 5 con; 0-4 aty)
% Number of variables : 111 ( 12 ^; 99 !; 0 ?; 111 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
in: $i > $i > $o ).
thf(decl_24,type,
subset: $i > $i > $o ).
thf(decl_25,type,
kpair: $i > $i > $i ).
thf(decl_26,type,
cartprod: $i > $i > $i ).
thf(decl_27,type,
breln: $i > $i > $i > $o ).
thf(decl_28,type,
brelnall2: $o ).
thf(decl_29,type,
breln1: $i > $i > $o ).
thf(decl_30,type,
esk1_4: $i > $i > $i > ( $i > $o ) > $i ).
thf(decl_31,type,
esk2_4: $i > $i > $i > ( $i > $o ) > $i ).
thf(decl_32,type,
esk3_0: $i ).
thf(decl_33,type,
esk4_0: $i ).
thf(decl_34,type,
epred1_0: $i > $o ).
thf(decl_35,type,
esk5_0: $i ).
thf(breln1,axiom,
( breln1
= ( ^ [X1: $i,X4: $i] : ( breln @ X1 @ X1 @ X4 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.TuqqTIw98v/E---3.1_160604.p',breln1) ).
thf(breln,axiom,
( breln
= ( ^ [X1: $i,X2: $i,X3: $i] : ( subset @ X3 @ ( cartprod @ X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.TuqqTIw98v/E---3.1_160604.p',breln) ).
thf(breln1all2,conjecture,
( brelnall2
=> ! [X1: $i,X4: $i] :
( ( breln1 @ X1 @ X4 )
=> ! [X5: $i > $o] :
( ! [X6: $i] :
( ( in @ X6 @ X1 )
=> ! [X7: $i] :
( ( in @ X7 @ X1 )
=> ( ( in @ ( kpair @ X6 @ X7 ) @ X4 )
=> ( X5 @ ( kpair @ X6 @ X7 ) ) ) ) )
=> ! [X6: $i] :
( ( in @ X6 @ X4 )
=> ( X5 @ X6 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.TuqqTIw98v/E---3.1_160604.p',breln1all2) ).
thf(brelnall2,axiom,
( brelnall2
<=> ! [X1: $i,X2: $i,X4: $i] :
( ( breln @ X1 @ X2 @ X4 )
=> ! [X5: $i > $o] :
( ! [X6: $i] :
( ( in @ X6 @ X1 )
=> ! [X7: $i] :
( ( in @ X7 @ X2 )
=> ( ( in @ ( kpair @ X6 @ X7 ) @ X4 )
=> ( X5 @ ( kpair @ X6 @ X7 ) ) ) ) )
=> ! [X6: $i] :
( ( in @ X6 @ X4 )
=> ( X5 @ X6 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.TuqqTIw98v/E---3.1_160604.p',brelnall2) ).
thf(c_0_4,plain,
( breln1
= ( ^ [Z0: $i,Z1: $i] : ( subset @ Z1 @ ( cartprod @ Z0 @ Z0 ) ) ) ),
inference(fof_simplification,[status(thm)],[breln1]) ).
thf(c_0_5,plain,
( breln
= ( ^ [Z0: $i,Z1: $i,Z2: $i] : ( subset @ Z2 @ ( cartprod @ Z0 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[breln]) ).
thf(c_0_6,negated_conjecture,
~ ( brelnall2
=> ! [X1: $i,X4: $i] :
( ( breln1 @ X1 @ X4 )
=> ! [X5: $i > $o] :
( ! [X6: $i] :
( ( in @ X6 @ X1 )
=> ! [X7: $i] :
( ( in @ X7 @ X1 )
=> ( ( in @ ( kpair @ X6 @ X7 ) @ X4 )
=> ( X5 @ ( kpair @ X6 @ X7 ) ) ) ) )
=> ! [X6: $i] :
( ( in @ X6 @ X4 )
=> ( X5 @ X6 ) ) ) ) ),
inference(assume_negation,[status(cth)],[breln1all2]) ).
thf(c_0_7,plain,
( breln1
= ( ^ [Z0: $i,Z1: $i] : ( subset @ Z1 @ ( cartprod @ Z0 @ Z0 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_4,c_0_5]) ).
thf(c_0_8,axiom,
( brelnall2
= ( ! [X1: $i,X2: $i,X4: $i] :
( ( subset @ X4 @ ( cartprod @ X1 @ X2 ) )
=> ! [X5: $i > $o] :
( ! [X6: $i] :
( ( in @ X6 @ X1 )
=> ! [X7: $i] :
( ( in @ X7 @ X2 )
=> ( ( in @ ( kpair @ X6 @ X7 ) @ X4 )
=> ( X5 @ ( kpair @ X6 @ X7 ) ) ) ) )
=> ! [X6: $i] :
( ( in @ X6 @ X4 )
=> ( X5 @ X6 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[brelnall2,c_0_5]) ).
thf(c_0_9,negated_conjecture,
~ ( ! [X21: $i,X22: $i,X23: $i] :
( ( subset @ X23 @ ( cartprod @ X21 @ X22 ) )
=> ! [X24: $i > $o] :
( ! [X25: $i] :
( ( in @ X25 @ X21 )
=> ! [X26: $i] :
( ( in @ X26 @ X22 )
=> ( ( in @ ( kpair @ X25 @ X26 ) @ X23 )
=> ( X24 @ ( kpair @ X25 @ X26 ) ) ) ) )
=> ! [X27: $i] :
( ( in @ X27 @ X23 )
=> ( X24 @ X27 ) ) ) )
=> ! [X1: $i,X4: $i] :
( ( subset @ X4 @ ( cartprod @ X1 @ X1 ) )
=> ! [X5: $i > $o] :
( ! [X6: $i] :
( ( in @ X6 @ X1 )
=> ! [X7: $i] :
( ( in @ X7 @ X1 )
=> ( ( in @ ( kpair @ X6 @ X7 ) @ X4 )
=> ( X5 @ ( kpair @ X6 @ X7 ) ) ) ) )
=> ! [X6: $i] :
( ( in @ X6 @ X4 )
=> ( X5 @ X6 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
thf(c_0_10,negated_conjecture,
! [X28: $i,X29: $i,X30: $i,X31: $i > $o,X34: $i,X38: $i,X39: $i] :
( ( ( in @ ( esk1_4 @ X28 @ X29 @ X30 @ X31 ) @ X28 )
| ~ ( in @ X34 @ X30 )
| ( X31 @ X34 )
| ~ ( subset @ X30 @ ( cartprod @ X28 @ X29 ) ) )
& ( ( in @ ( esk2_4 @ X28 @ X29 @ X30 @ X31 ) @ X29 )
| ~ ( in @ X34 @ X30 )
| ( X31 @ X34 )
| ~ ( subset @ X30 @ ( cartprod @ X28 @ X29 ) ) )
& ( ( in @ ( kpair @ ( esk1_4 @ X28 @ X29 @ X30 @ X31 ) @ ( esk2_4 @ X28 @ X29 @ X30 @ X31 ) ) @ X30 )
| ~ ( in @ X34 @ X30 )
| ( X31 @ X34 )
| ~ ( subset @ X30 @ ( cartprod @ X28 @ X29 ) ) )
& ( ~ ( X31 @ ( kpair @ ( esk1_4 @ X28 @ X29 @ X30 @ X31 ) @ ( esk2_4 @ X28 @ X29 @ X30 @ X31 ) ) )
| ~ ( in @ X34 @ X30 )
| ( X31 @ X34 )
| ~ ( subset @ X30 @ ( cartprod @ X28 @ X29 ) ) )
& ( subset @ esk4_0 @ ( cartprod @ esk3_0 @ esk3_0 ) )
& ( ~ ( in @ X38 @ esk3_0 )
| ~ ( in @ X39 @ esk3_0 )
| ~ ( in @ ( kpair @ X38 @ X39 ) @ esk4_0 )
| ( epred1_0 @ ( kpair @ X38 @ X39 ) ) )
& ( in @ esk5_0 @ esk4_0 )
& ~ ( epred1_0 @ esk5_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_9])])])])])]) ).
thf(c_0_11,negated_conjecture,
! [X1: $i,X5: $i > $o,X4: $i,X3: $i,X2: $i] :
( ( in @ ( kpair @ ( esk1_4 @ X1 @ X2 @ X3 @ X5 ) @ ( esk2_4 @ X1 @ X2 @ X3 @ X5 ) ) @ X3 )
| ( X5 @ X4 )
| ~ ( in @ X4 @ X3 )
| ~ ( subset @ X3 @ ( cartprod @ X1 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_12,negated_conjecture,
in @ esk5_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i,X5: $i > $o,X4: $i,X3: $i,X2: $i] :
( ( in @ ( esk2_4 @ X1 @ X2 @ X3 @ X5 ) @ X2 )
| ( X5 @ X4 )
| ~ ( in @ X4 @ X3 )
| ~ ( subset @ X3 @ ( cartprod @ X1 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i,X5: $i > $o,X2: $i] :
( ( in @ ( kpair @ ( esk1_4 @ X1 @ X2 @ esk4_0 @ X5 ) @ ( esk2_4 @ X1 @ X2 @ esk4_0 @ X5 ) ) @ esk4_0 )
| ( X5 @ esk5_0 )
| ~ ( subset @ esk4_0 @ ( cartprod @ X1 @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i,X10: $i > $o,X5: $i > $o,X4: $i,X3: $i,X2: $i] :
( ( X5 @ ( kpair @ ( esk1_4 @ X1 @ X2 @ esk4_0 @ X10 ) @ ( esk2_4 @ X1 @ X2 @ esk4_0 @ X10 ) ) )
| ( in @ ( esk2_4 @ X3 @ X4 @ esk4_0 @ X5 ) @ X4 )
| ( X10 @ esk5_0 )
| ~ ( subset @ esk4_0 @ ( cartprod @ X3 @ X4 ) )
| ~ ( subset @ esk4_0 @ ( cartprod @ X1 @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_16,negated_conjecture,
subset @ esk4_0 @ ( cartprod @ esk3_0 @ esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i,X5: $i > $o,X4: $i,X3: $i,X2: $i] :
( ( X5 @ X4 )
| ~ ( X5 @ ( kpair @ ( esk1_4 @ X1 @ X2 @ X3 @ X5 ) @ ( esk2_4 @ X1 @ X2 @ X3 @ X5 ) ) )
| ~ ( in @ X4 @ X3 )
| ~ ( subset @ X3 @ ( cartprod @ X1 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_18,negated_conjecture,
! [X1: $i,X10: $i > $o,X5: $i > $o,X2: $i] :
( ( X5 @ ( kpair @ ( esk1_4 @ X1 @ X2 @ esk4_0 @ X10 ) @ ( esk2_4 @ X1 @ X2 @ esk4_0 @ X10 ) ) )
| ( in @ ( esk2_4 @ esk3_0 @ esk3_0 @ esk4_0 @ X5 ) @ esk3_0 )
| ( X10 @ esk5_0 )
| ~ ( subset @ esk4_0 @ ( cartprod @ X1 @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_19,negated_conjecture,
! [X1: $i,X2: $i] :
( ( epred1_0 @ ( kpair @ X1 @ X2 ) )
| ~ ( in @ X1 @ esk3_0 )
| ~ ( in @ X2 @ esk3_0 )
| ~ ( in @ ( kpair @ X1 @ X2 ) @ esk4_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_20,negated_conjecture,
! [X5: $i > $o,X3: $i,X2: $i,X1: $i] :
( ( in @ ( esk2_4 @ esk3_0 @ esk3_0 @ esk4_0 @ X5 ) @ esk3_0 )
| ( X5 @ esk5_0 )
| ( X5 @ X1 )
| ~ ( subset @ esk4_0 @ ( cartprod @ X2 @ X3 ) )
| ~ ( in @ X1 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_21,negated_conjecture,
! [X1: $i,X5: $i > $o,X2: $i] :
( ( epred1_0 @ ( kpair @ ( esk1_4 @ X1 @ X2 @ esk4_0 @ X5 ) @ ( esk2_4 @ X1 @ X2 @ esk4_0 @ X5 ) ) )
| ( X5 @ esk5_0 )
| ~ ( in @ ( esk2_4 @ X1 @ X2 @ esk4_0 @ X5 ) @ esk3_0 )
| ~ ( in @ ( esk1_4 @ X1 @ X2 @ esk4_0 @ X5 ) @ esk3_0 )
| ~ ( subset @ esk4_0 @ ( cartprod @ X1 @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_19,c_0_14]) ).
thf(c_0_22,negated_conjecture,
~ ( epred1_0 @ esk5_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_23,negated_conjecture,
! [X5: $i > $o,X1: $i] :
( ( in @ ( esk2_4 @ esk3_0 @ esk3_0 @ esk4_0 @ X5 ) @ esk3_0 )
| ( X5 @ esk5_0 )
| ( X5 @ X1 )
| ~ ( in @ X1 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_20,c_0_16]) ).
thf(c_0_24,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( epred1_0 @ X1 )
| ~ ( in @ ( esk2_4 @ X2 @ X3 @ esk4_0 @ epred1_0 ) @ esk3_0 )
| ~ ( in @ ( esk1_4 @ X2 @ X3 @ esk4_0 @ epred1_0 ) @ esk3_0 )
| ~ ( subset @ esk4_0 @ ( cartprod @ X2 @ X3 ) )
| ~ ( in @ X1 @ esk4_0 ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_21]),c_0_22]) ).
thf(c_0_25,negated_conjecture,
! [X5: $i > $o] :
( ( in @ ( esk2_4 @ esk3_0 @ esk3_0 @ esk4_0 @ X5 ) @ esk3_0 )
| ( X5 @ esk5_0 ) ),
inference(spm,[status(thm)],[c_0_23,c_0_12]) ).
thf(c_0_26,negated_conjecture,
! [X1: $i,X5: $i > $o,X4: $i,X3: $i,X2: $i] :
( ( in @ ( esk1_4 @ X1 @ X2 @ X3 @ X5 ) @ X1 )
| ( X5 @ X4 )
| ~ ( in @ X4 @ X3 )
| ~ ( subset @ X3 @ ( cartprod @ X1 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_27,negated_conjecture,
! [X1: $i] :
( ( epred1_0 @ X1 )
| ~ ( in @ ( esk1_4 @ esk3_0 @ esk3_0 @ esk4_0 @ epred1_0 ) @ esk3_0 )
| ~ ( in @ X1 @ esk4_0 ) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_16])]),c_0_22]) ).
thf(c_0_28,negated_conjecture,
! [X1: $i,X5: $i > $o,X2: $i] :
( ( in @ ( esk1_4 @ X1 @ X2 @ esk4_0 @ X5 ) @ X1 )
| ( X5 @ esk5_0 )
| ~ ( subset @ esk4_0 @ ( cartprod @ X1 @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_26,c_0_12]) ).
thf(c_0_29,negated_conjecture,
! [X1: $i] :
( ( epred1_0 @ X1 )
| ~ ( in @ X1 @ esk4_0 ) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_16])]),c_0_22]) ).
thf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_12]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU768^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.16 % Computer : n011.cluster.edu
% 0.08/0.16 % Model : x86_64 x86_64
% 0.08/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.16 % Memory : 8046.5625MB
% 0.08/0.16 % OS : Linux 6.8.0-71-generic
% 0.08/0.16 % CPULimit : 300
% 0.08/0.16 % WCLimit : 300
% 0.08/0.16 % DateTime : Tue Sep 29 14:23:46 UTC 2026
% 0.08/0.17 % CPUTime :
% 0.08/0.17 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 Running higher-order theorem proving
% 0.08/0.22 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.TuqqTIw98v/E---3.1_160604.p
% 0.08/0.25 % Version: 3.5.1-ho
% 0.08/0.25 % Preprocessing class: HSSSSMSSSLSNSSA.
% 0.08/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.25 % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.25 % Starting sh5l with 300s (1) cores
% 0.08/0.25 % Starting new_bool_1 with 300s (1) cores
% 0.08/0.25 % Starting new_bool_2 with 300s (1) cores
% 0.08/0.25 % sh5l with pid 160618 completed with status 0
% 0.08/0.25 % Result found by sh5l
% 0.08/0.25 % Preprocessing class: HSSSSMSSSLSNSSA.
% 0.08/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.25 % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.25 % Starting sh5l with 300s (1) cores
% 0.08/0.25 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.08/0.25 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.08/0.25 % Search class: HGUNF-FFSF33-SSSFMMBN
% 0.08/0.25 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.25 % Starting SubtermCWHack with 31s (1) cores
% 0.08/0.25 % SubtermCWHack with pid 160622 completed with status 0
% 0.08/0.25 % Result found by SubtermCWHack
% 0.08/0.25 % Preprocessing class: HSSSSMSSSLSNSSA.
% 0.08/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.25 % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.25 % Starting sh5l with 300s (1) cores
% 0.08/0.25 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.08/0.25 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.08/0.25 % Search class: HGUNF-FFSF33-SSSFMMBN
% 0.08/0.25 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.25 % Starting SubtermCWHack with 31s (1) cores
% 0.08/0.25 % Preprocessing time : 0.001 s
% 0.08/0.25
% 0.08/0.25 % Proof found!
% 0.08/0.25 % SZS status Theorem
% 0.08/0.25 % SZS output start CNFRefutation
% See solution above
% 0.08/0.25 % Parsed axioms : 11
% 0.08/0.25 % Removed by relevancy pruning/SinE : 7
% 0.08/0.25 % Initial clauses : 8
% 0.08/0.25 % Removed in clause preprocessing : 0
% 0.08/0.25 % Initial clauses in saturation : 8
% 0.08/0.25 % Processed clauses : 48
% 0.08/0.25 % ...of these trivial : 0
% 0.08/0.25 % ...subsumed : 6
% 0.08/0.25 % ...remaining for further processing : 42
% 0.08/0.25 % Other redundant clauses eliminated : 0
% 0.08/0.25 % Clauses deleted for lack of memory : 0
% 0.08/0.25 % Backward-subsumed : 8
% 0.08/0.25 % Backward-rewritten : 0
% 0.08/0.25 % Generated clauses : 75
% 0.08/0.25 % ...of the previous two non-redundant : 69
% 0.08/0.25 % ...aggressively subsumed : 0
% 0.08/0.25 % Contextual simplify-reflections : 0
% 0.08/0.25 % Paramodulations : 75
% 0.08/0.25 % Factorizations : 0
% 0.08/0.25 % NegExts : 0
% 0.08/0.25 % Equation resolutions : 0
% 0.08/0.25 % Disequality decompositions : 0
% 0.08/0.25 % Total rewrite steps : 3
% 0.08/0.25 % ...of those cached : 2
% 0.08/0.25 % Propositional unsat checks : 0
% 0.08/0.25 % Propositional check models : 0
% 0.08/0.25 % Propositional check unsatisfiable : 0
% 0.08/0.25 % Propositional clauses : 0
% 0.08/0.25 % Propositional clauses after purity: 0
% 0.08/0.25 % Propositional unsat core size : 0
% 0.08/0.25 % Propositional preprocessing time : 0.000
% 0.08/0.25 % Propositional encoding time : 0.000
% 0.08/0.25 % Propositional solver time : 0.000
% 0.08/0.25 % Success case prop preproc time : 0.000
% 0.08/0.25 % Success case prop encoding time : 0.000
% 0.08/0.25 % Success case prop solver time : 0.000
% 0.08/0.25 % Current number of processed clauses : 34
% 0.08/0.25 % Positive orientable unit clauses : 2
% 0.08/0.25 % Positive unorientable unit clauses: 0
% 0.08/0.25 % Negative unit clauses : 1
% 0.08/0.25 % Non-unit-clauses : 31
% 0.08/0.25 % Current number of unprocessed clauses: 23
% 0.08/0.25 % ...number of literals in the above : 113
% 0.08/0.25 % Current number of archived formulas : 0
% 0.08/0.25 % Current number of archived clauses : 8
% 0.08/0.25 % Clause-clause subsumption calls (NU) : 230
% 0.08/0.25 % Rec. Clause-clause subsumption calls : 62
% 0.08/0.25 % Non-unit clause-clause subsumptions : 14
% 0.08/0.25 % Unit Clause-clause subsumption calls : 0
% 0.08/0.25 % Rewrite failures with RHS unbound : 0
% 0.08/0.25 % BW rewrite match attempts : 0
% 0.08/0.25 % BW rewrite match successes : 0
% 0.08/0.25 % Condensation attempts : 0
% 0.08/0.25 % Condensation successes : 0
% 0.08/0.25 % Termbank termtop insertions : 4061
% 0.08/0.25 % Search garbage collected termcells : 428
% 0.08/0.25
% 0.08/0.25 % -------------------------------------------------
% 0.08/0.25 % User time : 0.008 s
% 0.08/0.25 % System time : 0.000 s
% 0.08/0.25 % Total time : 0.008 s
% 0.08/0.25 % Maximum resident set size: 3896 pages
% 0.08/0.25
% 0.08/0.25 % -------------------------------------------------
% 0.08/0.25 % User time : 0.012 s
% 0.08/0.25 % System time : 0.003 s
% 0.08/0.25 % Total time : 0.015 s
% 0.08/0.25 % Maximum resident set size: 4608 pages
% 0.08/0.25 % E exiting
%------------------------------------------------------------------------------