TSTP Solution File: SCT071-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SCT071-1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:17:15 EDT 2023
% Result : Unsatisfiable 7.56s 1.52s
% Output : CNFRefutation 7.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 38 ( 14 unt; 0 nHn; 28 RR)
% Number of literals : 66 ( 15 equ; 35 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 2 prp; 0-5 aty)
% Number of functors : 15 ( 15 usr; 3 con; 0-5 aty)
% Number of variables : 95 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_that_0,axiom,
( v_thesis____
| c_Set_Oimage(X1,c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi,tc_nat) != c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),c_Finite__Set_Ocard(c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi),tc_nat)
| ~ c_Fun_Oinj__on(X1,c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi,tc_nat) ),
file('/export/starexec/sandbox/tmp/tmp.ahfGx67KGv/E---3.1_23524.p',cls_that_0) ).
cnf(cls_conjecture_0,negated_conjecture,
~ v_thesis____,
file('/export/starexec/sandbox/tmp/tmp.ahfGx67KGv/E---3.1_23524.p',cls_conjecture_0) ).
cnf(cls_atLeast0LessThan_0,axiom,
c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),X1,tc_nat) = c_SetInterval_Oord__class_OlessThan(X1,tc_nat),
file('/export/starexec/sandbox/tmp/tmp.ahfGx67KGv/E---3.1_23524.p',cls_atLeast0LessThan_0) ).
cnf(cls_bij__betw__def_0,axiom,
( c_Fun_Oinj__on(X1,X2,X3,X4)
| ~ c_Fun_Obij__betw(X1,X2,X5,X3,X4) ),
file('/export/starexec/sandbox/tmp/tmp.ahfGx67KGv/E---3.1_23524.p',cls_bij__betw__def_0) ).
cnf(cls_bij__betw__inv__into_0,axiom,
( c_Fun_Obij__betw(c_Hilbert__Choice_Oinv__into(X1,X2,X3,X4),X5,X1,X4,X3)
| ~ c_Fun_Obij__betw(X2,X1,X5,X3,X4) ),
file('/export/starexec/sandbox/tmp/tmp.ahfGx67KGv/E---3.1_23524.p',cls_bij__betw__inv__into_0) ).
cnf(cls_finite_0,axiom,
( c_Finite__Set_Ofinite(X2,X1)
| ~ class_Finite__Set_Ofinite_Ofinite(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ahfGx67KGv/E---3.1_23524.p',cls_finite_0) ).
cnf(clsarity_bool__Finite__Set_Ofinite_Ofinite,axiom,
class_Finite__Set_Ofinite_Ofinite(tc_bool),
file('/export/starexec/sandbox/tmp/tmp.ahfGx67KGv/E---3.1_23524.p',clsarity_bool__Finite__Set_Ofinite_Ofinite) ).
cnf(cls_bij__betw__def_1,axiom,
( c_Set_Oimage(X1,X2,X3,X4) = X5
| ~ c_Fun_Obij__betw(X1,X2,X5,X3,X4) ),
file('/export/starexec/sandbox/tmp/tmp.ahfGx67KGv/E---3.1_23524.p',cls_bij__betw__def_1) ).
cnf(cls_finite__imageD_0,axiom,
( c_Finite__Set_Ofinite(X1,X2)
| ~ c_Fun_Oinj__on(X3,X1,X2,X4)
| ~ c_Finite__Set_Ofinite(c_Set_Oimage(X3,X1,X2,X4),X4) ),
file('/export/starexec/sandbox/tmp/tmp.ahfGx67KGv/E---3.1_23524.p',cls_finite__imageD_0) ).
cnf(cls_inj__on__inverseI_1,axiom,
( c_Fun_Oinj__on(X2,X3,X4,X5)
| hAPP(X1,hAPP(X2,c_ATP__Linkup_Osko__Fun__Xinj__on__inverseI__1__1(X3,X2,X1,X4,X5))) != c_ATP__Linkup_Osko__Fun__Xinj__on__inverseI__1__1(X3,X2,X1,X4,X5) ),
file('/export/starexec/sandbox/tmp/tmp.ahfGx67KGv/E---3.1_23524.p',cls_inj__on__inverseI_1) ).
cnf(cls_double__complement_0,axiom,
hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),X2)) = X2,
file('/export/starexec/sandbox/tmp/tmp.ahfGx67KGv/E---3.1_23524.p',cls_double__complement_0) ).
cnf(cls_ex__bij__betw__nat__finite_0,axiom,
( c_Fun_Obij__betw(c_List_Osko__SetInterval__Xex__bij__betw__nat__finite__1__1(X1,X2),c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),c_Finite__Set_Ocard(X1,X2),tc_nat),X1,tc_nat,X2)
| ~ c_Finite__Set_Ofinite(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.ahfGx67KGv/E---3.1_23524.p',cls_ex__bij__betw__nat__finite_0) ).
cnf(c_0_12,axiom,
( v_thesis____
| c_Set_Oimage(X1,c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi,tc_nat) != c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),c_Finite__Set_Ocard(c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi),tc_nat)
| ~ c_Fun_Oinj__on(X1,c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi,tc_nat) ),
cls_that_0 ).
cnf(c_0_13,negated_conjecture,
~ v_thesis____,
cls_conjecture_0 ).
cnf(c_0_14,plain,
( c_Set_Oimage(X1,c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi,tc_nat) != c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),c_Finite__Set_Ocard(c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi),tc_nat)
| ~ c_Fun_Oinj__on(X1,c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi,tc_nat) ),
inference(sr,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,axiom,
c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),X1,tc_nat) = c_SetInterval_Oord__class_OlessThan(X1,tc_nat),
cls_atLeast0LessThan_0 ).
cnf(c_0_16,axiom,
( c_Fun_Oinj__on(X1,X2,X3,X4)
| ~ c_Fun_Obij__betw(X1,X2,X5,X3,X4) ),
cls_bij__betw__def_0 ).
cnf(c_0_17,axiom,
( c_Fun_Obij__betw(c_Hilbert__Choice_Oinv__into(X1,X2,X3,X4),X5,X1,X4,X3)
| ~ c_Fun_Obij__betw(X2,X1,X5,X3,X4) ),
cls_bij__betw__inv__into_0 ).
cnf(c_0_18,axiom,
( c_Finite__Set_Ofinite(X2,X1)
| ~ class_Finite__Set_Ofinite_Ofinite(X1) ),
cls_finite_0 ).
cnf(c_0_19,axiom,
class_Finite__Set_Ofinite_Ofinite(tc_bool),
clsarity_bool__Finite__Set_Ofinite_Ofinite ).
cnf(c_0_20,plain,
( c_Set_Oimage(X1,c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi,tc_nat) != c_SetInterval_Oord__class_OlessThan(c_Finite__Set_Ocard(c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi),tc_nat)
| ~ c_Fun_Oinj__on(X1,c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi,tc_nat) ),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
( c_Fun_Oinj__on(c_Hilbert__Choice_Oinv__into(X1,X2,X3,X4),X5,X4,X3)
| ~ c_Fun_Obij__betw(X2,X1,X5,X3,X4) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,axiom,
( c_Set_Oimage(X1,X2,X3,X4) = X5
| ~ c_Fun_Obij__betw(X1,X2,X5,X3,X4) ),
cls_bij__betw__def_1 ).
cnf(c_0_23,axiom,
( c_Finite__Set_Ofinite(X1,X2)
| ~ c_Fun_Oinj__on(X3,X1,X2,X4)
| ~ c_Finite__Set_Ofinite(c_Set_Oimage(X3,X1,X2,X4),X4) ),
cls_finite__imageD_0 ).
cnf(c_0_24,plain,
c_Finite__Set_Ofinite(X1,tc_bool),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,axiom,
( c_Fun_Oinj__on(X2,X3,X4,X5)
| hAPP(X1,hAPP(X2,c_ATP__Linkup_Osko__Fun__Xinj__on__inverseI__1__1(X3,X2,X1,X4,X5))) != c_ATP__Linkup_Osko__Fun__Xinj__on__inverseI__1__1(X3,X2,X1,X4,X5) ),
cls_inj__on__inverseI_1 ).
cnf(c_0_26,axiom,
hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),X2)) = X2,
cls_double__complement_0 ).
cnf(c_0_27,plain,
( c_Set_Oimage(c_Hilbert__Choice_Oinv__into(X1,X2,tc_nat,tc_Arrow__Order__Mirabelle_Oindi),c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi,tc_nat) != c_SetInterval_Oord__class_OlessThan(c_Finite__Set_Ocard(c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi),tc_nat)
| ~ c_Fun_Obij__betw(X2,X1,c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_nat,tc_Arrow__Order__Mirabelle_Oindi) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
( c_Set_Oimage(c_Hilbert__Choice_Oinv__into(X1,X2,X3,X4),X5,X4,X3) = X1
| ~ c_Fun_Obij__betw(X2,X1,X5,X3,X4) ),
inference(spm,[status(thm)],[c_0_22,c_0_17]) ).
cnf(c_0_29,axiom,
( c_Fun_Obij__betw(c_List_Osko__SetInterval__Xex__bij__betw__nat__finite__1__1(X1,X2),c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),c_Finite__Set_Ocard(X1,X2),tc_nat),X1,tc_nat,X2)
| ~ c_Finite__Set_Ofinite(X1,X2) ),
cls_ex__bij__betw__nat__finite_0 ).
cnf(c_0_30,plain,
( c_Finite__Set_Ofinite(X1,X2)
| ~ c_Fun_Oinj__on(X3,X1,X2,tc_bool) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,plain,
c_Fun_Oinj__on(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),X2,X3,X4),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,plain,
( X1 != c_SetInterval_Oord__class_OlessThan(c_Finite__Set_Ocard(c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi),tc_nat)
| ~ c_Fun_Obij__betw(X2,X1,c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_nat,tc_Arrow__Order__Mirabelle_Oindi) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
( c_Fun_Obij__betw(c_List_Osko__SetInterval__Xex__bij__betw__nat__finite__1__1(X1,X2),c_SetInterval_Oord__class_OlessThan(c_Finite__Set_Ocard(X1,X2),tc_nat),X1,tc_nat,X2)
| ~ c_Finite__Set_Ofinite(X1,X2) ),
inference(rw,[status(thm)],[c_0_29,c_0_15]) ).
cnf(c_0_34,plain,
c_Finite__Set_Ofinite(X1,X2),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
~ c_Fun_Obij__betw(X1,c_SetInterval_Oord__class_OlessThan(c_Finite__Set_Ocard(c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_Arrow__Order__Mirabelle_Oindi),tc_nat),c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_bool)),tc_nat,tc_Arrow__Order__Mirabelle_Oindi),
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_36,plain,
c_Fun_Obij__betw(c_List_Osko__SetInterval__Xex__bij__betw__nat__finite__1__1(X1,X2),c_SetInterval_Oord__class_OlessThan(c_Finite__Set_Ocard(X1,X2),tc_nat),X1,tc_nat,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_37,plain,
$false,
inference(spm,[status(thm)],[c_0_35,c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SCT071-1 : TPTP v8.1.2. Released v4.1.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 10:55:41 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.54 Running first-order model finding
% 0.19/0.54 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/tmp/tmp.ahfGx67KGv/E---3.1_23524.p
% 7.56/1.52 # Version: 3.1pre001
% 7.56/1.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 7.56/1.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.56/1.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 7.56/1.52 # Starting new_bool_3 with 300s (1) cores
% 7.56/1.52 # Starting new_bool_1 with 300s (1) cores
% 7.56/1.52 # Starting sh5l with 300s (1) cores
% 7.56/1.52 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 23602 completed with status 0
% 7.56/1.52 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 7.56/1.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 7.56/1.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.56/1.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 7.56/1.52 # No SInE strategy applied
% 7.56/1.52 # Search class: FGHSM-FSLM32-DFFFFFNN
% 7.56/1.52 # Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 7.56/1.52 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 125s (1) cores
% 7.56/1.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 125s (1) cores
% 7.56/1.52 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 125s (1) cores
% 7.56/1.52 # Starting U----_206c_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 125s (1) cores
% 7.56/1.52 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with 125s (1) cores
% 7.56/1.52 # G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 23609 completed with status 0
% 7.56/1.52 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_S0Y
% 7.56/1.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 7.56/1.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.56/1.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 7.56/1.52 # No SInE strategy applied
% 7.56/1.52 # Search class: FGHSM-FSLM32-DFFFFFNN
% 7.56/1.52 # Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 7.56/1.52 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 125s (1) cores
% 7.56/1.52 # Preprocessing time : 0.017 s
% 7.56/1.52
% 7.56/1.52 # Proof found!
% 7.56/1.52 # SZS status Unsatisfiable
% 7.56/1.52 # SZS output start CNFRefutation
% See solution above
% 7.56/1.52 # Parsed axioms : 837
% 7.56/1.52 # Removed by relevancy pruning/SinE : 0
% 7.56/1.52 # Initial clauses : 837
% 7.56/1.52 # Removed in clause preprocessing : 0
% 7.56/1.52 # Initial clauses in saturation : 837
% 7.56/1.52 # Processed clauses : 3715
% 7.56/1.52 # ...of these trivial : 171
% 7.56/1.52 # ...subsumed : 1830
% 7.56/1.52 # ...remaining for further processing : 1714
% 7.56/1.52 # Other redundant clauses eliminated : 32
% 7.56/1.52 # Clauses deleted for lack of memory : 0
% 7.56/1.52 # Backward-subsumed : 97
% 7.56/1.52 # Backward-rewritten : 152
% 7.56/1.52 # Generated clauses : 32587
% 7.56/1.52 # ...of the previous two non-redundant : 28336
% 7.56/1.52 # ...aggressively subsumed : 0
% 7.56/1.52 # Contextual simplify-reflections : 18
% 7.56/1.52 # Paramodulations : 32493
% 7.56/1.52 # Factorizations : 15
% 7.56/1.52 # NegExts : 0
% 7.56/1.52 # Equation resolutions : 79
% 7.56/1.52 # Total rewrite steps : 15509
% 7.56/1.52 # Propositional unsat checks : 0
% 7.56/1.52 # Propositional check models : 0
% 7.56/1.52 # Propositional check unsatisfiable : 0
% 7.56/1.52 # Propositional clauses : 0
% 7.56/1.52 # Propositional clauses after purity: 0
% 7.56/1.52 # Propositional unsat core size : 0
% 7.56/1.52 # Propositional preprocessing time : 0.000
% 7.56/1.52 # Propositional encoding time : 0.000
% 7.56/1.52 # Propositional solver time : 0.000
% 7.56/1.52 # Success case prop preproc time : 0.000
% 7.56/1.52 # Success case prop encoding time : 0.000
% 7.56/1.52 # Success case prop solver time : 0.000
% 7.56/1.52 # Current number of processed clauses : 1465
% 7.56/1.52 # Positive orientable unit clauses : 261
% 7.56/1.52 # Positive unorientable unit clauses: 17
% 7.56/1.52 # Negative unit clauses : 45
% 7.56/1.52 # Non-unit-clauses : 1142
% 7.56/1.52 # Current number of unprocessed clauses: 25069
% 7.56/1.52 # ...number of literals in the above : 75177
% 7.56/1.52 # Current number of archived formulas : 0
% 7.56/1.52 # Current number of archived clauses : 249
% 7.56/1.52 # Clause-clause subsumption calls (NU) : 191567
% 7.56/1.52 # Rec. Clause-clause subsumption calls : 134187
% 7.56/1.52 # Non-unit clause-clause subsumptions : 1528
% 7.56/1.52 # Unit Clause-clause subsumption calls : 7493
% 7.56/1.52 # Rewrite failures with RHS unbound : 0
% 7.56/1.52 # BW rewrite match attempts : 1965
% 7.56/1.52 # BW rewrite match successes : 149
% 7.56/1.52 # Condensation attempts : 0
% 7.56/1.52 # Condensation successes : 0
% 7.56/1.52 # Termbank termtop insertions : 555679
% 7.56/1.52
% 7.56/1.52 # -------------------------------------------------
% 7.56/1.52 # User time : 0.881 s
% 7.56/1.52 # System time : 0.024 s
% 7.56/1.52 # Total time : 0.905 s
% 7.56/1.52 # Maximum resident set size: 3224 pages
% 7.56/1.52
% 7.56/1.52 # -------------------------------------------------
% 7.56/1.52 # User time : 4.445 s
% 7.56/1.52 # System time : 0.143 s
% 7.56/1.52 # Total time : 4.588 s
% 7.56/1.52 # Maximum resident set size: 2296 pages
% 7.56/1.52 % E---3.1 exiting
%------------------------------------------------------------------------------