TSTP Solution File: SYO463^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO463^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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 08:46:15 EDT 2024
% Result : Theorem 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 25
% Syntax : Number of formulae : 63 ( 23 unt; 15 typ; 0 def)
% Number of atoms : 166 ( 19 equ; 0 cnn)
% Maximal formula atoms : 31 ( 3 avg)
% Number of connectives : 403 ( 84 ~; 77 |; 14 &; 225 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 67 ( 67 >; 0 *; 0 +; 0 <<)
% Number of symbols : 17 ( 15 usr; 5 con; 0-3 aty)
% Number of variables : 82 ( 42 ^ 40 !; 0 ?; 82 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_24,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_25,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_26,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_27,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_29,type,
mequiv: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_42,type,
mtransitive: ( $i > $i > $o ) > $o ).
thf(decl_49,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_53,type,
rel_s4: $i > $i > $o ).
thf(decl_54,type,
mbox_s4: ( $i > $o ) > $i > $o ).
thf(decl_56,type,
p: $i > $o ).
thf(decl_57,type,
q: $i > $o ).
thf(decl_58,type,
esk1_0: $i ).
thf(decl_59,type,
esk2_0: $i ).
thf(decl_60,type,
esk3_0: $i ).
thf(decl_61,type,
esk4_0: $i ).
thf(mand,axiom,
( mand
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mnot @ ( mor @ ( mnot @ X6 ) @ ( mnot @ X7 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mand) ).
thf(mnot,axiom,
( mnot
= ( ^ [X6: $i > $o,X3: $i] :
~ ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X6: $i > $o,X7: $i > $o,X3: $i] :
( ( X6 @ X3 )
| ( X7 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mor) ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mor @ ( mnot @ X6 ) @ X7 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mimplies) ).
thf(mequiv,axiom,
( mequiv
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mand @ ( mimplies @ X6 @ X7 ) @ ( mimplies @ X7 @ X6 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mequiv) ).
thf(mtransitive,axiom,
( mtransitive
= ( ^ [X13: $i > $i > $o] :
! [X15: $i,X16: $i,X17: $i] :
( ( ( X13 @ X15 @ X16 )
& ( X13 @ X16 @ X17 ) )
=> ( X13 @ X15 @ X17 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mtransitive) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mvalid) ).
thf(mbox_s4,axiom,
( mbox_s4
= ( ^ [X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( rel_s4 @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^5.ax',mbox_s4) ).
thf(a2,axiom,
mtransitive @ rel_s4,
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^5.ax',a2) ).
thf(prove,conjecture,
mvalid @ ( mimplies @ ( mbox_s4 @ ( mequiv @ p @ q ) ) @ ( mbox_s4 @ ( mequiv @ ( mbox_s4 @ p ) @ ( mbox_s4 @ q ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove) ).
thf(c_0_10,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( Z0 @ Z2 )
| ~ ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand]) ).
thf(c_0_11,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_12,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_13,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_14,plain,
( mequiv
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) )
| ~ ( ~ ( Z1 @ Z2 )
| ( Z0 @ Z2 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[mequiv]) ).
thf(c_0_15,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( Z0 @ Z2 )
| ~ ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
thf(c_0_16,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_13,c_0_11]),c_0_12]) ).
thf(c_0_17,plain,
( mtransitive
= ( ^ [Z0: $i > $i > $o] :
! [X15: $i,X16: $i,X17: $i] :
( ( ( Z0 @ X15 @ X16 )
& ( Z0 @ X16 @ X17 ) )
=> ( Z0 @ X15 @ X17 ) ) ) ),
inference(fof_simplification,[status(thm)],[mtransitive]) ).
thf(c_0_18,plain,
( mequiv
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) )
| ~ ( ~ ( Z1 @ Z2 )
| ( Z0 @ Z2 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
thf(c_0_19,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_20,plain,
( mbox_s4
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X14: $i] :
( ~ ( rel_s4 @ Z1 @ X14 )
| ( Z0 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_s4]) ).
thf(c_0_21,plain,
! [X23: $i,X24: $i,X25: $i] :
( ( ( rel_s4 @ X23 @ X24 )
& ( rel_s4 @ X24 @ X25 ) )
=> ( rel_s4 @ X23 @ X25 ) ),
inference(apply_def,[status(thm)],[a2,c_0_17]) ).
thf(c_0_22,negated_conjecture,
~ ! [X30: $i] :
( ~ ! [X26: $i] :
( ~ ( rel_s4 @ X30 @ X26 )
| ~ ( ~ ( ~ ( p @ X26 )
| ( q @ X26 ) )
| ~ ( ~ ( q @ X26 )
| ( p @ X26 ) ) ) )
| ! [X29: $i] :
( ~ ( rel_s4 @ X30 @ X29 )
| ~ ( ~ ( ~ ! [X27: $i] :
( ~ ( rel_s4 @ X29 @ X27 )
| ( p @ X27 ) )
| ! [X28: $i] :
( ~ ( rel_s4 @ X29 @ X28 )
| ( q @ X28 ) ) )
| ~ ( ~ ! [X28: $i] :
( ~ ( rel_s4 @ X29 @ X28 )
| ( q @ X28 ) )
| ! [X27: $i] :
( ~ ( rel_s4 @ X29 @ X27 )
| ( p @ X27 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[prove]),c_0_16]),c_0_18]),c_0_19]),c_0_20])]) ).
thf(c_0_23,plain,
! [X32: $i,X33: $i,X34: $i] :
( ~ ( rel_s4 @ X32 @ X33 )
| ~ ( rel_s4 @ X33 @ X34 )
| ( rel_s4 @ X32 @ X34 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])]) ).
thf(c_0_24,negated_conjecture,
! [X36: $i,X38: $i,X40: $i] :
( ( ~ ( p @ X36 )
| ( q @ X36 )
| ~ ( rel_s4 @ esk1_0 @ X36 ) )
& ( ~ ( q @ X36 )
| ( p @ X36 )
| ~ ( rel_s4 @ esk1_0 @ X36 ) )
& ( rel_s4 @ esk1_0 @ esk2_0 )
& ( ~ ( rel_s4 @ esk2_0 @ X40 )
| ( q @ X40 )
| ~ ( rel_s4 @ esk2_0 @ X38 )
| ( p @ X38 ) )
& ( ( rel_s4 @ esk2_0 @ esk4_0 )
| ~ ( rel_s4 @ esk2_0 @ X38 )
| ( p @ X38 ) )
& ( ~ ( p @ esk4_0 )
| ~ ( rel_s4 @ esk2_0 @ X38 )
| ( p @ X38 ) )
& ( ~ ( rel_s4 @ esk2_0 @ X40 )
| ( q @ X40 )
| ( rel_s4 @ esk2_0 @ esk3_0 ) )
& ( ( rel_s4 @ esk2_0 @ esk4_0 )
| ( rel_s4 @ esk2_0 @ esk3_0 ) )
& ( ~ ( p @ esk4_0 )
| ( rel_s4 @ esk2_0 @ esk3_0 ) )
& ( ~ ( rel_s4 @ esk2_0 @ X40 )
| ( q @ X40 )
| ~ ( q @ esk3_0 ) )
& ( ( rel_s4 @ esk2_0 @ esk4_0 )
| ~ ( q @ esk3_0 ) )
& ( ~ ( p @ esk4_0 )
| ~ ( q @ esk3_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_22])])])])])]) ).
thf(c_0_25,plain,
! [X14: $i,X3: $i,X15: $i] :
( ( rel_s4 @ X3 @ X15 )
| ~ ( rel_s4 @ X3 @ X14 )
| ~ ( rel_s4 @ X14 @ X15 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_26,negated_conjecture,
( ( rel_s4 @ esk2_0 @ esk4_0 )
| ( rel_s4 @ esk2_0 @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_27,negated_conjecture,
! [X3: $i] :
( ( rel_s4 @ esk2_0 @ esk3_0 )
| ( rel_s4 @ X3 @ esk4_0 )
| ~ ( rel_s4 @ X3 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
thf(c_0_28,negated_conjecture,
rel_s4 @ esk1_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_29,negated_conjecture,
! [X3: $i] :
( ( q @ X3 )
| ( rel_s4 @ esk2_0 @ esk3_0 )
| ~ ( rel_s4 @ esk2_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_30,negated_conjecture,
! [X3: $i] :
( ( p @ X3 )
| ~ ( q @ X3 )
| ~ ( rel_s4 @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_31,negated_conjecture,
( ( rel_s4 @ esk1_0 @ esk4_0 )
| ( rel_s4 @ esk2_0 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
thf(c_0_32,negated_conjecture,
( ( rel_s4 @ esk2_0 @ esk3_0 )
| ( q @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_29,c_0_26]) ).
thf(c_0_33,negated_conjecture,
( ( rel_s4 @ esk2_0 @ esk3_0 )
| ~ ( p @ esk4_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_34,negated_conjecture,
rel_s4 @ esk2_0 @ esk3_0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33]) ).
thf(c_0_35,negated_conjecture,
! [X3: $i] :
( ( q @ X3 )
| ~ ( p @ X3 )
| ~ ( rel_s4 @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_36,negated_conjecture,
! [X3: $i] :
( ( rel_s4 @ X3 @ esk3_0 )
| ~ ( rel_s4 @ X3 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_25,c_0_34]) ).
thf(c_0_37,negated_conjecture,
( ( rel_s4 @ esk2_0 @ esk4_0 )
| ~ ( q @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_38,negated_conjecture,
! [X3: $i] :
( ( q @ X3 )
| ~ ( rel_s4 @ esk2_0 @ X3 )
| ~ ( q @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_39,negated_conjecture,
( ( q @ esk3_0 )
| ~ ( p @ esk3_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_28])]) ).
thf(c_0_40,negated_conjecture,
! [X3: $i] :
( ( rel_s4 @ X3 @ esk4_0 )
| ~ ( rel_s4 @ X3 @ esk2_0 )
| ~ ( q @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_25,c_0_37]) ).
thf(c_0_41,negated_conjecture,
( ~ ( p @ esk4_0 )
| ~ ( q @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_42,negated_conjecture,
! [X3: $i,X14: $i] :
( ( q @ X3 )
| ( p @ X14 )
| ~ ( rel_s4 @ esk2_0 @ X3 )
| ~ ( rel_s4 @ esk2_0 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_43,negated_conjecture,
! [X3: $i] :
( ( q @ X3 )
| ~ ( rel_s4 @ esk2_0 @ X3 )
| ~ ( p @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
thf(c_0_44,negated_conjecture,
( ~ ( q @ esk4_0 )
| ~ ( q @ esk3_0 ) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_40]),c_0_28])]),c_0_41]) ).
thf(c_0_45,negated_conjecture,
! [X3: $i] :
( ( q @ X3 )
| ~ ( rel_s4 @ esk2_0 @ X3 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_34]),c_0_43]) ).
thf(c_0_46,negated_conjecture,
~ ( q @ esk3_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_37]) ).
thf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_45]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYO463^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 09:25:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.49 Running higher-order theorem proving
% 0.20/0.49 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: HSMSSMSSMLMNHSN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.51 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.20/0.51 # Starting almost_fo_3_lam with 300s (1) cores
% 0.20/0.51 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.51 # ho_unfolding_3 with pid 17474 completed with status 0
% 0.20/0.51 # Result found by ho_unfolding_3
% 0.20/0.51 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: HGHNF-FFSF00-SHSSMFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting new_ho_10 with 811s (1) cores
% 0.20/0.51 # Starting ho_unfolding_3 with 151s (1) cores
% 0.20/0.51 # Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.20/0.51 # Starting lpo1_def_fix with 136s (1) cores
% 0.20/0.51 # Starting ehoh_best8_lambda with 136s (1) cores
% 0.20/0.51 # ho_unfolding_3 with pid 17480 completed with status 0
% 0.20/0.51 # Result found by ho_unfolding_3
% 0.20/0.51 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: HGHNF-FFSF00-SHSSMFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting new_ho_10 with 811s (1) cores
% 0.20/0.51 # Starting ho_unfolding_3 with 151s (1) cores
% 0.20/0.51 # Preprocessing time : 0.001 s
% 0.20/0.51 # Presaturation interreduction done
% 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 : 73
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 51
% 0.20/0.51 # Removed in clause preprocessing : 37
% 0.20/0.51 # Initial clauses in saturation : 14
% 0.20/0.51 # Processed clauses : 64
% 0.20/0.51 # ...of these trivial : 0
% 0.20/0.51 # ...subsumed : 11
% 0.20/0.51 # ...remaining for further processing : 53
% 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 : 9
% 0.20/0.51 # Backward-rewritten : 12
% 0.20/0.51 # Generated clauses : 65
% 0.20/0.51 # ...of the previous two non-redundant : 59
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 6
% 0.20/0.51 # Paramodulations : 65
% 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 : 25
% 0.20/0.51 # ...of those cached : 20
% 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 : 18
% 0.20/0.51 # Positive orientable unit clauses : 5
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 1
% 0.20/0.51 # Non-unit-clauses : 12
% 0.20/0.51 # Current number of unprocessed clauses: 9
% 0.20/0.51 # ...number of literals in the above : 26
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 35
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 43
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 40
% 0.20/0.51 # Non-unit clause-clause subsumptions : 20
% 0.20/0.51 # Unit Clause-clause subsumption calls : 12
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 7
% 0.20/0.51 # BW rewrite match successes : 3
% 0.20/0.51 # Condensation attempts : 64
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 3746
% 0.20/0.51 # Search garbage collected termcells : 651
% 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: 1968 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.024 s
% 0.20/0.51 # System time : 0.015 s
% 0.20/0.51 # Total time : 0.039 s
% 0.20/0.51 # Maximum resident set size: 1804 pages
% 0.20/0.51 % E---3.1 exiting
% 0.20/0.51 % E exiting
%------------------------------------------------------------------------------