%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU675^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:24:59 AM UTC 2026
% Result : Theorem 0.23s 0.28s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 32 ( 18 unt; 0 typ; 0 def)
% Number of atoms : 130 ( 28 equ; 0 cnn)
% Maximal formula atoms : 8 ( 4 avg)
% Number of connectives : 482 ( 23 ~; 17 |; 22 &; 401 @)
% ( 2 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 21 ( 19 usr; 7 con; 0-4 aty)
% Number of variables : 124 ( 61 ^; 52 !; 11 ?; 124 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
in: $i > $i > $o ).
thf(decl_24,type,
emptyset: $i ).
thf(decl_25,type,
setadjoin: $i > $i > $i ).
thf(decl_26,type,
powerset: $i > $i ).
thf(decl_27,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(decl_28,type,
dsetconstrER: $o ).
thf(decl_29,type,
subset: $i > $i > $o ).
thf(decl_30,type,
kpair: $i > $i > $i ).
thf(decl_31,type,
cartprod: $i > $i > $i ).
thf(decl_32,type,
singleton: $i > $o ).
thf(decl_33,type,
ex1: $i > ( $i > $o ) > $o ).
thf(decl_34,type,
breln: $i > $i > $i > $o ).
thf(decl_35,type,
func: $i > $i > $i > $o ).
thf(decl_36,type,
funcSet: $i > $i > $i ).
thf(decl_37,type,
esk1_0: $i ).
thf(decl_38,type,
esk2_0: $i ).
thf(decl_39,type,
esk3_0: $i ).
thf(decl_40,type,
esk4_0: $i ).
thf(decl_41,type,
esk5_4: $i > $i > $i > $i > $i ).
thf(ex1,axiom,
( ex1
= ( ^ [X1: $i,X2: $i > $o] :
( singleton
@ ( dsetconstr @ X1
@ ^ [X3: $i] : ( X2 @ X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.8s0okEC3L1/E---3.1_826622.p',ex1) ).
thf(singleton,axiom,
( singleton
= ( ^ [X1: $i] :
? [X3: $i] :
( ( in @ X3 @ X1 )
& ( X1
= ( setadjoin @ X3 @ emptyset ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.8s0okEC3L1/E---3.1_826622.p',singleton) ).
thf(func,axiom,
( func
= ( ^ [X1: $i,X5: $i,X7: $i] :
( ( breln @ X1 @ X5 @ X7 )
& ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( ex1 @ X5
@ ^ [X4: $i] : ( in @ ( kpair @ X3 @ X4 ) @ X7 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.8s0okEC3L1/E---3.1_826622.p',func) ).
thf(breln,axiom,
( breln
= ( ^ [X1: $i,X5: $i,X6: $i] : ( subset @ X6 @ ( cartprod @ X1 @ X5 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.8s0okEC3L1/E---3.1_826622.p',breln) ).
thf(infuncsetfunc,conjecture,
( dsetconstrER
=> ! [X1: $i,X5: $i,X8: $i] :
( ( in @ X8 @ ( funcSet @ X1 @ X5 ) )
=> ( func @ X1 @ X5 @ X8 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.8s0okEC3L1/E---3.1_826622.p',infuncsetfunc) ).
thf(dsetconstrER,axiom,
( dsetconstrER
<=> ! [X1: $i,X2: $i > $o,X3: $i] :
( ( in @ X3
@ ( dsetconstr @ X1
@ ^ [X4: $i] : ( X2 @ X4 ) ) )
=> ( X2 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.8s0okEC3L1/E---3.1_826622.p',dsetconstrER) ).
thf(funcSet,axiom,
( funcSet
= ( ^ [X1: $i,X5: $i] :
( dsetconstr @ ( powerset @ ( cartprod @ X1 @ X5 ) )
@ ^ [X8: $i] : ( func @ X1 @ X5 @ X8 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.8s0okEC3L1/E---3.1_826622.p',funcSet) ).
thf(c_0_7,plain,
( ex1
= ( ^ [Z0: $i,Z1: $i > $o] :
? [X15: $i] :
( ( in @ X15
@ ( dsetconstr @ Z0
@ ^ [Z2: $i] : ( Z1 @ Z2 ) ) )
& ( ( dsetconstr @ Z0
@ ^ [Z2: $i] : ( Z1 @ Z2 ) )
= ( setadjoin @ X15 @ emptyset ) ) ) ) ),
inference(fof_simplification,[status(thm)],[ex1]) ).
thf(c_0_8,plain,
( singleton
= ( ^ [Z0: $i] :
? [X3: $i] :
( ( in @ X3 @ Z0 )
& ( Z0
= ( setadjoin @ X3 @ emptyset ) ) ) ) ),
inference(fof_simplification,[status(thm)],[singleton]) ).
thf(c_0_9,plain,
( func
= ( ^ [Z0: $i,Z1: $i,Z2: $i] :
( ( subset @ Z2 @ ( cartprod @ Z0 @ Z1 ) )
& ! [X3: $i] :
( ( in @ X3 @ Z0 )
=> ? [X16: $i] :
( ( in @ X16
@ ( dsetconstr @ Z1
@ ^ [Z3: $i] : ( in @ ( kpair @ X3 @ Z3 ) @ Z2 ) ) )
& ( ( dsetconstr @ Z1
@ ^ [Z3: $i] : ( in @ ( kpair @ X3 @ Z3 ) @ Z2 ) )
= ( setadjoin @ X16 @ emptyset ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[func]) ).
thf(c_0_10,plain,
( ex1
= ( ^ [Z0: $i,Z1: $i > $o] :
? [X15: $i] :
( ( in @ X15
@ ( dsetconstr @ Z0
@ ^ [Z2: $i] : ( Z1 @ Z2 ) ) )
& ( ( dsetconstr @ Z0
@ ^ [Z2: $i] : ( Z1 @ Z2 ) )
= ( setadjoin @ X15 @ emptyset ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_11,plain,
( breln
= ( ^ [Z0: $i,Z1: $i,Z2: $i] : ( subset @ Z2 @ ( cartprod @ Z0 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[breln]) ).
thf(c_0_12,negated_conjecture,
~ ( dsetconstrER
=> ! [X1: $i,X5: $i,X8: $i] :
( ( in @ X8 @ ( funcSet @ X1 @ X5 ) )
=> ( func @ X1 @ X5 @ X8 ) ) ),
inference(assume_negation,[status(cth)],[infuncsetfunc]) ).
thf(c_0_13,plain,
( dsetconstrER
<=> ! [X1: $i,X2: $i > $o,X3: $i] :
( ( in @ X3
@ ( dsetconstr @ X1
@ ^ [Z0: $i] : ( X2 @ Z0 ) ) )
=> ( X2 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[dsetconstrER]) ).
thf(c_0_14,plain,
( func
= ( ^ [Z0: $i,Z1: $i,Z2: $i] :
( ( subset @ Z2 @ ( cartprod @ Z0 @ Z1 ) )
& ! [X3: $i] :
( ( in @ X3 @ Z0 )
=> ? [X16: $i] :
( ( in @ X16
@ ( dsetconstr @ Z1
@ ^ [Z3: $i] : ( in @ ( kpair @ X3 @ Z3 ) @ Z2 ) ) )
& ( ( dsetconstr @ Z1
@ ^ [Z3: $i] : ( in @ ( kpair @ X3 @ Z3 ) @ Z2 ) )
= ( setadjoin @ X16 @ emptyset ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
thf(c_0_15,negated_conjecture,
~ ( ! [X19: $i,X20: $i > $o,X21: $i] :
( ( in @ X21 @ ( dsetconstr @ X19 @ X20 ) )
=> ( X20 @ X21 ) )
=> ! [X1: $i,X5: $i,X8: $i] :
( ( in @ X8 @ ( funcSet @ X1 @ X5 ) )
=> ( ( subset @ X8 @ ( cartprod @ X1 @ X5 ) )
& ! [X22: $i] :
( ( in @ X22 @ X1 )
=> ? [X23: $i] :
( ( in @ X23
@ ( dsetconstr @ X5
@ ^ [Z0: $i] : ( in @ ( kpair @ X22 @ Z0 ) @ X8 ) ) )
& ( ( dsetconstr @ X5
@ ^ [Z0: $i] : ( in @ ( kpair @ X22 @ Z0 ) @ X8 ) )
= ( setadjoin @ X23 @ emptyset ) ) ) ) ) ) ),
inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
thf(c_0_16,plain,
( funcSet
= ( ^ [Z0: $i,Z1: $i] :
( dsetconstr @ ( powerset @ ( cartprod @ Z0 @ Z1 ) )
@ ^ [Z2: $i] :
( ( subset @ Z2 @ ( cartprod @ Z0 @ Z1 ) )
& ! [X17: $i] :
( ( in @ X17 @ Z0 )
=> ? [X18: $i] :
( ( in @ X18
@ ( dsetconstr @ Z1
@ ^ [Z3: $i] : ( in @ ( kpair @ X17 @ Z3 ) @ Z2 ) ) )
& ( ( dsetconstr @ Z1
@ ^ [Z3: $i] : ( in @ ( kpair @ X17 @ Z3 ) @ Z2 ) )
= ( setadjoin @ X18 @ emptyset ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[funcSet]),c_0_14]) ).
thf(c_0_17,negated_conjecture,
! [X24: $i,X25: $i > $o,X26: $i,X31: $i] :
( ( ~ ( in @ X26 @ ( dsetconstr @ X24 @ X25 ) )
| ( X25 @ X26 ) )
& ( in @ esk3_0 @ ( funcSet @ esk1_0 @ esk2_0 ) )
& ( ( in @ esk4_0 @ esk1_0 )
| ~ ( subset @ esk3_0 @ ( cartprod @ esk1_0 @ esk2_0 ) ) )
& ( ~ ( in @ X31
@ ( dsetconstr @ esk2_0
@ ^ [Z0: $i] : ( in @ ( kpair @ esk4_0 @ Z0 ) @ esk3_0 ) ) )
| ( ( dsetconstr @ esk2_0
@ ^ [Z0: $i] : ( in @ ( kpair @ esk4_0 @ Z0 ) @ esk3_0 ) )
!= ( setadjoin @ X31 @ emptyset ) )
| ~ ( subset @ esk3_0 @ ( cartprod @ esk1_0 @ esk2_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_15])])])])])]) ).
thf(c_0_18,plain,
( funcSet
= ( ^ [Z0: $i,Z1: $i] :
( dsetconstr @ ( powerset @ ( cartprod @ Z0 @ Z1 ) )
@ ^ [Z2: $i] :
( ( subset @ Z2 @ ( cartprod @ Z0 @ Z1 ) )
& ! [X42: $i] :
( ( in @ X42 @ Z0 )
=> ? [X43: $i] :
( ( in @ X43
@ ( dsetconstr @ Z1
@ ^ [Z3: $i] : ( in @ ( kpair @ X42 @ Z3 ) @ Z2 ) ) )
& ( ( dsetconstr @ Z1
@ ^ [Z3: $i] : ( in @ ( kpair @ X42 @ Z3 ) @ Z2 ) )
= ( setadjoin @ X43 @ emptyset ) ) ) ) ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_19,negated_conjecture,
! [X1: $i,X3: $i,X2: $i > $o] :
( ( X2 @ X1 )
| ~ ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_20,plain,
! [X1: $i,X3: $i] :
( ( dsetconstr @ ( powerset @ ( cartprod @ X1 @ X3 ) )
@ ^ [Z0: $i] :
( ( subset @ Z0 @ ( cartprod @ X1 @ X3 ) )
& ! [X44: $i] :
( ( in @ X44 @ X1 )
=> ? [X45: $i] :
( ( in @ X45
@ ( dsetconstr @ X3
@ ^ [Z1: $i] : ( in @ ( kpair @ X44 @ Z1 ) @ Z0 ) ) )
& ( ( dsetconstr @ X3
@ ^ [Z1: $i] : ( in @ ( kpair @ X44 @ Z1 ) @ Z0 ) )
= ( setadjoin @ X45 @ emptyset ) ) ) ) ) )
= ( funcSet @ X1 @ X3 ) ),
inference(arg_cong,[status(thm)],[c_0_18]) ).
thf(c_0_21,negated_conjecture,
! [X1: $i,X3: $i,X4: $i] :
( ( ( subset @ X1 @ ( cartprod @ X3 @ X4 ) )
& ! [X46: $i] :
( ( in @ X46 @ X3 )
=> ? [X47: $i] :
( ( in @ X47
@ ( dsetconstr @ X4
@ ^ [Z0: $i] : ( in @ ( kpair @ X46 @ Z0 ) @ X1 ) ) )
& ( ( dsetconstr @ X4
@ ^ [Z0: $i] : ( in @ ( kpair @ X46 @ Z0 ) @ X1 ) )
= ( setadjoin @ X47 @ emptyset ) ) ) ) )
| ~ ( in @ X1 @ ( funcSet @ X3 @ X4 ) ) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_22,negated_conjecture,
! [X1: $i] :
( ~ ( in @ X1
@ ( dsetconstr @ esk2_0
@ ^ [Z0: $i] : ( in @ ( kpair @ esk4_0 @ Z0 ) @ esk3_0 ) ) )
| ( ( dsetconstr @ esk2_0
@ ^ [Z0: $i] : ( in @ ( kpair @ esk4_0 @ Z0 ) @ esk3_0 ) )
!= ( setadjoin @ X1 @ emptyset ) )
| ~ ( subset @ esk3_0 @ ( cartprod @ esk1_0 @ esk2_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_23,negated_conjecture,
! [X1: $i,X5: $i,X4: $i,X3: $i] :
( ( in @ ( esk5_4 @ X1 @ X3 @ X4 @ X5 )
@ ( dsetconstr @ X4
@ ^ [Z0: $i] : ( in @ ( kpair @ X5 @ Z0 ) @ X1 ) ) )
| ~ ( in @ X1 @ ( funcSet @ X3 @ X4 ) )
| ~ ( in @ X5 @ X3 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_21]) ).
thf(c_0_24,negated_conjecture,
! [X1: $i,X3: $i,X4: $i,X5: $i] :
( ( ( dsetconstr @ X1
@ ^ [Z0: $i] : ( in @ ( kpair @ X3 @ Z0 ) @ X4 ) )
= ( setadjoin @ ( esk5_4 @ X4 @ X5 @ X1 @ X3 ) @ emptyset ) )
| ~ ( in @ X4 @ ( funcSet @ X5 @ X1 ) )
| ~ ( in @ X3 @ X5 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_21]) ).
thf(c_0_25,negated_conjecture,
! [X1: $i] :
( ~ ( subset @ esk3_0 @ ( cartprod @ esk1_0 @ esk2_0 ) )
| ~ ( in @ esk3_0 @ ( funcSet @ X1 @ esk2_0 ) )
| ~ ( in @ esk4_0 @ X1 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
thf(c_0_26,negated_conjecture,
! [X1: $i,X3: $i,X4: $i] :
( ( subset @ X1 @ ( cartprod @ X3 @ X4 ) )
| ~ ( in @ X1 @ ( funcSet @ X3 @ X4 ) ) ),
inference(dynamic_cnf,[status(thm)],[c_0_21]) ).
thf(c_0_27,negated_conjecture,
in @ esk3_0 @ ( funcSet @ esk1_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_28,negated_conjecture,
( ( in @ esk4_0 @ esk1_0 )
| ~ ( subset @ esk3_0 @ ( cartprod @ esk1_0 @ esk2_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_29,negated_conjecture,
! [X1: $i] :
( ~ ( in @ esk3_0 @ ( funcSet @ X1 @ esk2_0 ) )
| ~ ( in @ esk4_0 @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
thf(c_0_30,negated_conjecture,
in @ esk4_0 @ esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_26]),c_0_27])]) ).
thf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_27]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU675^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n019.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 14:07:32 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.24 Running higher-order theorem proving
% 0.08/0.26 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.8s0okEC3L1/E---3.1_826622.p
% 0.23/0.28 % Version: 3.5.1-ho
% 0.23/0.28 % partial match(1): HSSSSMSSSLMNSFA
% 0.23/0.28 % Preprocessing class: HSSSSMSSSLMNHFA.
% 0.23/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.28 % Starting new_ho_10 with 1500s (5) cores
% 0.23/0.28 % Starting ho_unfolding_6 with 300s (1) cores
% 0.23/0.28 % Starting sh4l with 300s (1) cores
% 0.23/0.28 % Starting lpo8_s with 300s (1) cores
% 0.23/0.28 % ho_unfolding_6 with pid 826636 completed with status 0
% 0.23/0.28 % Result found by ho_unfolding_6
% 0.23/0.28 % partial match(1): HSSSSMSSSLMNSFA
% 0.23/0.28 % Preprocessing class: HSSSSMSSSLMNHFA.
% 0.23/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.28 % Starting new_ho_10 with 1500s (5) cores
% 0.23/0.28 % Starting ho_unfolding_6 with 300s (1) cores
% 0.23/0.28 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.28 % No SInE strategy applied
% 0.23/0.28 % Search class: HHHSF-FFSF21-DHFFMSBN
% 0.23/0.28 % partial match(4): HGHSF-FFSF21-SHHFMMBN
% 0.23/0.28 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.28 % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.28 % SubtermCWHack with pid 826639 completed with status 0
% 0.23/0.28 % Result found by SubtermCWHack
% 0.23/0.28 % partial match(1): HSSSSMSSSLMNSFA
% 0.23/0.28 % Preprocessing class: HSSSSMSSSLMNHFA.
% 0.23/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.28 % Starting new_ho_10 with 1500s (5) cores
% 0.23/0.28 % Starting ho_unfolding_6 with 300s (1) cores
% 0.23/0.28 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.28 % No SInE strategy applied
% 0.23/0.28 % Search class: HHHSF-FFSF21-DHFFMSBN
% 0.23/0.28 % partial match(4): HGHSF-FFSF21-SHHFMMBN
% 0.23/0.28 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.28 % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.28 % Preprocessing time : 0.001 s
% 0.23/0.28
% 0.23/0.28 % Proof found!
% 0.23/0.28 % SZS status Theorem
% 0.23/0.28 % SZS output start CNFRefutation
% See solution above
% 0.23/0.28 % Parsed axioms : 21
% 0.23/0.28 % Removed by relevancy pruning/SinE : 0
% 0.23/0.28 % Initial clauses : 19
% 0.23/0.28 % Removed in clause preprocessing : 14
% 0.23/0.28 % Initial clauses in saturation : 5
% 0.23/0.28 % Processed clauses : 20
% 0.23/0.28 % ...of these trivial : 1
% 0.23/0.28 % ...subsumed : 1
% 0.23/0.28 % ...remaining for further processing : 18
% 0.23/0.28 % Other redundant clauses eliminated : 0
% 0.23/0.28 % Clauses deleted for lack of memory : 0
% 0.23/0.28 % Backward-subsumed : 1
% 0.23/0.28 % Backward-rewritten : 1
% 0.23/0.28 % Generated clauses : 25
% 0.23/0.28 % ...of the previous two non-redundant : 24
% 0.23/0.28 % ...aggressively subsumed : 0
% 0.23/0.28 % Contextual simplify-reflections : 1
% 0.23/0.28 % Paramodulations : 19
% 0.23/0.28 % Factorizations : 0
% 0.23/0.28 % NegExts : 0
% 0.23/0.28 % Equation resolutions : 0
% 0.23/0.28 % Disequality decompositions : 0
% 0.23/0.28 % Total rewrite steps : 5
% 0.23/0.28 % ...of those cached : 2
% 0.23/0.28 % Propositional unsat checks : 0
% 0.23/0.28 % Propositional check models : 0
% 0.23/0.28 % Propositional check unsatisfiable : 0
% 0.23/0.28 % Propositional clauses : 0
% 0.23/0.28 % Propositional clauses after purity: 0
% 0.23/0.28 % Propositional unsat core size : 0
% 0.23/0.28 % Propositional preprocessing time : 0.000
% 0.23/0.28 % Propositional encoding time : 0.000
% 0.23/0.28 % Propositional solver time : 0.000
% 0.23/0.28 % Success case prop preproc time : 0.000
% 0.23/0.28 % Success case prop encoding time : 0.000
% 0.23/0.28 % Success case prop solver time : 0.000
% 0.23/0.28 % Current number of processed clauses : 15
% 0.23/0.28 % Positive orientable unit clauses : 5
% 0.23/0.28 % Positive unorientable unit clauses: 0
% 0.23/0.28 % Negative unit clauses : 0
% 0.23/0.28 % Non-unit-clauses : 10
% 0.23/0.28 % Current number of unprocessed clauses: 9
% 0.23/0.28 % ...number of literals in the above : 43
% 0.23/0.28 % Current number of archived formulas : 0
% 0.23/0.28 % Current number of archived clauses : 3
% 0.23/0.28 % Clause-clause subsumption calls (NU) : 25
% 0.23/0.28 % Rec. Clause-clause subsumption calls : 17
% 0.23/0.28 % Non-unit clause-clause subsumptions : 3
% 0.23/0.28 % Unit Clause-clause subsumption calls : 0
% 0.23/0.28 % Rewrite failures with RHS unbound : 0
% 0.23/0.28 % BW rewrite match attempts : 2
% 0.23/0.28 % BW rewrite match successes : 1
% 0.23/0.28 % Condensation attempts : 0
% 0.23/0.28 % Condensation successes : 0
% 0.23/0.28 % Termbank termtop insertions : 2531
% 0.23/0.28 % Search garbage collected termcells : 354
% 0.23/0.28
% 0.23/0.28 % -------------------------------------------------
% 0.23/0.28 % User time : 0.007 s
% 0.23/0.28 % System time : 0.002 s
% 0.23/0.28 % Total time : 0.009 s
% 0.23/0.28 % Maximum resident set size: 3592 pages
% 0.23/0.28
% 0.23/0.28 % -------------------------------------------------
% 0.23/0.28 % User time : 0.008 s
% 0.23/0.28 % System time : 0.007 s
% 0.23/0.28 % Total time : 0.015 s
% 0.23/0.28 % Maximum resident set size: 4608 pages
% 0.23/0.28 % E exiting
%------------------------------------------------------------------------------