TSTP Solution File: PLA032^7 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PLA032^7 : TPTP v8.2.0. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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 02:19:18 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 31
% Syntax : Number of formulae : 63 ( 29 unt; 19 typ; 0 def)
% Number of atoms : 144 ( 21 equ; 0 cnn)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 346 ( 65 ~; 45 |; 5 &; 223 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 83 ( 83 >; 0 *; 0 +; 0 <<)
% Number of symbols : 20 ( 18 usr; 4 con; 0-3 aty)
% Number of variables : 92 ( 48 ^ 44 !; 0 ?; 92 :)
% 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_36,type,
exists_in_world: mu > $i > $o ).
thf(decl_37,type,
mforall_ind: ( mu > $i > $o ) > $i > $o ).
thf(decl_38,type,
mexists_ind: ( mu > $i > $o ) > $i > $o ).
thf(decl_40,type,
mreflexive: ( $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,
defused: mu > $i > $o ).
thf(decl_58,type,
h: mu > $i > $o ).
thf(decl_59,type,
bomb: mu > $i > $o ).
thf(decl_63,type,
esk4_3: $i > $i > mu > mu ).
thf(decl_64,type,
esk5_0: $i ).
thf(decl_65,type,
esk6_0: $i ).
thf(decl_66,type,
esk7_0: mu ).
thf(mand,axiom,
( mand
= ( ^ [X4: $i > $o,X5: $i > $o] : ( mnot @ ( mor @ ( mnot @ X4 ) @ ( mnot @ X5 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax',mand) ).
thf(mnot,axiom,
( mnot
= ( ^ [X4: $i > $o,X3: $i] :
~ ( X4 @ X3 ) ) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/LCL015^0.ax',mor) ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X4: $i > $o,X5: $i > $o] : ( mor @ ( mnot @ X4 ) @ X5 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax',mimplies) ).
thf(mexists_ind,axiom,
( mexists_ind
= ( ^ [X13: mu > $i > $o] :
( mnot
@ ( mforall_ind
@ ^ [X14: mu] : ( mnot @ ( X13 @ X14 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax',mexists_ind) ).
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/sandbox2/benchmark/Axioms/LCL015^0.ax',mforall_ind) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X4: $i > $o] :
! [X3: $i] : ( X4 @ X3 ) ) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/LCL013^5.ax',mbox_s4) ).
thf(ax3,axiom,
( mvalid
@ ( mbox_s4
@ ( mforall_ind
@ ^ [X23: mu] :
( mexists_ind
@ ^ [X24: mu] : ( mbox_s4 @ ( mimplies @ ( mand @ ( bomb @ X23 ) @ ( h @ X24 ) ) @ ( defused @ X23 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3) ).
thf(con,conjecture,
( mvalid
@ ( mbox_s4
@ ( mforall_ind
@ ^ [X25: mu] :
( mexists_ind
@ ^ [X24: mu] : ( mimplies @ ( mand @ ( bomb @ X25 ) @ ( h @ X24 ) ) @ ( defused @ X25 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
thf(mreflexive,axiom,
( mreflexive
= ( ^ [X6: $i > $i > $o] :
! [X16: $i] : ( X6 @ X16 @ X16 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax',mreflexive) ).
thf(a1,axiom,
mreflexive @ rel_s4,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^5.ax',a1) ).
thf(c_0_12,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( Z0 @ Z2 )
| ~ ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand]) ).
thf(c_0_13,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_14,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_15,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_16,plain,
( mexists_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
~ ! [X32: mu] :
( ( exists_in_world @ X32 @ Z1 )
=> ~ ( Z0 @ X32 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[mexists_ind]) ).
thf(c_0_17,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_18,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_12,c_0_13]),c_0_14]) ).
thf(c_0_19,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_15,c_0_13]),c_0_14]) ).
thf(c_0_20,plain,
( mexists_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
~ ! [X32: mu] :
( ( exists_in_world @ X32 @ Z1 )
=> ~ ( Z0 @ X32 @ Z1 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_16,c_0_13]),c_0_17]) ).
thf(c_0_21,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_22,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_23,plain,
! [X51: $i,X50: $i] :
( ~ ( rel_s4 @ X51 @ X50 )
| ! [X49: mu] :
( ( exists_in_world @ X49 @ X50 )
=> ~ ! [X48: mu] :
( ( exists_in_world @ X48 @ X50 )
=> ~ ! [X47: $i] :
( ~ ( rel_s4 @ X50 @ X47 )
| ~ ~ ( ~ ( bomb @ X49 @ X47 )
| ~ ( h @ X48 @ X47 ) )
| ( defused @ X49 @ X47 ) ) ) ) ),
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(fof_simplification,[status(thm)],[ax3]),c_0_18]),c_0_19]),c_0_17]),c_0_20]),c_0_21]),c_0_22])]) ).
thf(c_0_24,negated_conjecture,
~ ! [X55: $i,X54: $i] :
( ~ ( rel_s4 @ X55 @ X54 )
| ! [X53: mu] :
( ( exists_in_world @ X53 @ X54 )
=> ~ ! [X52: mu] :
( ( exists_in_world @ X52 @ X54 )
=> ~ ( ~ ~ ( ~ ( bomb @ X53 @ X54 )
| ~ ( h @ X52 @ X54 ) )
| ( defused @ X53 @ X54 ) ) ) ) ),
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(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])]),c_0_18]),c_0_19]),c_0_17]),c_0_20]),c_0_21]),c_0_22])]) ).
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,plain,
! [X73: $i,X74: $i,X75: mu,X77: $i] :
( ( ( exists_in_world @ ( esk4_3 @ X73 @ X74 @ X75 ) @ X74 )
| ~ ( exists_in_world @ X75 @ X74 )
| ~ ( rel_s4 @ X73 @ X74 ) )
& ( ~ ( rel_s4 @ X74 @ X77 )
| ~ ( bomb @ X75 @ X77 )
| ~ ( h @ ( esk4_3 @ X73 @ X74 @ X75 ) @ X77 )
| ( defused @ X75 @ X77 )
| ~ ( exists_in_world @ X75 @ X74 )
| ~ ( rel_s4 @ X73 @ X74 ) ) ),
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_23])])])])])]) ).
thf(c_0_27,negated_conjecture,
! [X81: mu] :
( ( rel_s4 @ esk5_0 @ esk6_0 )
& ( exists_in_world @ esk7_0 @ esk6_0 )
& ( ( bomb @ esk7_0 @ esk6_0 )
| ~ ( exists_in_world @ X81 @ esk6_0 ) )
& ( ( h @ X81 @ esk6_0 )
| ~ ( exists_in_world @ X81 @ esk6_0 ) )
& ( ~ ( defused @ esk7_0 @ esk6_0 )
| ~ ( exists_in_world @ X81 @ esk6_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_24])])])])])]) ).
thf(c_0_28,plain,
! [X35: $i] : ( rel_s4 @ X35 @ X35 ),
inference(apply_def,[status(thm)],[a1,c_0_25]) ).
thf(c_0_29,plain,
! [X16: $i,X10: mu,X7: $i,X3: $i] :
( ( defused @ X10 @ X7 )
| ~ ( rel_s4 @ X3 @ X7 )
| ~ ( bomb @ X10 @ X7 )
| ~ ( h @ ( esk4_3 @ X16 @ X3 @ X10 ) @ X7 )
| ~ ( exists_in_world @ X10 @ X3 )
| ~ ( rel_s4 @ X16 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_30,negated_conjecture,
! [X10: mu] :
( ( h @ X10 @ esk6_0 )
| ~ ( exists_in_world @ X10 @ esk6_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_31,plain,
! [X58: $i] : ( rel_s4 @ X58 @ X58 ),
inference(variable_rename,[status(thm)],[c_0_28]) ).
thf(c_0_32,negated_conjecture,
! [X3: $i,X10: mu,X7: $i] :
( ( defused @ X10 @ esk6_0 )
| ~ ( exists_in_world @ ( esk4_3 @ X3 @ X7 @ X10 ) @ esk6_0 )
| ~ ( rel_s4 @ X7 @ esk6_0 )
| ~ ( bomb @ X10 @ esk6_0 )
| ~ ( rel_s4 @ X3 @ X7 )
| ~ ( exists_in_world @ X10 @ X7 ) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
thf(c_0_33,plain,
! [X3: $i,X10: mu,X7: $i] :
( ( exists_in_world @ ( esk4_3 @ X3 @ X7 @ X10 ) @ X7 )
| ~ ( exists_in_world @ X10 @ X7 )
| ~ ( rel_s4 @ X3 @ X7 ) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_34,plain,
! [X3: $i] : ( rel_s4 @ X3 @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
thf(c_0_35,negated_conjecture,
! [X3: $i,X10: mu] :
( ( defused @ X10 @ esk6_0 )
| ~ ( bomb @ X10 @ esk6_0 )
| ~ ( rel_s4 @ X3 @ esk6_0 )
| ~ ( exists_in_world @ X10 @ esk6_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
thf(c_0_36,negated_conjecture,
rel_s4 @ esk5_0 @ esk6_0,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_37,negated_conjecture,
! [X10: mu] :
( ( bomb @ esk7_0 @ esk6_0 )
| ~ ( exists_in_world @ X10 @ esk6_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_38,negated_conjecture,
exists_in_world @ esk7_0 @ esk6_0,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_39,negated_conjecture,
! [X10: mu] :
( ~ ( defused @ esk7_0 @ esk6_0 )
| ~ ( exists_in_world @ X10 @ esk6_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_40,negated_conjecture,
! [X10: mu] :
( ( defused @ X10 @ esk6_0 )
| ~ ( bomb @ X10 @ esk6_0 )
| ~ ( exists_in_world @ X10 @ esk6_0 ) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
thf(c_0_41,negated_conjecture,
bomb @ esk7_0 @ esk6_0,
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
thf(c_0_42,negated_conjecture,
! [X10: mu] :
~ ( exists_in_world @ X10 @ esk6_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_38])]) ).
thf(c_0_43,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_38,c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : PLA032^7 : TPTP v8.2.0. Released v5.5.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n022.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sat May 18 13:45:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/0.48 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/benchmark/theBenchmark.p
% 0.20/0.50 # Version: 3.1.0-ho
% 0.20/0.50 # Preprocessing class: HSMSSMSSMLLNHSN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.20/0.50 # Starting post_as_ho3 with 300s (1) cores
% 0.20/0.50 # Starting new_ho_12 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_2 with 300s (1) cores
% 0.20/0.50 # post_as_ho3 with pid 9969 completed with status 0
% 0.20/0.50 # Result found by post_as_ho3
% 0.20/0.50 # Preprocessing class: HSMSSMSSMLLNHSN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.20/0.50 # Starting post_as_ho3 with 300s (1) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: HHHNS-FFSF31-SHSSMFNN
% 0.20/0.50 # partial match(1): HHHNS-FFSF11-SHSSMFNN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.50 # new_ho_10 with pid 9977 completed with status 0
% 0.20/0.50 # Result found by new_ho_10
% 0.20/0.50 # Preprocessing class: HSMSSMSSMLLNHSN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.20/0.50 # Starting post_as_ho3 with 300s (1) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: HHHNS-FFSF31-SHSSMFNN
% 0.20/0.50 # partial match(1): HHHNS-FFSF11-SHSSMFNN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.50 # Preprocessing time : 0.002 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 79
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 54
% 0.20/0.50 # Removed in clause preprocessing : 39
% 0.20/0.50 # Initial clauses in saturation : 15
% 0.20/0.50 # Processed clauses : 47
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 1
% 0.20/0.50 # ...remaining for further processing : 46
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 7
% 0.20/0.50 # Backward-rewritten : 1
% 0.20/0.50 # Generated clauses : 33
% 0.20/0.50 # ...of the previous two non-redundant : 21
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 1
% 0.20/0.50 # Paramodulations : 30
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 12
% 0.20/0.50 # ...of those cached : 8
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 20
% 0.20/0.50 # Positive orientable unit clauses : 5
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 1
% 0.20/0.50 # Non-unit-clauses : 14
% 0.20/0.50 # Current number of unprocessed clauses: 2
% 0.20/0.50 # ...number of literals in the above : 7
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 26
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 83
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 32
% 0.20/0.50 # Non-unit clause-clause subsumptions : 4
% 0.20/0.50 # Unit Clause-clause subsumption calls : 8
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 3
% 0.20/0.50 # BW rewrite match successes : 1
% 0.20/0.50 # Condensation attempts : 47
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 4947
% 0.20/0.50 # Search garbage collected termcells : 1463
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.009 s
% 0.20/0.50 # System time : 0.003 s
% 0.20/0.50 # Total time : 0.013 s
% 0.20/0.50 # Maximum resident set size: 2104 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.012 s
% 0.20/0.50 # System time : 0.005 s
% 0.20/0.50 # Total time : 0.018 s
% 0.20/0.50 # Maximum resident set size: 1800 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------