TSTP Solution File: SYO568^7 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO568^7 : TPTP v8.2.0. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:48:05 EDT 2024
% Result : Theorem 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 32
% Syntax : Number of formulae : 68 ( 35 unt; 18 typ; 0 def)
% Number of atoms : 151 ( 23 equ; 0 cnn)
% Maximal formula atoms : 21 ( 3 avg)
% Number of connectives : 369 ( 66 ~; 54 |; 10 &; 233 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 84 ( 84 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 17 usr; 5 con; 0-3 aty)
% Number of variables : 97 ( 49 ^ 48 !; 0 ?; 97 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mu: $tType ).
thf(decl_24,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_25,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_30,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_31,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_33,type,
mequiv: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_36,type,
exists_in_world: mu > $i > $o ).
thf(decl_37,type,
mforall_ind: ( mu > $i > $o ) > $i > $o ).
thf(decl_40,type,
mreflexive: ( $i > $i > $o ) > $o ).
thf(decl_43,type,
mtransitive: ( $i > $i > $o ) > $o ).
thf(decl_50,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_54,type,
rel_s4: $i > $i > $o ).
thf(decl_55,type,
mbox_s4: ( $i > $o ) > $i > $o ).
thf(decl_57,type,
f: mu > $i > $o ).
thf(decl_58,type,
a: mu ).
thf(decl_60,type,
esk2_0: $i ).
thf(decl_61,type,
esk3_0: $i ).
thf(decl_62,type,
esk4_0: $i ).
thf(mand,axiom,
( mand
= ( ^ [X4: $i > $o,X5: $i > $o] : ( mnot @ ( mor @ ( mnot @ X4 ) @ ( mnot @ X5 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax',mand) ).
thf(mnot,axiom,
( mnot
= ( ^ [X4: $i > $o,X3: $i] :
~ ( X4 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X4: $i > $o,X5: $i > $o,X3: $i] :
( ( X4 @ X3 )
| ( X5 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax',mor) ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X4: $i > $o,X5: $i > $o] : ( mor @ ( mnot @ X4 ) @ X5 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax',mimplies) ).
thf(mequiv,axiom,
( mequiv
= ( ^ [X4: $i > $o,X5: $i > $o] : ( mand @ ( mimplies @ X4 @ X5 ) @ ( mimplies @ X5 @ X4 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax',mequiv) ).
thf(mforall_ind,axiom,
( mforall_ind
= ( ^ [X11: mu > $i > $o,X3: $i] :
! [X12: mu] :
( ( exists_in_world @ X12 @ X3 )
=> ( X11 @ X12 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax',mforall_ind) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X4: $i > $o] :
! [X3: $i] : ( X4 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax',mvalid) ).
thf(mbox_s4,axiom,
( mbox_s4
= ( ^ [X4: $i > $o,X3: $i] :
! [X7: $i] :
( ~ ( rel_s4 @ X3 @ X7 )
| ( X4 @ X7 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^5.ax',mbox_s4) ).
thf(mreflexive,axiom,
( mreflexive
= ( ^ [X6: $i > $i > $o] :
! [X16: $i] : ( X6 @ X16 @ X16 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax',mreflexive) ).
thf(con,conjecture,
( mvalid
@ ( mimplies
@ ( mforall_ind
@ ^ [X20: mu] : ( mor @ ( mbox_s4 @ ( f @ X20 ) ) @ ( mbox_s4 @ ( mnot @ ( f @ X20 ) ) ) ) )
@ ( mbox_s4 @ ( mequiv @ ( mbox_s4 @ ( f @ a ) ) @ ( f @ a ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
thf(a1,axiom,
mreflexive @ rel_s4,
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^5.ax',a1) ).
thf(existence_of_a_ax,axiom,
! [X7: $i] : ( exists_in_world @ a @ X7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_of_a_ax) ).
thf(mtransitive,axiom,
( mtransitive
= ( ^ [X6: $i > $i > $o] :
! [X16: $i,X17: $i,X18: $i] :
( ( ( X6 @ X16 @ X17 )
& ( X6 @ X17 @ X18 ) )
=> ( X6 @ X16 @ X18 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax',mtransitive) ).
thf(a2,axiom,
mtransitive @ rel_s4,
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^5.ax',a2) ).
thf(c_0_14,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( Z0 @ Z2 )
| ~ ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand]) ).
thf(c_0_15,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_16,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_17,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_18,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_19,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_14,c_0_15]),c_0_16]) ).
thf(c_0_20,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_17,c_0_15]),c_0_16]) ).
thf(c_0_21,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_18,c_0_19]),c_0_20]) ).
thf(c_0_22,plain,
( mforall_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
! [X12: mu] :
( ( exists_in_world @ X12 @ Z1 )
=> ( Z0 @ X12 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[mforall_ind]) ).
thf(c_0_23,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_24,plain,
( mbox_s4
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X7: $i] :
( ~ ( rel_s4 @ Z1 @ X7 )
| ( Z0 @ X7 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_s4]) ).
thf(c_0_25,plain,
( mreflexive
= ( ^ [Z0: $i > $i > $o] :
! [X16: $i] : ( Z0 @ X16 @ X16 ) ) ),
inference(fof_simplification,[status(thm)],[mreflexive]) ).
thf(c_0_26,negated_conjecture,
~ ! [X40: $i] :
( ~ ! [X37: mu] :
( ( exists_in_world @ X37 @ X40 )
=> ( ! [X35: $i] :
( ~ ( rel_s4 @ X40 @ X35 )
| ( f @ X37 @ X35 ) )
| ! [X36: $i] :
( ~ ( rel_s4 @ X40 @ X36 )
| ~ ( f @ X37 @ X36 ) ) ) )
| ! [X39: $i] :
( ~ ( rel_s4 @ X40 @ X39 )
| ~ ( ~ ( ~ ! [X38: $i] :
( ~ ( rel_s4 @ X39 @ X38 )
| ( f @ a @ X38 ) )
| ( f @ a @ X39 ) )
| ~ ( ~ ( f @ a @ X39 )
| ! [X38: $i] :
( ~ ( rel_s4 @ X39 @ X38 )
| ( f @ a @ X38 ) ) ) ) ) ),
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(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])]),c_0_15]),c_0_16]),c_0_20]),c_0_21]),c_0_22]),c_0_23]),c_0_24])]) ).
thf(c_0_27,plain,
! [X31: $i] : ( rel_s4 @ X31 @ X31 ),
inference(apply_def,[status(thm)],[a1,c_0_25]) ).
thf(c_0_28,negated_conjecture,
! [X52: mu,X53: $i,X54: $i,X56: $i] :
( ( ~ ( exists_in_world @ X52 @ esk2_0 )
| ~ ( rel_s4 @ esk2_0 @ X53 )
| ( f @ X52 @ X53 )
| ~ ( rel_s4 @ esk2_0 @ X54 )
| ~ ( f @ X52 @ X54 ) )
& ( rel_s4 @ esk2_0 @ esk3_0 )
& ( ( f @ a @ esk3_0 )
| ~ ( rel_s4 @ esk3_0 @ X56 )
| ( f @ a @ X56 ) )
& ( ( rel_s4 @ esk3_0 @ esk4_0 )
| ~ ( rel_s4 @ esk3_0 @ X56 )
| ( f @ a @ X56 ) )
& ( ~ ( f @ a @ esk4_0 )
| ~ ( rel_s4 @ esk3_0 @ X56 )
| ( f @ a @ X56 ) )
& ( ( f @ a @ esk3_0 )
| ~ ( f @ a @ esk3_0 ) )
& ( ( rel_s4 @ esk3_0 @ esk4_0 )
| ~ ( f @ a @ esk3_0 ) )
& ( ~ ( f @ a @ esk4_0 )
| ~ ( f @ a @ 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_26])])])])])]) ).
thf(c_0_29,plain,
! [X43: $i] : ( rel_s4 @ X43 @ X43 ),
inference(variable_rename,[status(thm)],[c_0_27]) ).
thf(c_0_30,plain,
! [X50: $i] : ( exists_in_world @ a @ X50 ),
inference(variable_rename,[status(thm)],[existence_of_a_ax]) ).
thf(c_0_31,plain,
( mtransitive
= ( ^ [Z0: $i > $i > $o] :
! [X16: $i,X17: $i,X18: $i] :
( ( ( Z0 @ X16 @ X17 )
& ( Z0 @ X17 @ X18 ) )
=> ( Z0 @ X16 @ X18 ) ) ) ),
inference(fof_simplification,[status(thm)],[mtransitive]) ).
thf(c_0_32,negated_conjecture,
! [X3: $i] :
( ( f @ a @ esk3_0 )
| ( f @ a @ X3 )
| ~ ( rel_s4 @ esk3_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_33,plain,
! [X3: $i] : ( rel_s4 @ X3 @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_34,negated_conjecture,
! [X3: $i,X10: mu,X7: $i] :
( ( f @ X10 @ X3 )
| ~ ( exists_in_world @ X10 @ esk2_0 )
| ~ ( rel_s4 @ esk2_0 @ X3 )
| ~ ( rel_s4 @ esk2_0 @ X7 )
| ~ ( f @ X10 @ X7 ) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_35,plain,
! [X3: $i] : ( exists_in_world @ a @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
thf(c_0_36,plain,
! [X32: $i,X33: $i,X34: $i] :
( ( ( rel_s4 @ X32 @ X33 )
& ( rel_s4 @ X33 @ X34 ) )
=> ( rel_s4 @ X32 @ X34 ) ),
inference(apply_def,[status(thm)],[a2,c_0_31]) ).
thf(c_0_37,negated_conjecture,
( ~ ( f @ a @ esk4_0 )
| ~ ( f @ a @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_38,negated_conjecture,
f @ a @ esk3_0,
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
thf(c_0_39,negated_conjecture,
! [X3: $i,X7: $i] :
( ( f @ a @ X3 )
| ~ ( rel_s4 @ esk2_0 @ X7 )
| ~ ( rel_s4 @ esk2_0 @ X3 )
| ~ ( f @ a @ X7 ) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
thf(c_0_40,negated_conjecture,
rel_s4 @ esk2_0 @ esk3_0,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_41,plain,
! [X44: $i,X45: $i,X46: $i] :
( ~ ( rel_s4 @ X44 @ X45 )
| ~ ( rel_s4 @ X45 @ X46 )
| ( rel_s4 @ X44 @ X46 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_36])])]) ).
thf(c_0_42,negated_conjecture,
( ( rel_s4 @ esk3_0 @ esk4_0 )
| ~ ( f @ a @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_43,negated_conjecture,
~ ( f @ a @ esk4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]) ).
thf(c_0_44,negated_conjecture,
! [X3: $i] :
( ( f @ a @ X3 )
| ~ ( rel_s4 @ esk2_0 @ X3 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_38]),c_0_40])]) ).
thf(c_0_45,plain,
! [X7: $i,X3: $i,X16: $i] :
( ( rel_s4 @ X3 @ X16 )
| ~ ( rel_s4 @ X3 @ X7 )
| ~ ( rel_s4 @ X7 @ X16 ) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
thf(c_0_46,negated_conjecture,
rel_s4 @ esk3_0 @ esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_38])]) ).
thf(c_0_47,negated_conjecture,
~ ( rel_s4 @ esk2_0 @ esk4_0 ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
thf(c_0_48,negated_conjecture,
! [X3: $i] :
( ( rel_s4 @ X3 @ esk4_0 )
| ~ ( rel_s4 @ X3 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
thf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SYO568^7 : TPTP v8.2.0. Released v5.5.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 10:38:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running higher-order theorem proving
% 0.21/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.21/0.51 # Version: 3.1.0-ho
% 0.21/0.51 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.21/0.51 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.21/0.51 # Starting almost_fo_3_lam with 300s (1) cores
% 0.21/0.51 # Starting post_as_ho1 with 300s (1) cores
% 0.21/0.51 # almost_fo_3_lam with pid 22378 completed with status 0
% 0.21/0.51 # Result found by almost_fo_3_lam
% 0.21/0.51 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.21/0.51 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.21/0.51 # Starting almost_fo_3_lam with 300s (1) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: HGHNS-FFSF11-SHSSMFNN
% 0.21/0.51 # partial match(1): HHHNS-FFSF11-SHSSMFNN
% 0.21/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.51 # new_ho_10 with pid 22384 completed with status 0
% 0.21/0.51 # Result found by new_ho_10
% 0.21/0.51 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.21/0.51 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.21/0.51 # Starting almost_fo_3_lam with 300s (1) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: HGHNS-FFSF11-SHSSMFNN
% 0.21/0.51 # partial match(1): HHHNS-FFSF11-SHSSMFNN
% 0.21/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.51 # Preprocessing time : 0.002 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Theorem
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 76
% 0.21/0.51 # Removed by relevancy pruning/SinE : 0
% 0.21/0.51 # Initial clauses : 51
% 0.21/0.51 # Removed in clause preprocessing : 39
% 0.21/0.51 # Initial clauses in saturation : 12
% 0.21/0.51 # Processed clauses : 36
% 0.21/0.51 # ...of these trivial : 0
% 0.21/0.51 # ...subsumed : 0
% 0.21/0.51 # ...remaining for further processing : 36
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 2
% 0.21/0.51 # Backward-rewritten : 4
% 0.21/0.51 # Generated clauses : 23
% 0.21/0.51 # ...of the previous two non-redundant : 17
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 0
% 0.21/0.51 # Paramodulations : 23
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 8
% 0.21/0.51 # ...of those cached : 4
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 18
% 0.21/0.51 # Positive orientable unit clauses : 7
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 2
% 0.21/0.51 # Non-unit-clauses : 9
% 0.21/0.51 # Current number of unprocessed clauses: 4
% 0.21/0.51 # ...number of literals in the above : 11
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 18
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 16
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 14
% 0.21/0.51 # Non-unit clause-clause subsumptions : 1
% 0.21/0.51 # Unit Clause-clause subsumption calls : 7
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 8
% 0.21/0.51 # BW rewrite match successes : 2
% 0.21/0.51 # Condensation attempts : 36
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 3493
% 0.21/0.51 # Search garbage collected termcells : 729
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.009 s
% 0.21/0.51 # System time : 0.004 s
% 0.21/0.51 # Total time : 0.013 s
% 0.21/0.51 # Maximum resident set size: 1920 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.014 s
% 0.21/0.51 # System time : 0.007 s
% 0.21/0.51 # Total time : 0.020 s
% 0.21/0.51 # Maximum resident set size: 1804 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.51 % E exiting
%------------------------------------------------------------------------------