TSTP Solution File: LCL947_10 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LCL947_10 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 00:04:12 EDT 2024
% Result : Theorem 0.13s 0.47s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 15
% Syntax : Number of formulae : 44 ( 10 unt; 11 typ; 0 def)
% Number of atoms : 132 ( 0 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 173 ( 74 ~; 78 |; 4 &)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 17 ( 6 >; 11 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-5 aty)
% Number of variables : 77 ( 0 sgn 77 !; 0 ?; 55 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
'$ki_world': $tType ).
tff(decl_22,type,
'$ki_local_world': '$ki_world' ).
tff(decl_23,type,
'$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).
tff(decl_24,type,
qmltpeq: ( '$ki_world' * $i * $i ) > $o ).
tff(decl_26,type,
subset: ( '$ki_world' * $i * $i ) > $o ).
tff(decl_27,type,
union: ( $i * $i ) > $i ).
tff(decl_28,type,
'$ki_exists_in_world_$i': ( '$ki_world' * $i ) > $o ).
tff(decl_33,type,
esk1_0: '$ki_world' ).
tff(decl_34,type,
esk2_0: $i ).
tff(decl_35,type,
esk3_0: '$ki_world' ).
tff(decl_41,type,
esk9_5: ( '$ki_world' * $i * '$ki_world' * $i * '$ki_world' ) > '$ki_world' ).
tff(verify,conjecture,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ! [X12] :
( '$ki_exists_in_world_$i'(X1,X12)
=> ! [X5: '$ki_world'] :
( '$ki_accessible'(X1,X5)
=> qmltpeq(X5,union(X12,X12),X12) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(subset_union,axiom,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ! [X12] :
( '$ki_exists_in_world_$i'(X1,X12)
=> ! [X5: '$ki_world'] :
( '$ki_accessible'(X1,X5)
=> ! [X13] :
( '$ki_exists_in_world_$i'(X5,X13)
=> ! [X7: '$ki_world'] :
( '$ki_accessible'(X5,X7)
=> ( ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> subset(X8,X12,X13) )
=> ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> qmltpeq(X8,union(X12,X13),X13) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_union) ).
tff(mrel_reflexive,axiom,
! [X1: '$ki_world'] : '$ki_accessible'(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mrel_reflexive) ).
tff(reflexivity_of_subset,axiom,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ! [X12] :
( '$ki_exists_in_world_$i'(X1,X12)
=> ! [X5: '$ki_world'] :
( '$ki_accessible'(X1,X5)
=> subset(X5,X12,X12) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_of_subset) ).
tff(c_0_4,negated_conjecture,
~ ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ! [X12] :
( '$ki_exists_in_world_$i'(X1,X12)
=> ! [X5: '$ki_world'] :
( '$ki_accessible'(X1,X5)
=> qmltpeq(X5,union(X12,X12),X12) ) ) ),
inference(assume_negation,[status(cth)],[verify]) ).
tff(c_0_5,plain,
! [X57: '$ki_world',X58,X59: '$ki_world',X60,X61: '$ki_world',X63: '$ki_world'] :
( ( '$ki_accessible'(X61,esk9_5(X57,X58,X59,X60,X61))
| ~ '$ki_accessible'(X61,X63)
| qmltpeq(X63,union(X58,X60),X60)
| ~ '$ki_accessible'(X59,X61)
| ~ '$ki_exists_in_world_$i'(X59,X60)
| ~ '$ki_accessible'(X57,X59)
| ~ '$ki_exists_in_world_$i'(X57,X58)
| ~ '$ki_accessible'('$ki_local_world',X57) )
& ( ~ subset(esk9_5(X57,X58,X59,X60,X61),X58,X60)
| ~ '$ki_accessible'(X61,X63)
| qmltpeq(X63,union(X58,X60),X60)
| ~ '$ki_accessible'(X59,X61)
| ~ '$ki_exists_in_world_$i'(X59,X60)
| ~ '$ki_accessible'(X57,X59)
| ~ '$ki_exists_in_world_$i'(X57,X58)
| ~ '$ki_accessible'('$ki_local_world',X57) ) ),
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)],[subset_union])])])])])]) ).
tff(c_0_6,negated_conjecture,
( '$ki_accessible'('$ki_local_world',esk1_0)
& '$ki_exists_in_world_$i'(esk1_0,esk2_0)
& '$ki_accessible'(esk1_0,esk3_0)
& ~ qmltpeq(esk3_0,union(esk2_0,esk2_0),esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
tcf(c_0_7,plain,
! [X1: '$ki_world',X6,X5: '$ki_world',X4,X3: '$ki_world',X2: '$ki_world'] :
( '$ki_accessible'(X1,esk9_5(X2,X4,X3,X6,X1))
| qmltpeq(X5,union(X4,X6),X6)
| ~ '$ki_accessible'(X1,X5)
| ~ '$ki_accessible'(X3,X1)
| ~ '$ki_exists_in_world_$i'(X3,X6)
| ~ '$ki_accessible'(X2,X3)
| ~ '$ki_exists_in_world_$i'(X2,X4)
| ~ '$ki_accessible'('$ki_local_world',X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
tcf(c_0_8,negated_conjecture,
'$ki_accessible'('$ki_local_world',esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_9,negated_conjecture,
! [X6,X4,X3: '$ki_world',X2: '$ki_world',X1: '$ki_world'] :
( qmltpeq(X1,union(X4,X6),X6)
| '$ki_accessible'(X2,esk9_5(esk1_0,X4,X3,X6,X2))
| ~ '$ki_exists_in_world_$i'(esk1_0,X4)
| ~ '$ki_exists_in_world_$i'(X3,X6)
| ~ '$ki_accessible'(esk1_0,X3)
| ~ '$ki_accessible'(X3,X2)
| ~ '$ki_accessible'(X2,X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
tcf(c_0_10,negated_conjecture,
'$ki_exists_in_world_$i'(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tff(c_0_11,plain,
! [X74: '$ki_world'] : '$ki_accessible'(X74,X74),
inference(variable_rename,[status(thm)],[mrel_reflexive]) ).
tcf(c_0_12,plain,
! [X3: '$ki_world',X6,X5: '$ki_world',X4,X2: '$ki_world',X1: '$ki_world'] :
( qmltpeq(X5,union(X4,X6),X6)
| ~ subset(esk9_5(X1,X4,X2,X6,X3),X4,X6)
| ~ '$ki_accessible'(X3,X5)
| ~ '$ki_accessible'(X2,X3)
| ~ '$ki_exists_in_world_$i'(X2,X6)
| ~ '$ki_accessible'(X1,X2)
| ~ '$ki_exists_in_world_$i'(X1,X4)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
tcf(c_0_13,negated_conjecture,
! [X4,X3: '$ki_world',X2: '$ki_world',X1: '$ki_world'] :
( qmltpeq(X1,union(esk2_0,X4),X4)
| '$ki_accessible'(X2,esk9_5(esk1_0,esk2_0,X3,X4,X2))
| ~ '$ki_exists_in_world_$i'(X3,X4)
| ~ '$ki_accessible'(esk1_0,X3)
| ~ '$ki_accessible'(X3,X2)
| ~ '$ki_accessible'(X2,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
tcf(c_0_14,plain,
! [X1: '$ki_world'] : '$ki_accessible'(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tcf(c_0_15,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world',X6,X4,X3: '$ki_world'] :
( qmltpeq(X1,union(X4,X6),X6)
| ~ '$ki_exists_in_world_$i'(esk1_0,X4)
| ~ '$ki_exists_in_world_$i'(X2,X6)
| ~ subset(esk9_5(esk1_0,X4,X2,X6,X3),X4,X6)
| ~ '$ki_accessible'(esk1_0,X2)
| ~ '$ki_accessible'(X3,X1)
| ~ '$ki_accessible'(X2,X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_8]) ).
tff(c_0_16,plain,
! [X108: '$ki_world',X109,X110: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X108)
| ~ '$ki_exists_in_world_$i'(X108,X109)
| ~ '$ki_accessible'(X108,X110)
| subset(X110,X109,X109) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[reflexivity_of_subset])])])]) ).
tcf(c_0_17,negated_conjecture,
! [X4,X2: '$ki_world',X1: '$ki_world'] :
( qmltpeq(X1,union(esk2_0,X4),X4)
| '$ki_accessible'(X2,esk9_5(esk1_0,esk2_0,esk1_0,X4,X2))
| ~ '$ki_exists_in_world_$i'(esk1_0,X4)
| ~ '$ki_accessible'(esk1_0,X2)
| ~ '$ki_accessible'(X2,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
tcf(c_0_18,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world',X4,X3: '$ki_world'] :
( qmltpeq(X1,union(esk2_0,X4),X4)
| ~ '$ki_exists_in_world_$i'(X2,X4)
| ~ subset(esk9_5(esk1_0,esk2_0,X2,X4,X3),esk2_0,X4)
| ~ '$ki_accessible'(esk1_0,X2)
| ~ '$ki_accessible'(X3,X1)
| ~ '$ki_accessible'(X2,X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_10]) ).
tcf(c_0_19,plain,
! [X1: '$ki_world',X4,X2: '$ki_world'] :
( subset(X2,X4,X4)
| ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_exists_in_world_$i'(X1,X4)
| ~ '$ki_accessible'(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
tcf(c_0_20,negated_conjecture,
! [X2: '$ki_world',X1: '$ki_world'] :
( qmltpeq(X1,union(esk2_0,esk2_0),esk2_0)
| '$ki_accessible'(X2,esk9_5(esk1_0,esk2_0,esk1_0,esk2_0,X2))
| ~ '$ki_accessible'(esk1_0,X2)
| ~ '$ki_accessible'(X2,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_10]) ).
tcf(c_0_21,negated_conjecture,
! [X4,X2: '$ki_world',X1: '$ki_world'] :
( qmltpeq(X1,union(esk2_0,X4),X4)
| ~ '$ki_exists_in_world_$i'(esk1_0,X4)
| ~ subset(esk9_5(esk1_0,esk2_0,esk1_0,X4,X2),esk2_0,X4)
| ~ '$ki_accessible'(esk1_0,X2)
| ~ '$ki_accessible'(X2,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_14]) ).
tcf(c_0_22,negated_conjecture,
! [X4,X1: '$ki_world'] :
( subset(X1,X4,X4)
| ~ '$ki_exists_in_world_$i'(esk1_0,X4)
| ~ '$ki_accessible'(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_8]) ).
tcf(c_0_23,negated_conjecture,
! [X1: '$ki_world'] :
( qmltpeq(X1,union(esk2_0,esk2_0),esk2_0)
| '$ki_accessible'(esk1_0,esk9_5(esk1_0,esk2_0,esk1_0,esk2_0,esk1_0))
| ~ '$ki_accessible'(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_14]) ).
tcf(c_0_24,negated_conjecture,
'$ki_accessible'(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_25,negated_conjecture,
~ qmltpeq(esk3_0,union(esk2_0,esk2_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_26,negated_conjecture,
! [X2: '$ki_world',X1: '$ki_world'] :
( qmltpeq(X1,union(esk2_0,esk2_0),esk2_0)
| ~ subset(esk9_5(esk1_0,esk2_0,esk1_0,esk2_0,X2),esk2_0,esk2_0)
| ~ '$ki_accessible'(esk1_0,X2)
| ~ '$ki_accessible'(X2,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_10]) ).
tcf(c_0_27,negated_conjecture,
! [X1: '$ki_world'] :
( subset(X1,esk2_0,esk2_0)
| ~ '$ki_accessible'(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_10]) ).
tcf(c_0_28,negated_conjecture,
'$ki_accessible'(esk1_0,esk9_5(esk1_0,esk2_0,esk1_0,esk2_0,esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
tcf(c_0_29,negated_conjecture,
! [X1: '$ki_world'] :
( qmltpeq(X1,union(esk2_0,esk2_0),esk2_0)
| ~ subset(esk9_5(esk1_0,esk2_0,esk1_0,esk2_0,esk1_0),esk2_0,esk2_0)
| ~ '$ki_accessible'(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_14]) ).
tcf(c_0_30,negated_conjecture,
subset(esk9_5(esk1_0,esk2_0,esk1_0,esk2_0,esk1_0),esk2_0,esk2_0),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
tcf(c_0_31,negated_conjecture,
! [X1: '$ki_world'] :
( qmltpeq(X1,union(esk2_0,esk2_0),esk2_0)
| ~ '$ki_accessible'(esk1_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_24]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.09 % Problem : LCL947_10 : TPTP v8.2.0. Released v8.2.0.
% 0.03/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon May 20 01:50:22 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.13/0.38 Running first-order model finding
% 0.13/0.38 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.47 # Version: 3.1.0
% 0.13/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.47 # Starting sh5l with 300s (1) cores
% 0.13/0.47 # new_bool_1 with pid 724 completed with status 0
% 0.13/0.47 # Result found by new_bool_1
% 0.13/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.47 # Search class: FGUNS-FSLS33-SFFFFFNN
% 0.13/0.47 # partial match(1): FGUNF-FSLS33-SFFFFFNN
% 0.13/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 100s (1) cores
% 0.13/0.47 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with pid 741 completed with status 0
% 0.13/0.47 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 0.13/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.47 # Search class: FGUNS-FSLS33-SFFFFFNN
% 0.13/0.47 # partial match(1): FGUNF-FSLS33-SFFFFFNN
% 0.13/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 100s (1) cores
% 0.13/0.47 # Preprocessing time : 0.004 s
% 0.13/0.47 # Presaturation interreduction done
% 0.13/0.47
% 0.13/0.47 # Proof found!
% 0.13/0.47 # SZS status Theorem
% 0.13/0.47 # SZS output start CNFRefutation
% See solution above
% 0.13/0.47 # Parsed axioms : 28
% 0.13/0.47 # Removed by relevancy pruning/SinE : 8
% 0.13/0.47 # Initial clauses : 92
% 0.13/0.47 # Removed in clause preprocessing : 0
% 0.13/0.47 # Initial clauses in saturation : 92
% 0.13/0.47 # Processed clauses : 877
% 0.13/0.47 # ...of these trivial : 0
% 0.13/0.47 # ...subsumed : 29
% 0.13/0.47 # ...remaining for further processing : 848
% 0.13/0.47 # Other redundant clauses eliminated : 0
% 0.13/0.47 # Clauses deleted for lack of memory : 0
% 0.13/0.47 # Backward-subsumed : 0
% 0.13/0.47 # Backward-rewritten : 2
% 0.13/0.47 # Generated clauses : 1173
% 0.13/0.47 # ...of the previous two non-redundant : 1143
% 0.13/0.47 # ...aggressively subsumed : 0
% 0.13/0.47 # Contextual simplify-reflections : 0
% 0.13/0.47 # Paramodulations : 1173
% 0.13/0.47 # Factorizations : 0
% 0.13/0.47 # NegExts : 0
% 0.13/0.47 # Equation resolutions : 0
% 0.13/0.47 # Disequality decompositions : 0
% 0.13/0.47 # Total rewrite steps : 31
% 0.13/0.47 # ...of those cached : 18
% 0.13/0.47 # Propositional unsat checks : 0
% 0.13/0.47 # Propositional check models : 0
% 0.13/0.47 # Propositional check unsatisfiable : 0
% 0.13/0.47 # Propositional clauses : 0
% 0.13/0.47 # Propositional clauses after purity: 0
% 0.13/0.47 # Propositional unsat core size : 0
% 0.13/0.47 # Propositional preprocessing time : 0.000
% 0.13/0.47 # Propositional encoding time : 0.000
% 0.13/0.47 # Propositional solver time : 0.000
% 0.13/0.47 # Success case prop preproc time : 0.000
% 0.13/0.47 # Success case prop encoding time : 0.000
% 0.13/0.47 # Success case prop solver time : 0.000
% 0.13/0.47 # Current number of processed clauses : 754
% 0.13/0.47 # Positive orientable unit clauses : 97
% 0.13/0.47 # Positive unorientable unit clauses: 0
% 0.13/0.47 # Negative unit clauses : 1
% 0.13/0.47 # Non-unit-clauses : 656
% 0.13/0.47 # Current number of unprocessed clauses: 447
% 0.13/0.47 # ...number of literals in the above : 2407
% 0.13/0.47 # Current number of archived formulas : 0
% 0.13/0.47 # Current number of archived clauses : 94
% 0.13/0.47 # Clause-clause subsumption calls (NU) : 45605
% 0.13/0.47 # Rec. Clause-clause subsumption calls : 11203
% 0.13/0.47 # Non-unit clause-clause subsumptions : 29
% 0.13/0.47 # Unit Clause-clause subsumption calls : 626
% 0.13/0.47 # Rewrite failures with RHS unbound : 0
% 0.13/0.47 # BW rewrite match attempts : 66
% 0.13/0.47 # BW rewrite match successes : 2
% 0.13/0.47 # Condensation attempts : 0
% 0.13/0.47 # Condensation successes : 0
% 0.13/0.47 # Termbank termtop insertions : 52741
% 0.13/0.47 # Search garbage collected termcells : 3321
% 0.13/0.47
% 0.13/0.47 # -------------------------------------------------
% 0.13/0.47 # User time : 0.063 s
% 0.13/0.47 # System time : 0.009 s
% 0.13/0.47 # Total time : 0.073 s
% 0.13/0.47 # Maximum resident set size: 2328 pages
% 0.13/0.47
% 0.13/0.47 # -------------------------------------------------
% 0.13/0.47 # User time : 0.066 s
% 0.13/0.47 # System time : 0.010 s
% 0.13/0.47 # Total time : 0.076 s
% 0.13/0.47 # Maximum resident set size: 1768 pages
% 0.13/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------