TSTP Solution File: ANA027-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : ANA027-1 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:38:34 EDT 2024
% Result : Unsatisfiable 22.98s 3.46s
% Output : CNFRefutation 22.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 16
% Syntax : Number of clauses : 59 ( 12 unt; 4 nHn; 52 RR)
% Number of literals : 133 ( 4 equ; 83 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 85 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_OrderedGroup_Oabs__of__nonneg_0,axiom,
( c_HOL_Oabs(X2,X1) = X2
| ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
| ~ c_lessequals(c_0,X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_OrderedGroup_Oabs__of__nonneg_0) ).
cnf(cls_OrderedGroup_Oabs__not__less__zero_0,axiom,
( ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
| ~ c_less(c_HOL_Oabs(X2,X1),c_0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_OrderedGroup_Oabs__not__less__zero_0) ).
cnf(cls_conjecture_1,negated_conjecture,
c_lessequals(c_0,c_minus(v_f(v_x),v_k(v_x),t_b),t_b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_Orderings_Oorder__class_Oorder__trans_0,axiom,
( c_lessequals(X4,X3,X1)
| ~ class_Orderings_Oorder(X1)
| ~ c_lessequals(X2,X3,X1)
| ~ c_lessequals(X4,X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Orderings_Oorder__class_Oorder__trans_0) ).
cnf(cls_OrderedGroup_Odiff__less__0__iff__less_1,axiom,
( c_less(c_minus(X2,X3,X1),c_0,X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ c_less(X2,X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_OrderedGroup_Odiff__less__0__iff__less_1) ).
cnf(clsrel_OrderedGroup_Olordered__ab__group__abs_1,axiom,
( class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ class_OrderedGroup_Olordered__ab__group__abs(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',clsrel_OrderedGroup_Olordered__ab__group__abs_1) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_33,axiom,
( class_Orderings_Olinorder(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',clsrel_Ring__and__Field_Oordered__idom_33) ).
cnf(cls_OrderedGroup_Odiff__less__0__iff__less_0,axiom,
( c_less(X2,X3,X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ c_less(c_minus(X2,X3,X1),c_0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_OrderedGroup_Odiff__less__0__iff__less_0) ).
cnf(cls_Orderings_Olinorder__not__le_0,axiom,
( c_less(X2,X3,X1)
| c_lessequals(X3,X2,X1)
| ~ class_Orderings_Olinorder(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Orderings_Olinorder__not__le_0) ).
cnf(cls_conjecture_2,negated_conjecture,
c_lessequals(v_g(v_x),v_k(v_x),t_b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(tfree_tcs,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',tfree_tcs) ).
cnf(cls_conjecture_3,negated_conjecture,
~ c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(clsrel_OrderedGroup_Olordered__ab__group__abs_17,axiom,
( class_Orderings_Oorder(X1)
| ~ class_OrderedGroup_Olordered__ab__group__abs(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',clsrel_OrderedGroup_Olordered__ab__group__abs_17) ).
cnf(cls_Orderings_Olinorder__not__le_1,axiom,
( ~ class_Orderings_Olinorder(X1)
| ~ c_less(X2,X3,X1)
| ~ c_lessequals(X3,X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Orderings_Olinorder__not__le_1) ).
cnf(cls_Orderings_Oorder__class_Oaxioms__1_0,axiom,
( c_lessequals(X2,X2,X1)
| ~ class_Orderings_Oorder(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Orderings_Oorder__class_Oaxioms__1_0) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_50,axiom,
( class_OrderedGroup_Olordered__ab__group__abs(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',clsrel_Ring__and__Field_Oordered__idom_50) ).
cnf(c_0_16,plain,
( c_HOL_Oabs(X2,X1) = X2
| ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
| ~ c_lessequals(c_0,X2,X1) ),
inference(fof_simplification,[status(thm)],[cls_OrderedGroup_Oabs__of__nonneg_0]) ).
cnf(c_0_17,plain,
( ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
| ~ c_less(c_HOL_Oabs(X2,X1),c_0,X1) ),
inference(fof_simplification,[status(thm)],[cls_OrderedGroup_Oabs__not__less__zero_0]) ).
cnf(c_0_18,plain,
( c_HOL_Oabs(X2,X1) = X2
| ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
| ~ c_lessequals(c_0,X2,X1) ),
c_0_16 ).
cnf(c_0_19,negated_conjecture,
c_lessequals(c_0,c_minus(v_f(v_x),v_k(v_x),t_b),t_b),
cls_conjecture_1 ).
cnf(c_0_20,plain,
( c_lessequals(X4,X3,X1)
| ~ class_Orderings_Oorder(X1)
| ~ c_lessequals(X2,X3,X1)
| ~ c_lessequals(X4,X2,X1) ),
inference(fof_simplification,[status(thm)],[cls_Orderings_Oorder__class_Oorder__trans_0]) ).
cnf(c_0_21,plain,
( ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
| ~ c_less(c_HOL_Oabs(X2,X1),c_0,X1) ),
c_0_17 ).
cnf(c_0_22,negated_conjecture,
( c_HOL_Oabs(c_minus(v_f(v_x),v_k(v_x),t_b),t_b) = c_minus(v_f(v_x),v_k(v_x),t_b)
| ~ class_OrderedGroup_Olordered__ab__group__abs(t_b) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( c_less(c_minus(X2,X3,X1),c_0,X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ c_less(X2,X3,X1) ),
inference(fof_simplification,[status(thm)],[cls_OrderedGroup_Odiff__less__0__iff__less_1]) ).
cnf(c_0_24,plain,
( class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ class_OrderedGroup_Olordered__ab__group__abs(X1) ),
inference(fof_simplification,[status(thm)],[clsrel_OrderedGroup_Olordered__ab__group__abs_1]) ).
cnf(c_0_25,plain,
( class_Orderings_Olinorder(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Oordered__idom_33]) ).
cnf(c_0_26,plain,
( c_less(X2,X3,X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ c_less(c_minus(X2,X3,X1),c_0,X1) ),
inference(fof_simplification,[status(thm)],[cls_OrderedGroup_Odiff__less__0__iff__less_0]) ).
cnf(c_0_27,plain,
( c_less(X2,X3,X1)
| c_lessequals(X3,X2,X1)
| ~ class_Orderings_Olinorder(X1) ),
inference(fof_simplification,[status(thm)],[cls_Orderings_Olinorder__not__le_0]) ).
cnf(c_0_28,plain,
( c_lessequals(X4,X3,X1)
| ~ class_Orderings_Oorder(X1)
| ~ c_lessequals(X2,X3,X1)
| ~ c_lessequals(X4,X2,X1) ),
c_0_20 ).
cnf(c_0_29,negated_conjecture,
c_lessequals(v_g(v_x),v_k(v_x),t_b),
cls_conjecture_2 ).
cnf(c_0_30,negated_conjecture,
( ~ class_OrderedGroup_Olordered__ab__group__abs(t_b)
| ~ c_less(c_minus(v_f(v_x),v_k(v_x),t_b),c_0,t_b) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_31,plain,
( c_less(c_minus(X2,X3,X1),c_0,X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ c_less(X2,X3,X1) ),
c_0_23 ).
cnf(c_0_32,plain,
( class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ class_OrderedGroup_Olordered__ab__group__abs(X1) ),
c_0_24 ).
cnf(c_0_33,plain,
( class_Orderings_Olinorder(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
c_0_25 ).
cnf(c_0_34,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
tfree_tcs ).
cnf(c_0_35,negated_conjecture,
~ c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b),
inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).
cnf(c_0_36,plain,
( c_less(X2,X3,X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ c_less(c_minus(X2,X3,X1),c_0,X1) ),
c_0_26 ).
cnf(c_0_37,plain,
( c_less(X2,X3,X1)
| c_lessequals(X3,X2,X1)
| ~ class_Orderings_Olinorder(X1) ),
c_0_27 ).
cnf(c_0_38,negated_conjecture,
( c_lessequals(v_g(v_x),X1,t_b)
| ~ class_Orderings_Oorder(t_b)
| ~ c_lessequals(v_k(v_x),X1,t_b) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_39,negated_conjecture,
( ~ class_OrderedGroup_Olordered__ab__group__abs(t_b)
| ~ c_less(v_f(v_x),v_k(v_x),t_b) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_40,negated_conjecture,
class_Orderings_Olinorder(t_b),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_41,plain,
( class_Orderings_Oorder(X1)
| ~ class_OrderedGroup_Olordered__ab__group__abs(X1) ),
inference(fof_simplification,[status(thm)],[clsrel_OrderedGroup_Olordered__ab__group__abs_17]) ).
cnf(c_0_42,plain,
( ~ class_Orderings_Olinorder(X1)
| ~ c_less(X2,X3,X1)
| ~ c_lessequals(X3,X2,X1) ),
inference(fof_simplification,[status(thm)],[cls_Orderings_Olinorder__not__le_1]) ).
cnf(c_0_43,negated_conjecture,
~ c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b),
c_0_35 ).
cnf(c_0_44,plain,
( c_less(X1,X2,X3)
| c_lessequals(c_0,c_minus(X1,X2,X3),X3)
| ~ class_OrderedGroup_Opordered__ab__group__add(X3)
| ~ class_Orderings_Olinorder(X3) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_45,negated_conjecture,
( c_lessequals(v_g(v_x),X1,t_b)
| ~ class_Orderings_Oorder(t_b)
| ~ c_lessequals(v_k(v_x),X2,t_b)
| ~ c_lessequals(X2,X1,t_b) ),
inference(spm,[status(thm)],[c_0_28,c_0_38]) ).
cnf(c_0_46,negated_conjecture,
( c_lessequals(v_k(v_x),v_f(v_x),t_b)
| ~ class_OrderedGroup_Olordered__ab__group__abs(t_b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_37]),c_0_40])]) ).
cnf(c_0_47,plain,
( class_Orderings_Oorder(X1)
| ~ class_OrderedGroup_Olordered__ab__group__abs(X1) ),
c_0_41 ).
cnf(c_0_48,plain,
( c_lessequals(X2,X2,X1)
| ~ class_Orderings_Oorder(X1) ),
inference(fof_simplification,[status(thm)],[cls_Orderings_Oorder__class_Oaxioms__1_0]) ).
cnf(c_0_49,plain,
( ~ class_Orderings_Olinorder(X1)
| ~ c_less(X2,X3,X1)
| ~ c_lessequals(X3,X2,X1) ),
c_0_42 ).
cnf(c_0_50,negated_conjecture,
( c_less(v_f(v_x),v_g(v_x),t_b)
| ~ class_OrderedGroup_Opordered__ab__group__add(t_b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_40])]) ).
cnf(c_0_51,negated_conjecture,
( c_lessequals(v_g(v_x),X1,t_b)
| ~ class_OrderedGroup_Olordered__ab__group__abs(t_b)
| ~ c_lessequals(v_f(v_x),X1,t_b) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]) ).
cnf(c_0_52,plain,
( c_lessequals(X2,X2,X1)
| ~ class_Orderings_Oorder(X1) ),
c_0_48 ).
cnf(c_0_53,negated_conjecture,
( ~ class_OrderedGroup_Opordered__ab__group__add(t_b)
| ~ c_lessequals(v_g(v_x),v_f(v_x),t_b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_40])]) ).
cnf(c_0_54,negated_conjecture,
( c_lessequals(v_g(v_x),v_f(v_x),t_b)
| ~ class_OrderedGroup_Olordered__ab__group__abs(t_b) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_47]) ).
cnf(c_0_55,plain,
( class_OrderedGroup_Olordered__ab__group__abs(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Oordered__idom_50]) ).
cnf(c_0_56,negated_conjecture,
~ class_OrderedGroup_Olordered__ab__group__abs(t_b),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_32]) ).
cnf(c_0_57,plain,
( class_OrderedGroup_Olordered__ab__group__abs(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
c_0_55 ).
cnf(c_0_58,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ANA027-1 : TPTP v8.2.0. Released v3.2.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n018.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 07:48:52 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.48 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
% 22.98/3.46 # Version: 3.1.0
% 22.98/3.46 # Preprocessing class: FMLMSMSMSSSNFFN.
% 22.98/3.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 22.98/3.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 22.98/3.46 # Starting new_bool_3 with 300s (1) cores
% 22.98/3.46 # Starting new_bool_1 with 300s (1) cores
% 22.98/3.46 # Starting sh5l with 300s (1) cores
% 22.98/3.46 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 31319 completed with status 0
% 22.98/3.46 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 22.98/3.46 # Preprocessing class: FMLMSMSMSSSNFFN.
% 22.98/3.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 22.98/3.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 22.98/3.46 # No SInE strategy applied
% 22.98/3.46 # Search class: FGHSM-SMLM32-DFFFFFNN
% 22.98/3.46 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 22.98/3.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 113s (1) cores
% 22.98/3.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 22.98/3.46 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 22.98/3.46 # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 22.98/3.46 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with 113s (1) cores
% 22.98/3.46 # G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 31328 completed with status 0
% 22.98/3.46 # Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 22.98/3.46 # Preprocessing class: FMLMSMSMSSSNFFN.
% 22.98/3.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 22.98/3.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 22.98/3.46 # No SInE strategy applied
% 22.98/3.46 # Search class: FGHSM-SMLM32-DFFFFFNN
% 22.98/3.46 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 22.98/3.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 113s (1) cores
% 22.98/3.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 22.98/3.46 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 22.98/3.46 # Preprocessing time : 0.027 s
% 22.98/3.46
% 22.98/3.46 # Proof found!
% 22.98/3.46 # SZS status Unsatisfiable
% 22.98/3.46 # SZS output start CNFRefutation
% See solution above
% 22.98/3.46 # Parsed axioms : 2809
% 22.98/3.46 # Removed by relevancy pruning/SinE : 0
% 22.98/3.46 # Initial clauses : 2809
% 22.98/3.46 # Removed in clause preprocessing : 9
% 22.98/3.46 # Initial clauses in saturation : 2800
% 22.98/3.46 # Processed clauses : 13733
% 22.98/3.46 # ...of these trivial : 202
% 22.98/3.46 # ...subsumed : 9330
% 22.98/3.46 # ...remaining for further processing : 4201
% 22.98/3.46 # Other redundant clauses eliminated : 512
% 22.98/3.46 # Clauses deleted for lack of memory : 0
% 22.98/3.46 # Backward-subsumed : 336
% 22.98/3.46 # Backward-rewritten : 88
% 22.98/3.46 # Generated clauses : 60935
% 22.98/3.46 # ...of the previous two non-redundant : 51744
% 22.98/3.46 # ...aggressively subsumed : 0
% 22.98/3.46 # Contextual simplify-reflections : 141
% 22.98/3.46 # Paramodulations : 60371
% 22.98/3.46 # Factorizations : 3
% 22.98/3.46 # NegExts : 0
% 22.98/3.46 # Equation resolutions : 561
% 22.98/3.46 # Disequality decompositions : 0
% 22.98/3.46 # Total rewrite steps : 35815
% 22.98/3.46 # ...of those cached : 33829
% 22.98/3.46 # Propositional unsat checks : 0
% 22.98/3.46 # Propositional check models : 0
% 22.98/3.46 # Propositional check unsatisfiable : 0
% 22.98/3.46 # Propositional clauses : 0
% 22.98/3.46 # Propositional clauses after purity: 0
% 22.98/3.46 # Propositional unsat core size : 0
% 22.98/3.46 # Propositional preprocessing time : 0.000
% 22.98/3.46 # Propositional encoding time : 0.000
% 22.98/3.46 # Propositional solver time : 0.000
% 22.98/3.46 # Success case prop preproc time : 0.000
% 22.98/3.46 # Success case prop encoding time : 0.000
% 22.98/3.46 # Success case prop solver time : 0.000
% 22.98/3.46 # Current number of processed clauses : 3777
% 22.98/3.46 # Positive orientable unit clauses : 679
% 22.98/3.46 # Positive unorientable unit clauses: 16
% 22.98/3.46 # Negative unit clauses : 245
% 22.98/3.46 # Non-unit-clauses : 2837
% 22.98/3.46 # Current number of unprocessed clauses: 40626
% 22.98/3.46 # ...number of literals in the above : 143888
% 22.98/3.46 # Current number of archived formulas : 0
% 22.98/3.46 # Current number of archived clauses : 432
% 22.98/3.46 # Clause-clause subsumption calls (NU) : 4958156
% 22.98/3.46 # Rec. Clause-clause subsumption calls : 2848609
% 22.98/3.46 # Non-unit clause-clause subsumptions : 4712
% 22.98/3.46 # Unit Clause-clause subsumption calls : 113040
% 22.98/3.46 # Rewrite failures with RHS unbound : 2
% 22.98/3.46 # BW rewrite match attempts : 1097
% 22.98/3.46 # BW rewrite match successes : 63
% 22.98/3.46 # Condensation attempts : 0
% 22.98/3.46 # Condensation successes : 0
% 22.98/3.46 # Termbank termtop insertions : 940055
% 22.98/3.46 # Search garbage collected termcells : 4116
% 22.98/3.46
% 22.98/3.46 # -------------------------------------------------
% 22.98/3.46 # User time : 2.799 s
% 22.98/3.46 # System time : 0.063 s
% 22.98/3.46 # Total time : 2.861 s
% 22.98/3.46 # Maximum resident set size: 6820 pages
% 22.98/3.46
% 22.98/3.46 # -------------------------------------------------
% 22.98/3.46 # User time : 13.771 s
% 22.98/3.46 # System time : 0.227 s
% 22.98/3.46 # Total time : 13.998 s
% 22.98/3.46 # Maximum resident set size: 3504 pages
% 22.98/3.46 % E---3.1 exiting
%------------------------------------------------------------------------------