%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU632^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 : n009.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:48 AM UTC 2026
% Result : Theorem 0.26s 0.26s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 12 unt; 0 typ; 0 def)
% Number of atoms : 80 ( 21 equ; 0 cnn)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 560 ( 18 ~; 12 |; 23 &; 493 @)
% ( 2 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 16 usr; 7 con; 0-3 aty)
% Number of variables : 74 ( 6 ^; 52 !; 16 ?; 74 :)
% 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,
setunion: $i > $i ).
thf(decl_27,type,
iskpair: $i > $o ).
thf(decl_28,type,
kpair: $i > $i > $i ).
thf(decl_29,type,
kpairp: $o ).
thf(decl_30,type,
cartprod: $i > $i > $i ).
thf(decl_31,type,
cartprodmempair1: $o ).
thf(decl_32,type,
esk1_2: $i > $i > $i ).
thf(decl_33,type,
esk2_2: $i > $i > $i ).
thf(decl_34,type,
esk3_3: $i > $i > $i > $i ).
thf(decl_35,type,
esk4_3: $i > $i > $i > $i ).
thf(decl_36,type,
esk5_0: $i ).
thf(decl_37,type,
esk6_0: $i ).
thf(decl_38,type,
esk7_0: $i ).
thf(kpair,axiom,
( kpair
= ( ^ [X2: $i,X3: $i] : ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.4rofHGBH1A/E---3.1_4045241.p',kpair) ).
thf(iskpair,axiom,
( iskpair
= ( ^ [X1: $i] :
? [X2: $i] :
( ( in @ X2 @ ( setunion @ X1 ) )
& ? [X3: $i] :
( ( in @ X3 @ ( setunion @ X1 ) )
& ( X1
= ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.4rofHGBH1A/E---3.1_4045241.p',iskpair) ).
thf(cartprodmempair,conjecture,
( kpairp
=> ( cartprodmempair1
=> ! [X1: $i,X4: $i,X5: $i] :
( ( in @ X5 @ ( cartprod @ X1 @ X4 ) )
=> ( iskpair @ X5 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.4rofHGBH1A/E---3.1_4045241.p',cartprodmempair) ).
thf(cartprodmempair1,axiom,
( cartprodmempair1
<=> ! [X1: $i,X4: $i,X5: $i] :
( ( in @ X5 @ ( cartprod @ X1 @ X4 ) )
=> ? [X2: $i] :
( ( in @ X2 @ X1 )
& ? [X3: $i] :
( ( in @ X3 @ X4 )
& ( X5
= ( kpair @ X2 @ X3 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.4rofHGBH1A/E---3.1_4045241.p',cartprodmempair1) ).
thf(kpairp,axiom,
( kpairp
<=> ! [X2: $i,X3: $i] : ( iskpair @ ( kpair @ X2 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.4rofHGBH1A/E---3.1_4045241.p',kpairp) ).
thf(c_0_5,plain,
( kpair
= ( ^ [Z0: $i,Z1: $i] : ( setadjoin @ ( setadjoin @ Z0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Z0 @ ( setadjoin @ Z1 @ emptyset ) ) @ emptyset ) ) ) ),
inference(fof_simplification,[status(thm)],[kpair]) ).
thf(c_0_6,plain,
( iskpair
= ( ^ [Z0: $i] :
? [X2: $i] :
( ( in @ X2 @ ( setunion @ Z0 ) )
& ? [X3: $i] :
( ( in @ X3 @ ( setunion @ Z0 ) )
& ( Z0
= ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[iskpair]) ).
thf(c_0_7,negated_conjecture,
~ ( kpairp
=> ( cartprodmempair1
=> ! [X1: $i,X4: $i,X5: $i] :
( ( in @ X5 @ ( cartprod @ X1 @ X4 ) )
=> ( iskpair @ X5 ) ) ) ),
inference(assume_negation,[status(cth)],[cartprodmempair]) ).
thf(c_0_8,axiom,
( cartprodmempair1
= ( ! [X1: $i,X4: $i,X5: $i] :
( ( in @ X5 @ ( cartprod @ X1 @ X4 ) )
=> ? [X2: $i] :
( ( in @ X2 @ X1 )
& ? [X3: $i] :
( ( in @ X3 @ X4 )
& ( X5
= ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[cartprodmempair1,c_0_5]) ).
thf(c_0_9,axiom,
( kpairp
= ( ! [X2: $i,X3: $i] :
? [X16: $i] :
( ( in @ X16 @ ( setunion @ ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) ) ) )
& ? [X17: $i] :
( ( in @ X17 @ ( setunion @ ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) ) ) )
& ( ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ X16 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X16 @ ( setadjoin @ X17 @ emptyset ) ) @ emptyset ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[kpairp,c_0_5]),c_0_6]) ).
thf(c_0_10,negated_conjecture,
~ ( ! [X18: $i,X19: $i] :
? [X20: $i] :
( ( in @ X20 @ ( setunion @ ( setadjoin @ ( setadjoin @ X18 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X18 @ ( setadjoin @ X19 @ emptyset ) ) @ emptyset ) ) ) )
& ? [X21: $i] :
( ( in @ X21 @ ( setunion @ ( setadjoin @ ( setadjoin @ X18 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X18 @ ( setadjoin @ X19 @ emptyset ) ) @ emptyset ) ) ) )
& ( ( setadjoin @ ( setadjoin @ X18 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X18 @ ( setadjoin @ X19 @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ X20 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X20 @ ( setadjoin @ X21 @ emptyset ) ) @ emptyset ) ) ) ) )
=> ( ! [X22: $i,X23: $i,X24: $i] :
( ( in @ X24 @ ( cartprod @ X22 @ X23 ) )
=> ? [X25: $i] :
( ( in @ X25 @ X22 )
& ? [X26: $i] :
( ( in @ X26 @ X23 )
& ( X24
= ( setadjoin @ ( setadjoin @ X25 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X25 @ ( setadjoin @ X26 @ emptyset ) ) @ emptyset ) ) ) ) ) )
=> ! [X1: $i,X4: $i,X5: $i] :
( ( in @ X5 @ ( cartprod @ X1 @ X4 ) )
=> ? [X27: $i] :
( ( in @ X27 @ ( setunion @ X5 ) )
& ? [X28: $i] :
( ( in @ X28 @ ( setunion @ X5 ) )
& ( X5
= ( setadjoin @ ( setadjoin @ X27 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X27 @ ( setadjoin @ X28 @ emptyset ) ) @ emptyset ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_6]) ).
thf(c_0_11,negated_conjecture,
! [X29: $i,X30: $i,X33: $i,X34: $i,X35: $i,X41: $i,X42: $i] :
( ( in @ ( esk1_2 @ X29 @ X30 ) @ ( setunion @ ( setadjoin @ ( setadjoin @ X29 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X29 @ ( setadjoin @ X30 @ emptyset ) ) @ emptyset ) ) ) )
& ( in @ ( esk2_2 @ X29 @ X30 ) @ ( setunion @ ( setadjoin @ ( setadjoin @ X29 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X29 @ ( setadjoin @ X30 @ emptyset ) ) @ emptyset ) ) ) )
& ( ( setadjoin @ ( setadjoin @ X29 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X29 @ ( setadjoin @ X30 @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ ( esk1_2 @ X29 @ X30 ) @ emptyset ) @ ( setadjoin @ ( setadjoin @ ( esk1_2 @ X29 @ X30 ) @ ( setadjoin @ ( esk2_2 @ X29 @ X30 ) @ emptyset ) ) @ emptyset ) ) )
& ( ( in @ ( esk3_3 @ X33 @ X34 @ X35 ) @ X33 )
| ~ ( in @ X35 @ ( cartprod @ X33 @ X34 ) ) )
& ( ( in @ ( esk4_3 @ X33 @ X34 @ X35 ) @ X34 )
| ~ ( in @ X35 @ ( cartprod @ X33 @ X34 ) ) )
& ( ( X35
= ( setadjoin @ ( setadjoin @ ( esk3_3 @ X33 @ X34 @ X35 ) @ emptyset ) @ ( setadjoin @ ( setadjoin @ ( esk3_3 @ X33 @ X34 @ X35 ) @ ( setadjoin @ ( esk4_3 @ X33 @ X34 @ X35 ) @ emptyset ) ) @ emptyset ) ) )
| ~ ( in @ X35 @ ( cartprod @ X33 @ X34 ) ) )
& ( in @ esk7_0 @ ( cartprod @ esk5_0 @ esk6_0 ) )
& ( ~ ( in @ X41 @ ( setunion @ esk7_0 ) )
| ~ ( in @ X42 @ ( setunion @ esk7_0 ) )
| ( esk7_0
!= ( setadjoin @ ( setadjoin @ X41 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X41 @ ( setadjoin @ X42 @ emptyset ) ) @ emptyset ) ) ) ) ),
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_10])])])])])]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i,X2: $i] :
( ~ ( in @ X1 @ ( setunion @ esk7_0 ) )
| ~ ( in @ X2 @ ( setunion @ esk7_0 ) )
| ( esk7_0
!= ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i,X2: $i] :
( ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) )
= ( setadjoin @ ( setadjoin @ ( esk1_2 @ X1 @ X2 ) @ emptyset ) @ ( setadjoin @ ( setadjoin @ ( esk1_2 @ X1 @ X2 ) @ ( setadjoin @ ( esk2_2 @ X1 @ X2 ) @ emptyset ) ) @ emptyset ) ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i,X2: $i] : ( in @ ( esk1_2 @ X1 @ X2 ) @ ( setunion @ ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( X1
= ( setadjoin @ ( setadjoin @ ( esk3_3 @ X2 @ X3 @ X1 ) @ emptyset ) @ ( setadjoin @ ( setadjoin @ ( esk3_3 @ X2 @ X3 @ X1 ) @ ( setadjoin @ ( esk4_3 @ X2 @ X3 @ X1 ) @ emptyset ) ) @ emptyset ) ) )
| ~ ( in @ X1 @ ( cartprod @ X2 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i,X2: $i] : ( in @ ( esk2_2 @ X1 @ X2 ) @ ( setunion @ ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i,X2: $i] :
( ( ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) )
!= esk7_0 )
| ~ ( in @ ( esk2_2 @ X1 @ X2 ) @ ( setunion @ esk7_0 ) )
| ~ ( in @ ( esk1_2 @ X1 @ X2 ) @ ( setunion @ esk7_0 ) ) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_18,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( in @ ( esk1_2 @ ( esk3_3 @ X1 @ X2 @ X3 ) @ ( esk4_3 @ X1 @ X2 @ X3 ) ) @ ( setunion @ X3 ) )
| ~ ( in @ X3 @ ( cartprod @ X1 @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_19,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( in @ ( esk2_2 @ ( esk3_3 @ X1 @ X2 @ X3 ) @ ( esk4_3 @ X1 @ X2 @ X3 ) ) @ ( setunion @ X3 ) )
| ~ ( in @ X3 @ ( cartprod @ X1 @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
thf(c_0_20,negated_conjecture,
in @ esk7_0 @ ( cartprod @ esk5_0 @ esk6_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_21,negated_conjecture,
! [X1: $i,X2: $i] :
~ ( in @ esk7_0 @ ( cartprod @ X1 @ X2 ) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_15])]),c_0_18]),c_0_19]) ).
thf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_20,c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU632^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.18 % Computer : n009.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 14:00:15 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.23 Running higher-order theorem proving
% 0.07/0.24 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.4rofHGBH1A/E---3.1_4045241.p
% 0.07/0.26 % Version: 3.5.1-ho
% 0.07/0.26 % Preprocessing class: HSSSSLSSSLSNSFN.
% 0.07/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.26 % Starting new_ho_10 with 1500s (5) cores
% 0.07/0.26 % Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.07/0.26 % Starting lpo1_def_fix with 300s (1) cores
% 0.07/0.26 % Starting ehoh_best8_lambda with 300s (1) cores
% 0.07/0.26 % ehoh_best_sine_rwall with pid 4045255 completed with status 0
% 0.07/0.26 % Result found by ehoh_best_sine_rwall
% 0.07/0.26 % Preprocessing class: HSSSSLSSSLSNSFN.
% 0.07/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.26 % Starting new_ho_10 with 1500s (5) cores
% 0.07/0.26 % Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.07/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.07/0.26 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.07/0.26 % Search class: HHHSS-FFSF32-MSFFMFNN
% 0.07/0.26 % partial match(3): HHUSS-FFSF21-MSFFMFNN
% 0.07/0.26 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.26 % Starting SubtermCWHack with 31s (1) cores
% 0.07/0.26 % SubtermCWHack with pid 4045259 completed with status 0
% 0.07/0.26 % Result found by SubtermCWHack
% 0.26/0.26 % Preprocessing class: HSSSSLSSSLSNSFN.
% 0.26/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.26 % Starting new_ho_10 with 1500s (5) cores
% 0.26/0.26 % Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.26/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.26/0.26 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.26/0.26 % Search class: HHHSS-FFSF32-MSFFMFNN
% 0.26/0.26 % partial match(3): HHUSS-FFSF21-MSFFMFNN
% 0.26/0.26 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.26 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.26 % Preprocessing time : 0.001 s
% 0.26/0.26
% 0.26/0.26 % Proof found!
% 0.26/0.26 % SZS status Theorem
% 0.26/0.26 % SZS output start CNFRefutation
% See solution above
% 0.26/0.26 % Parsed axioms : 14
% 0.26/0.26 % Removed by relevancy pruning/SinE : 9
% 0.26/0.26 % Initial clauses : 8
% 0.26/0.26 % Removed in clause preprocessing : 0
% 0.26/0.26 % Initial clauses in saturation : 8
% 0.26/0.26 % Processed clauses : 21
% 0.26/0.26 % ...of these trivial : 0
% 0.26/0.26 % ...subsumed : 0
% 0.26/0.26 % ...remaining for further processing : 21
% 0.26/0.26 % Other redundant clauses eliminated : 2
% 0.26/0.26 % Clauses deleted for lack of memory : 0
% 0.26/0.26 % Backward-subsumed : 3
% 0.26/0.26 % Backward-rewritten : 0
% 0.26/0.26 % Generated clauses : 37
% 0.26/0.26 % ...of the previous two non-redundant : 34
% 0.26/0.26 % ...aggressively subsumed : 0
% 0.26/0.26 % Contextual simplify-reflections : 2
% 0.26/0.26 % Paramodulations : 34
% 0.26/0.26 % Factorizations : 0
% 0.26/0.26 % NegExts : 0
% 0.26/0.26 % Equation resolutions : 2
% 0.26/0.26 % Disequality decompositions : 0
% 0.26/0.26 % Total rewrite steps : 0
% 0.26/0.26 % ...of those cached : 0
% 0.26/0.26 % Propositional unsat checks : 0
% 0.26/0.26 % Propositional check models : 0
% 0.26/0.26 % Propositional check unsatisfiable : 0
% 0.26/0.26 % Propositional clauses : 0
% 0.26/0.26 % Propositional clauses after purity: 0
% 0.26/0.26 % Propositional unsat core size : 0
% 0.26/0.26 % Propositional preprocessing time : 0.000
% 0.26/0.26 % Propositional encoding time : 0.000
% 0.26/0.26 % Propositional solver time : 0.000
% 0.26/0.26 % Success case prop preproc time : 0.000
% 0.26/0.26 % Success case prop encoding time : 0.000
% 0.26/0.26 % Success case prop solver time : 0.000
% 0.26/0.26 % Current number of processed clauses : 17
% 0.26/0.26 % Positive orientable unit clauses : 7
% 0.26/0.26 % Positive unorientable unit clauses: 0
% 0.26/0.26 % Negative unit clauses : 1
% 0.26/0.26 % Non-unit-clauses : 9
% 0.26/0.26 % Current number of unprocessed clauses: 21
% 0.26/0.26 % ...number of literals in the above : 41
% 0.26/0.26 % Current number of archived formulas : 0
% 0.26/0.26 % Current number of archived clauses : 4
% 0.26/0.26 % Clause-clause subsumption calls (NU) : 24
% 0.26/0.26 % Rec. Clause-clause subsumption calls : 22
% 0.26/0.26 % Non-unit clause-clause subsumptions : 2
% 0.26/0.26 % Unit Clause-clause subsumption calls : 5
% 0.26/0.26 % Rewrite failures with RHS unbound : 0
% 0.26/0.26 % BW rewrite match attempts : 2
% 0.26/0.26 % BW rewrite match successes : 0
% 0.26/0.26 % Condensation attempts : 0
% 0.26/0.26 % Condensation successes : 0
% 0.26/0.26 % Termbank termtop insertions : 2474
% 0.26/0.26 % Search garbage collected termcells : 322
% 0.26/0.26
% 0.26/0.26 % -------------------------------------------------
% 0.26/0.26 % User time : 0.003 s
% 0.26/0.26 % System time : 0.005 s
% 0.26/0.26 % Total time : 0.008 s
% 0.26/0.26 % Maximum resident set size: 3636 pages
% 0.26/0.26
% 0.26/0.26 % -------------------------------------------------
% 0.26/0.26 % User time : 0.005 s
% 0.26/0.26 % System time : 0.010 s
% 0.26/0.26 % Total time : 0.015 s
% 0.26/0.26 % Maximum resident set size: 4864 pages
% 0.26/0.26 % E exiting
%------------------------------------------------------------------------------