TSTP Solution File: ALG412-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : ALG412-1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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 18:13:17 EDT 2024
% Result : Unsatisfiable 2.46s 0.71s
% Output : CNFRefutation 2.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of clauses : 47 ( 19 unt; 8 nHn; 28 RR)
% Number of literals : 78 ( 54 equ; 27 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 43 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_class__semiring_Oadd__0_0,axiom,
( c_HOL_Oplus__class_Oplus(c_HOL_Ozero__class_Ozero(X1),X2,X1) = X2
| ~ class_Ring__and__Field_Ocomm__semiring__1(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_class__semiring_Oadd__0_0) ).
cnf(cls_pCons_Oprems_0,axiom,
( c_Polynomial_Opoly(c_Polynomial_OpCons(v_d____,v_ds____,tc_Complex_Ocomplex),X1,tc_Complex_Ocomplex) = c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex)
| X1 = c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_pCons_Oprems_0) ).
cnf(cls_CHAINED_0_02,axiom,
v_d____ = c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_CHAINED_0_02) ).
cnf(cls_poly__pCons_0,axiom,
( c_Polynomial_Opoly(c_Polynomial_OpCons(X2,X3,X1),X4,X1) = c_HOL_Oplus__class_Oplus(X2,c_HOL_Otimes__class_Otimes(X4,c_Polynomial_Opoly(X3,X4,X1),X1),X1)
| ~ class_Ring__and__Field_Ocomm__semiring__0(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_poly__pCons_0) ).
cnf(clsarity_Complex__Ocomplex__Ring__and__Field_Ocomm__semiring__1,axiom,
class_Ring__and__Field_Ocomm__semiring__1(tc_Complex_Ocomplex),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsarity_Complex__Ocomplex__Ring__and__Field_Ocomm__semiring__1) ).
cnf(cls_divide__zero__left_0,axiom,
( c_HOL_Oinverse__class_Odivide(c_HOL_Ozero__class_Ozero(X1),X2,X1) = c_HOL_Ozero__class_Ozero(X1)
| ~ class_Ring__and__Field_Ofield(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_divide__zero__left_0) ).
cnf(cls_CHAINED_1,axiom,
( v_ds____ = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex))
| c_Polynomial_Opoly(v_ds____,v_sko__CHAINED__1(v_ds____),tc_Complex_Ocomplex) != c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_CHAINED_1) ).
cnf(cls_eq__divide__imp_0,axiom,
( X2 = c_HOL_Ozero__class_Ozero(X1)
| X3 = c_HOL_Oinverse__class_Odivide(c_HOL_Otimes__class_Otimes(X3,X2,X1),X2,X1)
| ~ class_Ring__and__Field_Ofield(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_eq__divide__imp_0) ).
cnf(clsarity_Complex__Ocomplex__Ring__and__Field_Ocomm__semiring__0,axiom,
class_Ring__and__Field_Ocomm__semiring__0(tc_Complex_Ocomplex),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsarity_Complex__Ocomplex__Ring__and__Field_Ocomm__semiring__0) ).
cnf(clsarity_Complex__Ocomplex__Ring__and__Field_Ofield,axiom,
class_Ring__and__Field_Ofield(tc_Complex_Ocomplex),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsarity_Complex__Ocomplex__Ring__and__Field_Ofield) ).
cnf(cls_CHAINED_0,axiom,
( v_ds____ = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex))
| v_sko__CHAINED__1(v_ds____) != c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_CHAINED_0) ).
cnf(cls_pCons__0__0_0,axiom,
( c_Polynomial_OpCons(c_HOL_Ozero__class_Ozero(X1),c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X1)),X1) = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X1))
| ~ class_HOL_Ozero(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_pCons__0__0_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_Polynomial_OpCons(v_d____,v_ds____,tc_Complex_Ocomplex) != c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(clsarity_Complex__Ocomplex__HOL_Ozero,axiom,
class_HOL_Ozero(tc_Complex_Ocomplex),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsarity_Complex__Ocomplex__HOL_Ozero) ).
cnf(c_0_14,plain,
( c_HOL_Oplus__class_Oplus(c_HOL_Ozero__class_Ozero(X1),X2,X1) = X2
| ~ class_Ring__and__Field_Ocomm__semiring__1(X1) ),
inference(fof_simplification,[status(thm)],[cls_class__semiring_Oadd__0_0]) ).
cnf(c_0_15,axiom,
( c_Polynomial_Opoly(c_Polynomial_OpCons(v_d____,v_ds____,tc_Complex_Ocomplex),X1,tc_Complex_Ocomplex) = c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex)
| X1 = c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex) ),
cls_pCons_Oprems_0 ).
cnf(c_0_16,axiom,
v_d____ = c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),
cls_CHAINED_0_02 ).
cnf(c_0_17,plain,
( c_Polynomial_Opoly(c_Polynomial_OpCons(X2,X3,X1),X4,X1) = c_HOL_Oplus__class_Oplus(X2,c_HOL_Otimes__class_Otimes(X4,c_Polynomial_Opoly(X3,X4,X1),X1),X1)
| ~ class_Ring__and__Field_Ocomm__semiring__0(X1) ),
inference(fof_simplification,[status(thm)],[cls_poly__pCons_0]) ).
cnf(c_0_18,plain,
( c_HOL_Oplus__class_Oplus(c_HOL_Ozero__class_Ozero(X1),X2,X1) = X2
| ~ class_Ring__and__Field_Ocomm__semiring__1(X1) ),
c_0_14 ).
cnf(c_0_19,axiom,
class_Ring__and__Field_Ocomm__semiring__1(tc_Complex_Ocomplex),
clsarity_Complex__Ocomplex__Ring__and__Field_Ocomm__semiring__1 ).
cnf(c_0_20,plain,
( c_HOL_Oinverse__class_Odivide(c_HOL_Ozero__class_Ozero(X1),X2,X1) = c_HOL_Ozero__class_Ozero(X1)
| ~ class_Ring__and__Field_Ofield(X1) ),
inference(fof_simplification,[status(thm)],[cls_divide__zero__left_0]) ).
cnf(c_0_21,plain,
( v_ds____ = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex))
| c_Polynomial_Opoly(v_ds____,v_sko__CHAINED__1(v_ds____),tc_Complex_Ocomplex) != c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex) ),
inference(fof_simplification,[status(thm)],[cls_CHAINED_1]) ).
cnf(c_0_22,plain,
( X2 = c_HOL_Ozero__class_Ozero(X1)
| X3 = c_HOL_Oinverse__class_Odivide(c_HOL_Otimes__class_Otimes(X3,X2,X1),X2,X1)
| ~ class_Ring__and__Field_Ofield(X1) ),
inference(fof_simplification,[status(thm)],[cls_eq__divide__imp_0]) ).
cnf(c_0_23,plain,
( c_Polynomial_Opoly(c_Polynomial_OpCons(v_d____,v_ds____,tc_Complex_Ocomplex),X1,tc_Complex_Ocomplex) = v_d____
| X1 = v_d____ ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_16]) ).
cnf(c_0_24,plain,
( c_Polynomial_Opoly(c_Polynomial_OpCons(X2,X3,X1),X4,X1) = c_HOL_Oplus__class_Oplus(X2,c_HOL_Otimes__class_Otimes(X4,c_Polynomial_Opoly(X3,X4,X1),X1),X1)
| ~ class_Ring__and__Field_Ocomm__semiring__0(X1) ),
c_0_17 ).
cnf(c_0_25,plain,
c_HOL_Oplus__class_Oplus(v_d____,X1,tc_Complex_Ocomplex) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_16]) ).
cnf(c_0_26,axiom,
class_Ring__and__Field_Ocomm__semiring__0(tc_Complex_Ocomplex),
clsarity_Complex__Ocomplex__Ring__and__Field_Ocomm__semiring__0 ).
cnf(c_0_27,plain,
( c_HOL_Oinverse__class_Odivide(c_HOL_Ozero__class_Ozero(X1),X2,X1) = c_HOL_Ozero__class_Ozero(X1)
| ~ class_Ring__and__Field_Ofield(X1) ),
c_0_20 ).
cnf(c_0_28,axiom,
class_Ring__and__Field_Ofield(tc_Complex_Ocomplex),
clsarity_Complex__Ocomplex__Ring__and__Field_Ofield ).
cnf(c_0_29,plain,
( v_ds____ = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex))
| v_sko__CHAINED__1(v_ds____) != c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex) ),
inference(fof_simplification,[status(thm)],[cls_CHAINED_0]) ).
cnf(c_0_30,plain,
( v_ds____ = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex))
| c_Polynomial_Opoly(v_ds____,v_sko__CHAINED__1(v_ds____),tc_Complex_Ocomplex) != c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex) ),
c_0_21 ).
cnf(c_0_31,plain,
( X2 = c_HOL_Ozero__class_Ozero(X1)
| X3 = c_HOL_Oinverse__class_Odivide(c_HOL_Otimes__class_Otimes(X3,X2,X1),X2,X1)
| ~ class_Ring__and__Field_Ofield(X1) ),
c_0_22 ).
cnf(c_0_32,plain,
( c_HOL_Otimes__class_Otimes(X1,c_Polynomial_Opoly(v_ds____,X1,tc_Complex_Ocomplex),tc_Complex_Ocomplex) = v_d____
| X1 = v_d____ ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_33,plain,
c_HOL_Oinverse__class_Odivide(v_d____,X1,tc_Complex_Ocomplex) = v_d____,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_16]),c_0_16]) ).
cnf(c_0_34,plain,
( v_ds____ = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex))
| v_sko__CHAINED__1(v_ds____) != c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex) ),
c_0_29 ).
cnf(c_0_35,plain,
( c_Polynomial_OpCons(c_HOL_Ozero__class_Ozero(X1),c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X1)),X1) = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X1))
| ~ class_HOL_Ozero(X1) ),
inference(fof_simplification,[status(thm)],[cls_pCons__0__0_0]) ).
cnf(c_0_36,negated_conjecture,
c_Polynomial_OpCons(v_d____,v_ds____,tc_Complex_Ocomplex) != c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_37,plain,
( c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)) = v_ds____
| c_Polynomial_Opoly(v_ds____,v_sko__CHAINED__1(v_ds____),tc_Complex_Ocomplex) != v_d____ ),
inference(rw,[status(thm)],[c_0_30,c_0_16]) ).
cnf(c_0_38,plain,
( c_Polynomial_Opoly(v_ds____,X1,tc_Complex_Ocomplex) = v_d____
| v_d____ = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_16]),c_0_28])]) ).
cnf(c_0_39,plain,
( c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)) = v_ds____
| v_sko__CHAINED__1(v_ds____) != v_d____ ),
inference(rw,[status(thm)],[c_0_34,c_0_16]) ).
cnf(c_0_40,plain,
( c_Polynomial_OpCons(c_HOL_Ozero__class_Ozero(X1),c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X1)),X1) = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(X1))
| ~ class_HOL_Ozero(X1) ),
c_0_35 ).
cnf(c_0_41,axiom,
class_HOL_Ozero(tc_Complex_Ocomplex),
clsarity_Complex__Ocomplex__HOL_Ozero ).
cnf(c_0_42,negated_conjecture,
c_Polynomial_OpCons(v_d____,v_ds____,tc_Complex_Ocomplex) != c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
c_0_36 ).
cnf(c_0_43,plain,
c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)) = v_ds____,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_44,plain,
c_Polynomial_OpCons(v_d____,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex) = c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_16]) ).
cnf(c_0_45,negated_conjecture,
c_Polynomial_OpCons(v_d____,v_ds____,tc_Complex_Ocomplex) != v_ds____,
inference(rw,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_43]),c_0_43]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : ALG412-1 : TPTP v8.2.0. Released v4.1.0.
% 0.00/0.09 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n020.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 : Sat May 18 23:00:52 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.13/0.39 Running first-order model finding
% 0.13/0.39 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 2.46/0.71 # Version: 3.1.0
% 2.46/0.71 # Preprocessing class: FSLMSMSSSSSNFFN.
% 2.46/0.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.46/0.71 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 2.46/0.71 # Starting new_bool_3 with 600s (2) cores
% 2.46/0.71 # Starting new_bool_1 with 600s (2) cores
% 2.46/0.71 # Starting sh5l with 300s (1) cores
% 2.46/0.71 # sh5l with pid 24680 completed with status 0
% 2.46/0.71 # Result found by sh5l
% 2.46/0.71 # Preprocessing class: FSLMSMSSSSSNFFN.
% 2.46/0.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.46/0.71 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 2.46/0.71 # Starting new_bool_3 with 600s (2) cores
% 2.46/0.71 # Starting new_bool_1 with 600s (2) cores
% 2.46/0.71 # Starting sh5l with 300s (1) cores
% 2.46/0.71 # SinE strategy is gf500_gu_R04_F100_L20000
% 2.46/0.71 # Search class: FGHSF-FSLM32-DFFFFFNN
% 2.46/0.71 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.46/0.71 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 2.46/0.71 # SAT001_MinMin_p005000_rr_RG with pid 24688 completed with status 0
% 2.46/0.71 # Result found by SAT001_MinMin_p005000_rr_RG
% 2.46/0.71 # Preprocessing class: FSLMSMSSSSSNFFN.
% 2.46/0.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.46/0.71 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 2.46/0.71 # Starting new_bool_3 with 600s (2) cores
% 2.46/0.71 # Starting new_bool_1 with 600s (2) cores
% 2.46/0.71 # Starting sh5l with 300s (1) cores
% 2.46/0.71 # SinE strategy is gf500_gu_R04_F100_L20000
% 2.46/0.71 # Search class: FGHSF-FSLM32-DFFFFFNN
% 2.46/0.71 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.46/0.71 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 2.46/0.71 # Preprocessing time : 0.007 s
% 2.46/0.71 # Presaturation interreduction done
% 2.46/0.71
% 2.46/0.71 # Proof found!
% 2.46/0.71 # SZS status Unsatisfiable
% 2.46/0.71 # SZS output start CNFRefutation
% See solution above
% 2.46/0.71 # Parsed axioms : 836
% 2.46/0.71 # Removed by relevancy pruning/SinE : 152
% 2.46/0.71 # Initial clauses : 684
% 2.46/0.71 # Removed in clause preprocessing : 0
% 2.46/0.71 # Initial clauses in saturation : 684
% 2.46/0.71 # Processed clauses : 3865
% 2.46/0.71 # ...of these trivial : 46
% 2.46/0.72 # ...subsumed : 1979
% 2.46/0.72 # ...remaining for further processing : 1839
% 2.46/0.72 # Other redundant clauses eliminated : 111
% 2.46/0.72 # Clauses deleted for lack of memory : 0
% 2.46/0.72 # Backward-subsumed : 32
% 2.46/0.72 # Backward-rewritten : 175
% 2.46/0.72 # Generated clauses : 12105
% 2.46/0.72 # ...of the previous two non-redundant : 10091
% 2.46/0.72 # ...aggressively subsumed : 0
% 2.46/0.72 # Contextual simplify-reflections : 7
% 2.46/0.72 # Paramodulations : 11987
% 2.46/0.72 # Factorizations : 0
% 2.46/0.72 # NegExts : 0
% 2.46/0.72 # Equation resolutions : 118
% 2.46/0.72 # Disequality decompositions : 0
% 2.46/0.72 # Total rewrite steps : 11404
% 2.46/0.72 # ...of those cached : 10619
% 2.46/0.72 # Propositional unsat checks : 0
% 2.46/0.72 # Propositional check models : 0
% 2.46/0.72 # Propositional check unsatisfiable : 0
% 2.46/0.72 # Propositional clauses : 0
% 2.46/0.72 # Propositional clauses after purity: 0
% 2.46/0.72 # Propositional unsat core size : 0
% 2.46/0.72 # Propositional preprocessing time : 0.000
% 2.46/0.72 # Propositional encoding time : 0.000
% 2.46/0.72 # Propositional solver time : 0.000
% 2.46/0.72 # Success case prop preproc time : 0.000
% 2.46/0.72 # Success case prop encoding time : 0.000
% 2.46/0.72 # Success case prop solver time : 0.000
% 2.46/0.72 # Current number of processed clauses : 1029
% 2.46/0.72 # Positive orientable unit clauses : 196
% 2.46/0.72 # Positive unorientable unit clauses: 2
% 2.46/0.72 # Negative unit clauses : 43
% 2.46/0.72 # Non-unit-clauses : 788
% 2.46/0.72 # Current number of unprocessed clauses: 7492
% 2.46/0.72 # ...number of literals in the above : 24121
% 2.46/0.72 # Current number of archived formulas : 0
% 2.46/0.72 # Current number of archived clauses : 810
% 2.46/0.72 # Clause-clause subsumption calls (NU) : 155808
% 2.46/0.72 # Rec. Clause-clause subsumption calls : 82462
% 2.46/0.72 # Non-unit clause-clause subsumptions : 1594
% 2.46/0.72 # Unit Clause-clause subsumption calls : 11374
% 2.46/0.72 # Rewrite failures with RHS unbound : 0
% 2.46/0.72 # BW rewrite match attempts : 510
% 2.46/0.72 # BW rewrite match successes : 60
% 2.46/0.72 # Condensation attempts : 0
% 2.46/0.72 # Condensation successes : 0
% 2.46/0.72 # Termbank termtop insertions : 233166
% 2.46/0.72 # Search garbage collected termcells : 1753
% 2.46/0.72
% 2.46/0.72 # -------------------------------------------------
% 2.46/0.72 # User time : 0.285 s
% 2.46/0.72 # System time : 0.014 s
% 2.46/0.72 # Total time : 0.299 s
% 2.46/0.72 # Maximum resident set size: 3344 pages
% 2.46/0.72
% 2.46/0.72 # -------------------------------------------------
% 2.46/0.72 # User time : 0.305 s
% 2.46/0.72 # System time : 0.015 s
% 2.46/0.72 # Total time : 0.320 s
% 2.46/0.72 # Maximum resident set size: 2280 pages
% 2.46/0.72 % E---3.1 exiting
%------------------------------------------------------------------------------