TSTP Solution File: SEU468^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU468^1 : TPTP v8.2.0. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 03:27:31 EDT 2024
% Result : Theorem 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 19
% Syntax : Number of formulae : 47 ( 15 unt; 14 typ; 0 def)
% Number of atoms : 84 ( 10 equ; 0 cnn)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 410 ( 23 ~; 36 |; 20 &; 304 @)
% ( 0 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 114 ( 114 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 3 con; 0-3 aty)
% Number of variables : 96 ( 18 ^ 78 !; 0 ?; 96 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
subrel: ( $i > $i > $o ) > ( $i > $i > $o ) > $o ).
thf(decl_26,type,
mono: ( ( $i > $i > $o ) > $i > $i > $o ) > $o ).
thf(decl_34,type,
trans: ( $i > $i > $o ) > $o ).
thf(decl_35,type,
tc: ( $i > $i > $o ) > $i > $i > $o ).
thf(decl_51,type,
epred1_0: $i > $i > $o ).
thf(decl_52,type,
epred2_0: $i > $i > $o ).
thf(decl_53,type,
esk1_0: $i ).
thf(decl_54,type,
esk2_0: $i ).
thf(decl_55,type,
esk3_1: ( $i > $i > $o ) > $i ).
thf(decl_56,type,
esk4_1: ( $i > $i > $o ) > $i ).
thf(decl_57,type,
esk5_1: ( $i > $i > $o ) > $i ).
thf(decl_58,type,
esk6_1: ( $i > $i > $o ) > $i ).
thf(decl_59,type,
esk7_1: ( $i > $i > $o ) > $i ).
thf(decl_60,type,
epred3_0: $i > $i > $o ).
thf(transitive_closure,axiom,
( tc
= ( ^ [X1: $i > $i > $o,X3: $i,X4: $i] :
! [X2: $i > $i > $o] :
( ( ( trans @ X2 )
& ( subrel @ X1 @ X2 ) )
=> ( X2 @ X3 @ X4 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET009^0.ax',transitive_closure) ).
thf(transitive,axiom,
( trans
= ( ^ [X1: $i > $i > $o] :
! [X3: $i,X4: $i,X6: $i] :
( ( ( X1 @ X3 @ X4 )
& ( X1 @ X4 @ X6 ) )
=> ( X1 @ X3 @ X6 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET009^0.ax',transitive) ).
thf(subrel,axiom,
( subrel
= ( ^ [X1: $i > $i > $o,X2: $i > $i > $o] :
! [X3: $i,X4: $i] :
( ( X1 @ X3 @ X4 )
=> ( X2 @ X3 @ X4 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET009^0.ax',subrel) ).
thf(monotonic,axiom,
( mono
= ( ^ [X5: ( $i > $i > $o ) > $i > $i > $o] :
! [X1: $i > $i > $o,X2: $i > $i > $o] :
( ( subrel @ X1 @ X2 )
=> ( subrel @ ( X5 @ X1 ) @ ( X5 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET009^0.ax',monotonic) ).
thf(transitive_closure_op_is_monotonic,conjecture,
mono @ tc,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitive_closure_op_is_monotonic) ).
thf(c_0_5,plain,
( tc
= ( ^ [Z0: $i > $i > $o,Z1: $i,Z2: $i] :
! [X2: $i > $i > $o] :
( ( ! [X13: $i,X14: $i,X15: $i] :
( ( ( X2 @ X13 @ X14 )
& ( X2 @ X14 @ X15 ) )
=> ( X2 @ X13 @ X15 ) )
& ! [X16: $i,X17: $i] :
( ( Z0 @ X16 @ X17 )
=> ( X2 @ X16 @ X17 ) ) )
=> ( X2 @ Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[transitive_closure]) ).
thf(c_0_6,plain,
( trans
= ( ^ [Z0: $i > $i > $o] :
! [X3: $i,X4: $i,X6: $i] :
( ( ( Z0 @ X3 @ X4 )
& ( Z0 @ X4 @ X6 ) )
=> ( Z0 @ X3 @ X6 ) ) ) ),
inference(fof_simplification,[status(thm)],[transitive]) ).
thf(c_0_7,plain,
( subrel
= ( ^ [Z0: $i > $i > $o,Z1: $i > $i > $o] :
! [X3: $i,X4: $i] :
( ( Z0 @ X3 @ X4 )
=> ( Z1 @ X3 @ X4 ) ) ) ),
inference(fof_simplification,[status(thm)],[subrel]) ).
thf(c_0_8,plain,
( mono
= ( ^ [Z0: ( $i > $i > $o ) > $i > $i > $o] :
! [X1: $i > $i > $o,X2: $i > $i > $o] :
( ! [X9: $i,X10: $i] :
( ( X1 @ X9 @ X10 )
=> ( X2 @ X9 @ X10 ) )
=> ! [X11: $i,X12: $i] :
( ( Z0 @ X1 @ X11 @ X12 )
=> ( Z0 @ X2 @ X11 @ X12 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[monotonic]) ).
thf(c_0_9,plain,
( tc
= ( ^ [Z0: $i > $i > $o,Z1: $i,Z2: $i] :
! [X2: $i > $i > $o] :
( ( ! [X13: $i,X14: $i,X15: $i] :
( ( ( X2 @ X13 @ X14 )
& ( X2 @ X14 @ X15 ) )
=> ( X2 @ X13 @ X15 ) )
& ! [X16: $i,X17: $i] :
( ( Z0 @ X16 @ X17 )
=> ( X2 @ X16 @ X17 ) ) )
=> ( X2 @ Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).
thf(c_0_10,plain,
( mono
= ( ^ [Z0: ( $i > $i > $o ) > $i > $i > $o] :
! [X1: $i > $i > $o,X2: $i > $i > $o] :
( ! [X9: $i,X10: $i] :
( ( X1 @ X9 @ X10 )
=> ( X2 @ X9 @ X10 ) )
=> ! [X11: $i,X12: $i] :
( ( Z0 @ X1 @ X11 @ X12 )
=> ( Z0 @ X2 @ X11 @ X12 ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_8,c_0_7]) ).
thf(c_0_11,negated_conjecture,
~ ! [X87: $i > $i > $o,X88: $i > $i > $o] :
( ! [X89: $i,X90: $i] :
( ( X87 @ X89 @ X90 )
=> ( X88 @ X89 @ X90 ) )
=> ! [X91: $i,X92: $i] :
( ! [X81: $i > $i > $o] :
( ( ! [X82: $i,X83: $i,X84: $i] :
( ( ( X81 @ X82 @ X83 )
& ( X81 @ X83 @ X84 ) )
=> ( X81 @ X82 @ X84 ) )
& ! [X85: $i,X86: $i] :
( ( X87 @ X85 @ X86 )
=> ( X81 @ X85 @ X86 ) ) )
=> ( X81 @ X91 @ X92 ) )
=> ! [X81: $i > $i > $o] :
( ( ! [X82: $i,X83: $i,X84: $i] :
( ( ( X81 @ X82 @ X83 )
& ( X81 @ X83 @ X84 ) )
=> ( X81 @ X82 @ X84 ) )
& ! [X85: $i,X86: $i] :
( ( X88 @ X85 @ X86 )
=> ( X81 @ X85 @ X86 ) ) )
=> ( X81 @ X91 @ X92 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[transitive_closure_op_is_monotonic]),c_0_9]),c_0_10]) ).
thf(c_0_12,negated_conjecture,
! [X95: $i,X96: $i,X99: $i > $i > $o,X106: $i,X107: $i,X108: $i,X109: $i,X110: $i] :
( ( ~ ( epred1_0 @ X95 @ X96 )
| ( epred2_0 @ X95 @ X96 ) )
& ( ( epred1_0 @ ( esk6_1 @ X99 ) @ ( esk7_1 @ X99 ) )
| ( X99 @ ( esk3_1 @ X99 ) @ ( esk4_1 @ X99 ) )
| ( X99 @ esk1_0 @ esk2_0 ) )
& ( ~ ( X99 @ ( esk6_1 @ X99 ) @ ( esk7_1 @ X99 ) )
| ( X99 @ ( esk3_1 @ X99 ) @ ( esk4_1 @ X99 ) )
| ( X99 @ esk1_0 @ esk2_0 ) )
& ( ( epred1_0 @ ( esk6_1 @ X99 ) @ ( esk7_1 @ X99 ) )
| ( X99 @ ( esk4_1 @ X99 ) @ ( esk5_1 @ X99 ) )
| ( X99 @ esk1_0 @ esk2_0 ) )
& ( ~ ( X99 @ ( esk6_1 @ X99 ) @ ( esk7_1 @ X99 ) )
| ( X99 @ ( esk4_1 @ X99 ) @ ( esk5_1 @ X99 ) )
| ( X99 @ esk1_0 @ esk2_0 ) )
& ( ( epred1_0 @ ( esk6_1 @ X99 ) @ ( esk7_1 @ X99 ) )
| ~ ( X99 @ ( esk3_1 @ X99 ) @ ( esk5_1 @ X99 ) )
| ( X99 @ esk1_0 @ esk2_0 ) )
& ( ~ ( X99 @ ( esk6_1 @ X99 ) @ ( esk7_1 @ X99 ) )
| ~ ( X99 @ ( esk3_1 @ X99 ) @ ( esk5_1 @ X99 ) )
| ( X99 @ esk1_0 @ esk2_0 ) )
& ( ~ ( epred3_0 @ X106 @ X107 )
| ~ ( epred3_0 @ X107 @ X108 )
| ( epred3_0 @ X106 @ X108 ) )
& ( ~ ( epred2_0 @ X109 @ X110 )
| ( epred3_0 @ X109 @ X110 ) )
& ~ ( epred3_0 @ 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_11])])])])])]) ).
thf(c_0_13,negated_conjecture,
! [X3: $i,X4: $i,X6: $i] :
( ( epred3_0 @ X3 @ X6 )
| ~ ( epred3_0 @ X3 @ X4 )
| ~ ( epred3_0 @ X4 @ X6 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i > $i > $o] :
( ( epred1_0 @ ( esk6_1 @ X1 ) @ ( esk7_1 @ X1 ) )
| ( X1 @ ( esk4_1 @ X1 ) @ ( esk5_1 @ X1 ) )
| ( X1 @ esk1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_15,negated_conjecture,
~ ( epred3_0 @ esk1_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_16,negated_conjecture,
! [X3: $i] :
( ( epred1_0 @ ( esk6_1 @ epred3_0 ) @ ( esk7_1 @ epred3_0 ) )
| ( epred3_0 @ X3 @ ( esk5_1 @ epred3_0 ) )
| ~ ( epred3_0 @ X3 @ ( esk4_1 @ epred3_0 ) ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i > $i > $o] :
( ( epred1_0 @ ( esk6_1 @ X1 ) @ ( esk7_1 @ X1 ) )
| ( X1 @ ( esk3_1 @ X1 ) @ ( esk4_1 @ X1 ) )
| ( X1 @ esk1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_18,negated_conjecture,
! [X1: $i > $i > $o] :
( ( epred1_0 @ ( esk6_1 @ X1 ) @ ( esk7_1 @ X1 ) )
| ( X1 @ esk1_0 @ esk2_0 )
| ~ ( X1 @ ( esk3_1 @ X1 ) @ ( esk5_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_19,negated_conjecture,
( ( epred3_0 @ ( esk3_1 @ epred3_0 ) @ ( esk5_1 @ epred3_0 ) )
| ( epred1_0 @ ( esk6_1 @ epred3_0 ) @ ( esk7_1 @ epred3_0 ) ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_15]) ).
thf(c_0_20,negated_conjecture,
! [X3: $i,X4: $i] :
( ( epred2_0 @ X3 @ X4 )
| ~ ( epred1_0 @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_21,negated_conjecture,
epred1_0 @ ( esk6_1 @ epred3_0 ) @ ( esk7_1 @ epred3_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_15]) ).
thf(c_0_22,negated_conjecture,
! [X3: $i,X4: $i] :
( ( epred3_0 @ X3 @ X4 )
| ~ ( epred2_0 @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_23,negated_conjecture,
epred2_0 @ ( esk6_1 @ epred3_0 ) @ ( esk7_1 @ epred3_0 ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
thf(c_0_24,negated_conjecture,
! [X1: $i > $i > $o] :
( ( X1 @ ( esk4_1 @ X1 ) @ ( esk5_1 @ X1 ) )
| ( X1 @ esk1_0 @ esk2_0 )
| ~ ( X1 @ ( esk6_1 @ X1 ) @ ( esk7_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_25,negated_conjecture,
epred3_0 @ ( esk6_1 @ epred3_0 ) @ ( esk7_1 @ epred3_0 ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
thf(c_0_26,negated_conjecture,
epred3_0 @ ( esk4_1 @ epred3_0 ) @ ( esk5_1 @ epred3_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_15]) ).
thf(c_0_27,negated_conjecture,
! [X1: $i > $i > $o] :
( ( X1 @ ( esk3_1 @ X1 ) @ ( esk4_1 @ X1 ) )
| ( X1 @ esk1_0 @ esk2_0 )
| ~ ( X1 @ ( esk6_1 @ X1 ) @ ( esk7_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_28,negated_conjecture,
! [X3: $i] :
( ( epred3_0 @ X3 @ ( esk5_1 @ epred3_0 ) )
| ~ ( epred3_0 @ X3 @ ( esk4_1 @ epred3_0 ) ) ),
inference(spm,[status(thm)],[c_0_13,c_0_26]) ).
thf(c_0_29,negated_conjecture,
epred3_0 @ ( esk3_1 @ epred3_0 ) @ ( esk4_1 @ epred3_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_25]),c_0_15]) ).
thf(c_0_30,negated_conjecture,
! [X1: $i > $i > $o] :
( ( X1 @ esk1_0 @ esk2_0 )
| ~ ( X1 @ ( esk6_1 @ X1 ) @ ( esk7_1 @ X1 ) )
| ~ ( X1 @ ( esk3_1 @ X1 ) @ ( esk5_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_31,negated_conjecture,
epred3_0 @ ( esk3_1 @ epred3_0 ) @ ( esk5_1 @ epred3_0 ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
thf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_25])]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU468^1 : TPTP v8.2.0. Released v3.6.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n006.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 15:50:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/0.48 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/benchmark/theBenchmark.p
% 0.20/0.51 # Version: 3.1.0-ho
% 0.20/0.51 # Preprocessing class: HSSSSMSSMLSNHHN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.51 # Starting pre_casc_5 with 300s (1) cores
% 0.20/0.51 # Starting post_as_ho11 with 300s (1) cores
% 0.20/0.51 # Starting ho_unfolding_1 with 300s (1) cores
% 0.20/0.51 # pre_casc_5 with pid 31446 completed with status 0
% 0.20/0.51 # Result found by pre_casc_5
% 0.20/0.51 # Preprocessing class: HSSSSMSSMLSNHHN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.51 # Starting pre_casc_5 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,3,,5,20000,1.0,true)
% 0.20/0.51 # Search class: HGUNF-FFSF11-SHHSMMBN
% 0.20/0.51 # partial match(1): HGUNF-FFSF11-SHSSMMBN
% 0.20/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting ehoh_best2_full_lfho with 163s (1) cores
% 0.20/0.51 # ehoh_best2_full_lfho with pid 31451 completed with status 0
% 0.20/0.51 # Result found by ehoh_best2_full_lfho
% 0.20/0.51 # Preprocessing class: HSSSSMSSMLSNHHN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.51 # Starting pre_casc_5 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,3,,5,20000,1.0,true)
% 0.20/0.51 # Search class: HGUNF-FFSF11-SHHSMMBN
% 0.20/0.51 # partial match(1): HGUNF-FFSF11-SHSSMMBN
% 0.20/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting ehoh_best2_full_lfho with 163s (1) cores
% 0.20/0.51 # Preprocessing time : 0.002 s
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Theorem
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 59
% 0.20/0.51 # Removed by relevancy pruning/SinE : 45
% 0.20/0.51 # Initial clauses : 10
% 0.20/0.51 # Removed in clause preprocessing : 0
% 0.20/0.51 # Initial clauses in saturation : 10
% 0.20/0.51 # Processed clauses : 25
% 0.20/0.51 # ...of these trivial : 0
% 0.20/0.51 # ...subsumed : 0
% 0.20/0.51 # ...remaining for further processing : 25
% 0.20/0.51 # Other redundant clauses eliminated : 0
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 0
% 0.20/0.51 # Backward-rewritten : 3
% 0.20/0.51 # Generated clauses : 77
% 0.20/0.51 # ...of the previous two non-redundant : 60
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 0
% 0.20/0.51 # Paramodulations : 26
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 0
% 0.20/0.51 # Disequality decompositions : 0
% 0.20/0.51 # Total rewrite steps : 5
% 0.20/0.51 # ...of those cached : 3
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 21
% 0.20/0.51 # Positive orientable unit clauses : 6
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 1
% 0.20/0.51 # Non-unit-clauses : 14
% 0.20/0.51 # Current number of unprocessed clauses: 44
% 0.20/0.51 # ...number of literals in the above : 125
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 4
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 45
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 42
% 0.20/0.51 # Non-unit clause-clause subsumptions : 0
% 0.20/0.51 # Unit Clause-clause subsumption calls : 0
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 1
% 0.20/0.51 # BW rewrite match successes : 1
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 4955
% 0.20/0.51 # Search garbage collected termcells : 858
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.006 s
% 0.20/0.51 # System time : 0.005 s
% 0.20/0.51 # Total time : 0.011 s
% 0.20/0.51 # Maximum resident set size: 2148 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.008 s
% 0.20/0.51 # System time : 0.007 s
% 0.20/0.51 # Total time : 0.015 s
% 0.20/0.51 # Maximum resident set size: 1788 pages
% 0.20/0.51 % E---3.1 exiting
% 0.20/0.51 % E exiting
%------------------------------------------------------------------------------