TSTP Solution File: GEG013^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GEG013^1 : TPTP v8.2.0. Released v4.1.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 : Mon May 20 19:56:54 EDT 2024
% Result : Theorem 0.22s 0.51s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 32
% Syntax : Number of formulae : 57 ( 28 unt; 21 typ; 0 def)
% Number of atoms : 198 ( 21 equ; 0 cnn)
% Maximal formula atoms : 35 ( 5 avg)
% Number of connectives : 499 ( 51 ~; 30 |; 52 &; 328 @)
% ( 0 <=>; 38 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 4 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 36 ( 36 >; 0 *; 0 +; 0 <<)
% Number of symbols : 22 ( 20 usr; 7 con; 0-3 aty)
% Number of variables : 128 ( 44 ^ 65 !; 19 ?; 128 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
reg: $tType ).
thf(decl_37,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_49,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_53,type,
c: reg > reg > $o ).
thf(decl_55,type,
p: reg > reg > $o ).
thf(decl_56,type,
eq: reg > reg > $o ).
thf(decl_57,type,
o: reg > reg > $o ).
thf(decl_59,type,
ec: reg > reg > $o ).
thf(decl_60,type,
pp: reg > reg > $o ).
thf(decl_61,type,
tpp: reg > reg > $o ).
thf(decl_63,type,
catalunya: reg ).
thf(decl_65,type,
spain: reg ).
thf(decl_67,type,
a: $i > $i > $o ).
thf(decl_72,type,
esk4_0: reg ).
thf(decl_73,type,
esk5_0: reg ).
thf(decl_74,type,
esk6_1: reg > reg ).
thf(decl_75,type,
esk7_1: reg > reg ).
thf(decl_76,type,
esk8_1: reg > reg ).
thf(decl_77,type,
esk9_1: reg > reg ).
thf(decl_83,type,
esk15_0: $i ).
thf(decl_84,type,
esk16_0: $i ).
thf(o,axiom,
( o
= ( ^ [X28: reg,X29: reg] :
? [X25: reg] :
( ( p @ X25 @ X28 )
& ( p @ X25 @ X29 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL014^0.ax',o) ).
thf(p,axiom,
( p
= ( ^ [X23: reg,X24: reg] :
! [X25: reg] :
( ( c @ X25 @ X23 )
=> ( c @ X25 @ X24 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL014^0.ax',p) ).
thf(ec,axiom,
( ec
= ( ^ [X32: reg,X33: reg] :
( ( c @ X32 @ X33 )
& ~ ( o @ X32 @ X33 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL014^0.ax',ec) ).
thf(pp,axiom,
( pp
= ( ^ [X34: reg,X35: reg] :
( ( p @ X34 @ X35 )
& ~ ( p @ X35 @ X34 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL014^0.ax',pp) ).
thf(tpp,axiom,
( tpp
= ( ^ [X36: reg,X37: reg] :
( ( pp @ X36 @ X37 )
& ? [X25: reg] :
( ( ec @ X25 @ X36 )
& ( ec @ X25 @ X37 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL014^0.ax',tpp) ).
thf(eq,axiom,
( eq
= ( ^ [X26: reg,X27: reg] :
( ( p @ X26 @ X27 )
& ( p @ X27 @ X26 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL014^0.ax',eq) ).
thf(mbox,axiom,
( mbox
= ( ^ [X13: $i > $i > $o,X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( X13 @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mbox) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mvalid) ).
thf(ax1,axiom,
( mvalid
@ ( mbox @ a
@ ^ [X41: $i] : ( tpp @ catalunya @ spain ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).
thf(con,conjecture,
( mvalid
@ ( mbox @ a
@ ^ [X44: $i] :
? [X25: reg,X45: reg] :
~ ( eq @ X25 @ X45 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
thf(c_reflexive,axiom,
! [X18: reg] : ( c @ X18 @ X18 ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL014^0.ax',c_reflexive) ).
thf(c_0_11,plain,
( o
= ( ^ [Z0: reg,Z1: reg] :
? [X25: reg] :
( ! [X54: reg] :
( ( c @ X54 @ X25 )
=> ( c @ X54 @ Z0 ) )
& ! [X55: reg] :
( ( c @ X55 @ X25 )
=> ( c @ X55 @ Z1 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[o]) ).
thf(c_0_12,plain,
( p
= ( ^ [Z0: reg,Z1: reg] :
! [X25: reg] :
( ( c @ X25 @ Z0 )
=> ( c @ X25 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[p]) ).
thf(c_0_13,plain,
( ec
= ( ^ [Z0: reg,Z1: reg] :
( ( c @ Z0 @ Z1 )
& ~ ? [X61: reg] :
( ! [X62: reg] :
( ( c @ X62 @ X61 )
=> ( c @ X62 @ Z0 ) )
& ! [X63: reg] :
( ( c @ X63 @ X61 )
=> ( c @ X63 @ Z1 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[ec]) ).
thf(c_0_14,plain,
( o
= ( ^ [Z0: reg,Z1: reg] :
? [X25: reg] :
( ! [X54: reg] :
( ( c @ X54 @ X25 )
=> ( c @ X54 @ Z0 ) )
& ! [X55: reg] :
( ( c @ X55 @ X25 )
=> ( c @ X55 @ Z1 ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_15,plain,
( pp
= ( ^ [Z0: reg,Z1: reg] :
( ! [X64: reg] :
( ( c @ X64 @ Z0 )
=> ( c @ X64 @ Z1 ) )
& ~ ! [X65: reg] :
( ( c @ X65 @ Z1 )
=> ( c @ X65 @ Z0 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[pp]) ).
thf(c_0_16,plain,
( tpp
= ( ^ [Z0: reg,Z1: reg] :
( ! [X66: reg] :
( ( c @ X66 @ Z0 )
=> ( c @ X66 @ Z1 ) )
& ~ ! [X67: reg] :
( ( c @ X67 @ Z1 )
=> ( c @ X67 @ Z0 ) )
& ? [X25: reg] :
( ( c @ X25 @ Z0 )
& ~ ? [X68: reg] :
( ! [X69: reg] :
( ( c @ X69 @ X68 )
=> ( c @ X69 @ X25 ) )
& ! [X70: reg] :
( ( c @ X70 @ X68 )
=> ( c @ X70 @ Z0 ) ) )
& ( c @ X25 @ Z1 )
& ~ ? [X71: reg] :
( ! [X72: reg] :
( ( c @ X72 @ X71 )
=> ( c @ X72 @ X25 ) )
& ! [X73: reg] :
( ( c @ X73 @ X71 )
=> ( c @ X73 @ Z1 ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[tpp]) ).
thf(c_0_17,plain,
( ec
= ( ^ [Z0: reg,Z1: reg] :
( ( c @ Z0 @ Z1 )
& ~ ? [X61: reg] :
( ! [X62: reg] :
( ( c @ X62 @ X61 )
=> ( c @ X62 @ Z0 ) )
& ! [X63: reg] :
( ( c @ X63 @ X61 )
=> ( c @ X63 @ Z1 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_18,plain,
( pp
= ( ^ [Z0: reg,Z1: reg] :
( ! [X64: reg] :
( ( c @ X64 @ Z0 )
=> ( c @ X64 @ Z1 ) )
& ~ ! [X65: reg] :
( ( c @ X65 @ Z1 )
=> ( c @ X65 @ Z0 ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_15,c_0_12]) ).
thf(c_0_19,plain,
( eq
= ( ^ [Z0: reg,Z1: reg] :
( ! [X52: reg] :
( ( c @ X52 @ Z0 )
=> ( c @ X52 @ Z1 ) )
& ! [X53: reg] :
( ( c @ X53 @ Z1 )
=> ( c @ X53 @ Z0 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[eq]) ).
thf(c_0_20,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_21,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_22,plain,
( tpp
= ( ^ [Z0: reg,Z1: reg] :
( ! [X66: reg] :
( ( c @ X66 @ Z0 )
=> ( c @ X66 @ Z1 ) )
& ~ ! [X67: reg] :
( ( c @ X67 @ Z1 )
=> ( c @ X67 @ Z0 ) )
& ? [X25: reg] :
( ( c @ X25 @ Z0 )
& ~ ? [X68: reg] :
( ! [X69: reg] :
( ( c @ X69 @ X68 )
=> ( c @ X69 @ X25 ) )
& ! [X70: reg] :
( ( c @ X70 @ X68 )
=> ( c @ X70 @ Z0 ) ) )
& ( c @ X25 @ Z1 )
& ~ ? [X71: reg] :
( ! [X72: reg] :
( ( c @ X72 @ X71 )
=> ( c @ X72 @ X25 ) )
& ! [X73: reg] :
( ( c @ X73 @ X71 )
=> ( c @ X73 @ Z1 ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
thf(c_0_23,plain,
( eq
= ( ^ [Z0: reg,Z1: reg] :
( ! [X52: reg] :
( ( c @ X52 @ Z0 )
=> ( c @ X52 @ Z1 ) )
& ! [X53: reg] :
( ( c @ X53 @ Z1 )
=> ( c @ X53 @ Z0 ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_19,c_0_12]) ).
thf(c_0_24,plain,
! [X104: $i,X103: $i] :
( ~ ( a @ X104 @ X103 )
| ( ! [X94: reg] :
( ( c @ X94 @ catalunya )
=> ( c @ X94 @ spain ) )
& ~ ! [X95: reg] :
( ( c @ X95 @ spain )
=> ( c @ X95 @ catalunya ) )
& ? [X96: reg] :
( ( c @ X96 @ catalunya )
& ~ ? [X97: reg] :
( ! [X98: reg] :
( ( c @ X98 @ X97 )
=> ( c @ X98 @ X96 ) )
& ! [X99: reg] :
( ( c @ X99 @ X97 )
=> ( c @ X99 @ catalunya ) ) )
& ( c @ X96 @ spain )
& ~ ? [X100: reg] :
( ! [X101: reg] :
( ( c @ X101 @ X100 )
=> ( c @ X101 @ X96 ) )
& ! [X102: reg] :
( ( c @ X102 @ X100 )
=> ( c @ X102 @ spain ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[ax1]),c_0_20]),c_0_21]),c_0_22])]) ).
thf(c_0_25,negated_conjecture,
~ ! [X124: $i,X123: $i] :
( ~ ( a @ X124 @ X123 )
| ? [X25: reg,X45: reg] :
~ ( ! [X121: reg] :
( ( c @ X121 @ X25 )
=> ( c @ X121 @ X45 ) )
& ! [X122: reg] :
( ( c @ X122 @ X45 )
=> ( c @ X122 @ X25 ) ) ) ),
inference(fof_simplification,[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_20]),c_0_21]),c_0_23])]) ).
thf(c_0_26,plain,
! [X140: $i,X141: $i,X142: reg,X145: reg,X148: reg] :
( ( ~ ( c @ X142 @ catalunya )
| ( c @ X142 @ spain )
| ~ ( a @ X140 @ X141 ) )
& ( ( c @ esk4_0 @ spain )
| ~ ( a @ X140 @ X141 ) )
& ( ~ ( c @ esk4_0 @ catalunya )
| ~ ( a @ X140 @ X141 ) )
& ( ( c @ esk5_0 @ catalunya )
| ~ ( a @ X140 @ X141 ) )
& ( ( c @ ( esk7_1 @ X145 ) @ X145 )
| ( c @ ( esk6_1 @ X145 ) @ X145 )
| ~ ( a @ X140 @ X141 ) )
& ( ~ ( c @ ( esk7_1 @ X145 ) @ catalunya )
| ( c @ ( esk6_1 @ X145 ) @ X145 )
| ~ ( a @ X140 @ X141 ) )
& ( ( c @ ( esk7_1 @ X145 ) @ X145 )
| ~ ( c @ ( esk6_1 @ X145 ) @ esk5_0 )
| ~ ( a @ X140 @ X141 ) )
& ( ~ ( c @ ( esk7_1 @ X145 ) @ catalunya )
| ~ ( c @ ( esk6_1 @ X145 ) @ esk5_0 )
| ~ ( a @ X140 @ X141 ) )
& ( ( c @ esk5_0 @ spain )
| ~ ( a @ X140 @ X141 ) )
& ( ( c @ ( esk9_1 @ X148 ) @ X148 )
| ( c @ ( esk8_1 @ X148 ) @ X148 )
| ~ ( a @ X140 @ X141 ) )
& ( ~ ( c @ ( esk9_1 @ X148 ) @ spain )
| ( c @ ( esk8_1 @ X148 ) @ X148 )
| ~ ( a @ X140 @ X141 ) )
& ( ( c @ ( esk9_1 @ X148 ) @ X148 )
| ~ ( c @ ( esk8_1 @ X148 ) @ esk5_0 )
| ~ ( a @ X140 @ X141 ) )
& ( ~ ( c @ ( esk9_1 @ X148 ) @ spain )
| ~ ( c @ ( esk8_1 @ X148 ) @ esk5_0 )
| ~ ( a @ X140 @ X141 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])])])])])]) ).
thf(c_0_27,negated_conjecture,
! [X169: reg,X170: reg,X171: reg,X172: reg] :
( ( a @ esk15_0 @ esk16_0 )
& ( ~ ( c @ X171 @ X169 )
| ( c @ X171 @ X170 ) )
& ( ~ ( c @ X172 @ X170 )
| ( c @ X172 @ X169 ) ) ),
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_28,plain,
! [X125: reg] : ( c @ X125 @ X125 ),
inference(variable_rename,[status(thm)],[c_reflexive]) ).
thf(c_0_29,plain,
! [X3: $i,X14: $i] :
( ~ ( c @ esk4_0 @ catalunya )
| ~ ( a @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_30,negated_conjecture,
a @ esk15_0 @ esk16_0,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_31,negated_conjecture,
! [X18: reg,X20: reg,X19: reg] :
( ( c @ X18 @ X20 )
| ~ ( c @ X18 @ X19 ) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_32,plain,
! [X18: reg] : ( c @ X18 @ X18 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_33,negated_conjecture,
~ ( c @ esk4_0 @ catalunya ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
thf(c_0_34,negated_conjecture,
! [X18: reg,X19: reg] : ( c @ X18 @ X19 ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
thf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : GEG013^1 : TPTP v8.2.0. Released v4.1.0.
% 0.10/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n012.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Sat May 18 21:56:23 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.22/0.49 Running higher-order theorem proving
% 0.22/0.49 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.22/0.51 # Version: 3.1.0-ho
% 0.22/0.51 # Preprocessing class: HSMSSMSSMLLNHSN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.22/0.51 # Starting post_as_ho3 with 300s (1) cores
% 0.22/0.51 # Starting new_ho_12 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_2 with 300s (1) cores
% 0.22/0.51 # new_ho_10_cnf2 with pid 19205 completed with status 0
% 0.22/0.51 # Result found by new_ho_10_cnf2
% 0.22/0.51 # Preprocessing class: HSMSSMSSMLLNHSN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.22/0.51 # No SInE strategy applied
% 0.22/0.51 # Search class: HGHNF-FFMF21-SHSSMSBN
% 0.22/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.51 # Starting new_ho_9 with 811s (1) cores
% 0.22/0.51 # Starting new_ho_10_cnf2 with 151s (1) cores
% 0.22/0.51 # Starting pre_casc_8 with 136s (1) cores
% 0.22/0.51 # Starting post_as_ho2 with 136s (1) cores
% 0.22/0.51 # Starting post_as_ho1 with 136s (1) cores
% 0.22/0.51 # new_ho_10_cnf2 with pid 19212 completed with status 0
% 0.22/0.51 # Result found by new_ho_10_cnf2
% 0.22/0.51 # Preprocessing class: HSMSSMSSMLLNHSN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.22/0.51 # No SInE strategy applied
% 0.22/0.51 # Search class: HGHNF-FFMF21-SHSSMSBN
% 0.22/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.51 # Starting new_ho_9 with 811s (1) cores
% 0.22/0.51 # Starting new_ho_10_cnf2 with 151s (1) cores
% 0.22/0.51 # Preprocessing time : 0.003 s
% 0.22/0.51 # Presaturation interreduction done
% 0.22/0.51
% 0.22/0.51 # Proof found!
% 0.22/0.51 # SZS status Theorem
% 0.22/0.51 # SZS output start CNFRefutation
% See solution above
% 0.22/0.51 # Parsed axioms : 98
% 0.22/0.51 # Removed by relevancy pruning/SinE : 0
% 0.22/0.51 # Initial clauses : 85
% 0.22/0.51 # Removed in clause preprocessing : 49
% 0.22/0.51 # Initial clauses in saturation : 36
% 0.22/0.51 # Processed clauses : 59
% 0.22/0.51 # ...of these trivial : 0
% 0.22/0.51 # ...subsumed : 7
% 0.22/0.51 # ...remaining for further processing : 52
% 0.22/0.51 # Other redundant clauses eliminated : 0
% 0.22/0.51 # Clauses deleted for lack of memory : 0
% 0.22/0.51 # Backward-subsumed : 2
% 0.22/0.51 # Backward-rewritten : 18
% 0.22/0.51 # Generated clauses : 17
% 0.22/0.51 # ...of the previous two non-redundant : 16
% 0.22/0.51 # ...aggressively subsumed : 0
% 0.22/0.51 # Contextual simplify-reflections : 0
% 0.22/0.51 # Paramodulations : 17
% 0.22/0.51 # Factorizations : 0
% 0.22/0.51 # NegExts : 0
% 0.22/0.51 # Equation resolutions : 0
% 0.22/0.51 # Disequality decompositions : 0
% 0.22/0.51 # Total rewrite steps : 12
% 0.22/0.51 # ...of those cached : 0
% 0.22/0.51 # Propositional unsat checks : 0
% 0.22/0.51 # Propositional check models : 0
% 0.22/0.51 # Propositional check unsatisfiable : 0
% 0.22/0.51 # Propositional clauses : 0
% 0.22/0.51 # Propositional clauses after purity: 0
% 0.22/0.51 # Propositional unsat core size : 0
% 0.22/0.51 # Propositional preprocessing time : 0.000
% 0.22/0.51 # Propositional encoding time : 0.000
% 0.22/0.51 # Propositional solver time : 0.000
% 0.22/0.51 # Success case prop preproc time : 0.000
% 0.22/0.51 # Success case prop encoding time : 0.000
% 0.22/0.51 # Success case prop solver time : 0.000
% 0.22/0.51 # Current number of processed clauses : 3
% 0.22/0.51 # Positive orientable unit clauses : 2
% 0.22/0.51 # Positive unorientable unit clauses: 0
% 0.22/0.51 # Negative unit clauses : 0
% 0.22/0.51 # Non-unit-clauses : 1
% 0.22/0.51 # Current number of unprocessed clauses: 22
% 0.22/0.51 # ...number of literals in the above : 50
% 0.22/0.51 # Current number of archived formulas : 0
% 0.22/0.51 # Current number of archived clauses : 49
% 0.22/0.51 # Clause-clause subsumption calls (NU) : 188
% 0.22/0.51 # Rec. Clause-clause subsumption calls : 166
% 0.22/0.51 # Non-unit clause-clause subsumptions : 7
% 0.22/0.51 # Unit Clause-clause subsumption calls : 10
% 0.22/0.51 # Rewrite failures with RHS unbound : 0
% 0.22/0.51 # BW rewrite match attempts : 22
% 0.22/0.51 # BW rewrite match successes : 22
% 0.22/0.51 # Condensation attempts : 59
% 0.22/0.51 # Condensation successes : 0
% 0.22/0.51 # Termbank termtop insertions : 6570
% 0.22/0.51 # Search garbage collected termcells : 1907
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.010 s
% 0.22/0.51 # System time : 0.006 s
% 0.22/0.51 # Total time : 0.016 s
% 0.22/0.51 # Maximum resident set size: 2276 pages
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.032 s
% 0.22/0.51 # System time : 0.023 s
% 0.22/0.51 # Total time : 0.055 s
% 0.22/0.51 # Maximum resident set size: 1832 pages
% 0.22/0.51 % E---3.1 exiting
% 0.22/0.51 % E exiting
%------------------------------------------------------------------------------