TSTP Solution File: LCL715^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL715^1 : TPTP v8.2.0. Bugfixed v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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 : Mon May 20 23:53:13 EDT 2024
% Result : Theorem 0.11s 0.39s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 26
% Syntax : Number of formulae : 56 ( 30 unt; 15 typ; 0 def)
% Number of atoms : 109 ( 34 equ; 0 cnn)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 318 ( 66 ~; 43 |; 9 &; 195 @)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 117 ( 117 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 15 usr; 3 con; 0-3 aty)
% Number of variables : 116 ( 66 ^ 47 !; 3 ?; 116 :)
% 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_32,type,
mforall_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
thf(decl_37,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_38,type,
mdia: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_45,type,
mfunctional: ( $i > $i > $o ) > $o ).
thf(decl_49,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_53,type,
epred1_0: $i > $i > $o ).
thf(decl_54,type,
esk1_2: $i > ( $i > $o ) > $i ).
thf(decl_55,type,
esk2_2: $i > ( $i > $o ) > $i ).
thf(decl_56,type,
esk3_0: $i ).
thf(decl_57,type,
esk4_1: $i > $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(mdia,axiom,
( mdia
= ( ^ [X13: $i > $i > $o,X6: $i > $o] : ( mnot @ ( mbox @ X13 @ ( mnot @ X6 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mdia) ).
thf(mbox,axiom,
( mbox
= ( ^ [X13: $i > $i > $o,X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( X13 @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mbox) ).
thf(mforall_prop,axiom,
( mforall_prop
= ( ^ [X9: ( $i > $o ) > $i > $o,X3: $i] :
! [X10: $i > $o] : ( X9 @ X10 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mforall_prop) ).
thf(mfunctional,axiom,
( mfunctional
= ( ^ [X13: $i > $i > $o] :
! [X15: $i] :
? [X16: $i] :
( ( X13 @ X15 @ X16 )
& ! [X17: $i] :
( ( X13 @ X15 @ X17 )
=> ( X16 = X17 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mfunctional) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mvalid) ).
thf(conj,conjecture,
! [X13: $i > $i > $o] :
( ( mvalid
@ ( mforall_prop
@ ^ [X18: $i > $o] : ( mequiv @ ( mdia @ X13 @ X18 ) @ ( mbox @ X13 @ X18 ) ) ) )
=> ( mfunctional @ X13 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(c_0_11,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( Z0 @ Z2 )
| ~ ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand]) ).
thf(c_0_12,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_13,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_14,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_15,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_16,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_11,c_0_12]),c_0_13]) ).
thf(c_0_17,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_14,c_0_12]),c_0_13]) ).
thf(c_0_18,plain,
( mdia
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
~ ! [X22: $i] :
( ~ ( Z0 @ Z2 @ X22 )
| ~ ( Z1 @ X22 ) ) ) ),
inference(fof_simplification,[status(thm)],[mdia]) ).
thf(c_0_19,plain,
( mbox
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
! [X14: $i] :
( ~ ( Z0 @ Z2 @ X14 )
| ( Z1 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox]) ).
thf(c_0_20,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_15,c_0_16]),c_0_17]) ).
thf(c_0_21,plain,
( mforall_prop
= ( ^ [Z0: ( $i > $o ) > $i > $o,Z1: $i] :
! [X10: $i > $o] : ( Z0 @ X10 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mforall_prop]) ).
thf(c_0_22,plain,
( mdia
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
~ ! [X22: $i] :
( ~ ( Z0 @ Z2 @ X22 )
| ~ ( Z1 @ X22 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_18,c_0_12]),c_0_19]) ).
thf(c_0_23,plain,
( mfunctional
= ( ^ [Z0: $i > $i > $o] :
! [X15: $i] :
? [X16: $i] :
( ( Z0 @ X15 @ X16 )
& ! [X17: $i] :
( ( Z0 @ X15 @ X17 )
=> ( X16 = X17 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[mfunctional]) ).
thf(c_0_24,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_25,negated_conjecture,
~ ! [X13: $i > $i > $o] :
( ! [X26: $i,X25: $i > $o] :
~ ( ~ ( ~ ~ ! [X23: $i] :
( ~ ( X13 @ X26 @ X23 )
| ~ ( X25 @ X23 ) )
| ! [X24: $i] :
( ~ ( X13 @ X26 @ X24 )
| ( X25 @ X24 ) ) )
| ~ ( ~ ! [X24: $i] :
( ~ ( X13 @ X26 @ X24 )
| ( X25 @ X24 ) )
| ~ ! [X23: $i] :
( ~ ( X13 @ X26 @ X23 )
| ~ ( X25 @ X23 ) ) ) )
=> ! [X27: $i] :
? [X28: $i] :
( ( X13 @ X27 @ X28 )
& ! [X29: $i] :
( ( X13 @ X27 @ X29 )
=> ( X28 = X29 ) ) ) ),
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)],[conj])]),c_0_20]),c_0_21]),c_0_19]),c_0_22]),c_0_23]),c_0_24]) ).
thf(c_0_26,negated_conjecture,
! [X31: $i,X32: $i > $o,X33: $i,X34: $i,X38: $i] :
( ( ~ ( epred1_0 @ X31 @ X33 )
| ~ ( X32 @ X33 )
| ~ ( epred1_0 @ X31 @ X34 )
| ( X32 @ X34 ) )
& ( ( epred1_0 @ X31 @ ( esk2_2 @ X31 @ X32 ) )
| ( epred1_0 @ X31 @ ( esk1_2 @ X31 @ X32 ) ) )
& ( ( X32 @ ( esk2_2 @ X31 @ X32 ) )
| ( epred1_0 @ X31 @ ( esk1_2 @ X31 @ X32 ) ) )
& ( ( epred1_0 @ X31 @ ( esk2_2 @ X31 @ X32 ) )
| ~ ( X32 @ ( esk1_2 @ X31 @ X32 ) ) )
& ( ( X32 @ ( esk2_2 @ X31 @ X32 ) )
| ~ ( X32 @ ( esk1_2 @ X31 @ X32 ) ) )
& ( ( epred1_0 @ esk3_0 @ ( esk4_1 @ X38 ) )
| ~ ( epred1_0 @ esk3_0 @ X38 ) )
& ( ( X38
!= ( esk4_1 @ X38 ) )
| ~ ( epred1_0 @ esk3_0 @ X38 ) ) ),
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_25])])])])])]) ).
thf(c_0_27,negated_conjecture,
! [X14: $i,X3: $i,X4: $i > $o,X15: $i] :
( ( X4 @ X15 )
| ~ ( epred1_0 @ X3 @ X14 )
| ~ ( X4 @ X14 )
| ~ ( epred1_0 @ X3 @ X15 ) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_28,negated_conjecture,
! [X3: $i,X4: $i > $o] :
( ( epred1_0 @ X3 @ ( esk2_2 @ X3 @ X4 ) )
| ~ ( X4 @ ( esk1_2 @ X3 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_29,negated_conjecture,
! [X3: $i,X4: $i > $o] :
( ( X4 @ ( esk2_2 @ X3 @ X4 ) )
| ( epred1_0 @ X3 @ ( esk1_2 @ X3 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_30,negated_conjecture,
! [X14: $i,X15: $i,X3: $i] :
( ( X3 = X14 )
| ~ ( epred1_0 @ X15 @ X14 )
| ~ ( epred1_0 @ X15 @ X3 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_27]) ).
thf(c_0_31,negated_conjecture,
! [X3: $i] :
( epred1_0 @ X3
@ ( esk2_2 @ X3
@ ^ [Z0: $i] : $true ) ),
inference(primitive_enumeration,[status(thm)],[c_0_28]) ).
thf(c_0_32,negated_conjecture,
! [X3: $i] :
( epred1_0 @ X3
@ ( esk1_2 @ X3
@ ^ [Z0: $i] : ~ $true ) ),
inference(primitive_enumeration,[status(thm)],[c_0_29]) ).
thf(c_0_33,negated_conjecture,
! [X3: $i] :
( ( epred1_0 @ esk3_0 @ ( esk4_1 @ X3 ) )
| ~ ( epred1_0 @ esk3_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_34,negated_conjecture,
! [X14: $i,X3: $i] :
( ( X3
= ( esk2_2 @ X14
@ ^ [Z0: $i] : $true ) )
| ~ ( epred1_0 @ X14 @ X3 ) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
thf(c_0_35,negated_conjecture,
! [X14: $i,X3: $i] :
( ( X3
= ( esk1_2 @ X14
@ ^ [Z0: $i] : ~ $true ) )
| ~ ( epred1_0 @ X14 @ X3 ) ),
inference(spm,[status(thm)],[c_0_30,c_0_32]) ).
thf(c_0_36,negated_conjecture,
( epred1_0 @ esk3_0
@ ( esk4_1
@ ( esk2_2 @ esk3_0
@ ^ [Z0: $i] : $true ) ) ),
inference(spm,[status(thm)],[c_0_33,c_0_31]) ).
thf(c_0_37,negated_conjecture,
! [X3: $i] :
( ( esk2_2 @ X3
@ ^ [Z0: $i] : $true )
= ( esk1_2 @ X3
@ ^ [Z0: $i] : ~ $true ) ),
inference(spm,[status(thm)],[c_0_34,c_0_32]) ).
thf(c_0_38,negated_conjecture,
! [X3: $i] :
( ( X3
!= ( esk4_1 @ X3 ) )
| ~ ( epred1_0 @ esk3_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_39,negated_conjecture,
( ( esk4_1
@ ( esk1_2 @ esk3_0
@ ^ [Z0: $i] : ~ $true ) )
= ( esk1_2 @ esk3_0
@ ^ [Z0: $i] : ~ $true ) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
thf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.08 % Problem : LCL715^1 : TPTP v8.2.0. Bugfixed v5.0.0.
% 0.02/0.08 % Command : run_E %s %d THM
% 0.07/0.27 % Computer : n010.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 300
% 0.07/0.27 % DateTime : Mon May 20 02:55:52 EDT 2024
% 0.07/0.27 % CPUTime :
% 0.11/0.36 Running higher-order theorem proving
% 0.11/0.36 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.11/0.39 # Version: 3.1.0-ho
% 0.11/0.39 # Preprocessing class: HSMSSMSSMLMNHHN.
% 0.11/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.39 # Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.11/0.39 # Starting lpo9_lambda_fix with 300s (1) cores
% 0.11/0.39 # Starting sh5l with 300s (1) cores
% 0.11/0.39 # Starting ho_unfolding_6 with 300s (1) cores
% 0.11/0.39 # ehoh_best2_full_lfho with pid 11565 completed with status 0
% 0.11/0.39 # Result found by ehoh_best2_full_lfho
% 0.11/0.39 # Preprocessing class: HSMSSMSSMLMNHHN.
% 0.11/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.39 # Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.11/0.39 # No SInE strategy applied
% 0.11/0.39 # Search class: HGHSF-FFSF21-SHHSMMBN
% 0.11/0.39 # partial match(1): HGHSF-FFSF21-SHHFMMBN
% 0.11/0.39 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.39 # Starting new_ho_10_cnf2 with 386s (1) cores
% 0.11/0.39 # Starting ehoh_best2_full_lfho with 151s (1) cores
% 0.11/0.39 # Starting new_bool_3 with 242s (1) cores
% 0.11/0.39 # Starting new_bool_2 with 242s (1) cores
% 0.11/0.39 # Starting new_bool_9 with 242s (1) cores
% 0.11/0.39 # ehoh_best2_full_lfho with pid 11572 completed with status 0
% 0.11/0.39 # Result found by ehoh_best2_full_lfho
% 0.11/0.39 # Preprocessing class: HSMSSMSSMLMNHHN.
% 0.11/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.39 # Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.11/0.39 # No SInE strategy applied
% 0.11/0.39 # Search class: HGHSF-FFSF21-SHHSMMBN
% 0.11/0.39 # partial match(1): HGHSF-FFSF21-SHHFMMBN
% 0.11/0.39 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.39 # Starting new_ho_10_cnf2 with 386s (1) cores
% 0.11/0.39 # Starting ehoh_best2_full_lfho with 151s (1) cores
% 0.11/0.39 # Preprocessing time : 0.001 s
% 0.11/0.39
% 0.11/0.39 # Proof found!
% 0.11/0.39 # SZS status Theorem
% 0.11/0.39 # SZS output start CNFRefutation
% See solution above
% 0.11/0.39 # Parsed axioms : 64
% 0.11/0.39 # Removed by relevancy pruning/SinE : 0
% 0.11/0.39 # Initial clauses : 39
% 0.11/0.39 # Removed in clause preprocessing : 32
% 0.11/0.39 # Initial clauses in saturation : 7
% 0.11/0.39 # Processed clauses : 63
% 0.11/0.39 # ...of these trivial : 2
% 0.11/0.39 # ...subsumed : 22
% 0.11/0.39 # ...remaining for further processing : 39
% 0.11/0.39 # Other redundant clauses eliminated : 0
% 0.11/0.39 # Clauses deleted for lack of memory : 0
% 0.11/0.39 # Backward-subsumed : 0
% 0.11/0.39 # Backward-rewritten : 7
% 0.11/0.39 # Generated clauses : 246
% 0.11/0.39 # ...of the previous two non-redundant : 225
% 0.11/0.39 # ...aggressively subsumed : 0
% 0.11/0.39 # Contextual simplify-reflections : 0
% 0.11/0.39 # Paramodulations : 210
% 0.11/0.39 # Factorizations : 0
% 0.11/0.39 # NegExts : 0
% 0.11/0.39 # Equation resolutions : 0
% 0.11/0.39 # Disequality decompositions : 0
% 0.11/0.39 # Total rewrite steps : 75
% 0.11/0.39 # ...of those cached : 66
% 0.11/0.39 # Propositional unsat checks : 0
% 0.11/0.39 # Propositional check models : 0
% 0.11/0.39 # Propositional check unsatisfiable : 0
% 0.11/0.39 # Propositional clauses : 0
% 0.11/0.39 # Propositional clauses after purity: 0
% 0.11/0.39 # Propositional unsat core size : 0
% 0.11/0.39 # Propositional preprocessing time : 0.000
% 0.11/0.39 # Propositional encoding time : 0.000
% 0.11/0.39 # Propositional solver time : 0.000
% 0.11/0.39 # Success case prop preproc time : 0.000
% 0.11/0.39 # Success case prop encoding time : 0.000
% 0.11/0.39 # Success case prop solver time : 0.000
% 0.11/0.39 # Current number of processed clauses : 30
% 0.11/0.39 # Positive orientable unit clauses : 8
% 0.11/0.39 # Positive unorientable unit clauses: 0
% 0.11/0.39 # Negative unit clauses : 0
% 0.11/0.39 # Non-unit-clauses : 22
% 0.11/0.39 # Current number of unprocessed clauses: 161
% 0.11/0.39 # ...number of literals in the above : 348
% 0.11/0.39 # Current number of archived formulas : 0
% 0.11/0.39 # Current number of archived clauses : 9
% 0.11/0.39 # Clause-clause subsumption calls (NU) : 208
% 0.11/0.39 # Rec. Clause-clause subsumption calls : 204
% 0.11/0.39 # Non-unit clause-clause subsumptions : 22
% 0.11/0.39 # Unit Clause-clause subsumption calls : 5
% 0.11/0.39 # Rewrite failures with RHS unbound : 0
% 0.11/0.39 # BW rewrite match attempts : 25
% 0.11/0.39 # BW rewrite match successes : 4
% 0.11/0.39 # Condensation attempts : 0
% 0.11/0.39 # Condensation successes : 0
% 0.11/0.39 # Termbank termtop insertions : 7613
% 0.11/0.39 # Search garbage collected termcells : 668
% 0.11/0.39
% 0.11/0.39 # -------------------------------------------------
% 0.11/0.39 # User time : 0.008 s
% 0.11/0.39 # System time : 0.006 s
% 0.11/0.39 # Total time : 0.013 s
% 0.11/0.39 # Maximum resident set size: 1960 pages
% 0.11/0.39
% 0.11/0.39 # -------------------------------------------------
% 0.11/0.39 # User time : 0.042 s
% 0.11/0.39 # System time : 0.015 s
% 0.11/0.39 # Total time : 0.057 s
% 0.11/0.39 # Maximum resident set size: 1792 pages
% 0.11/0.39 % E---3.1 exiting
% 0.11/0.39 % E exiting
%------------------------------------------------------------------------------