TSTP Solution File: ANA029-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : ANA029-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 17:16:05 EDT 2023
% Result : Unsatisfiable 15.65s 2.92s
% Output : CNFRefutation 15.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 17
% Syntax : Number of clauses : 57 ( 9 unt; 4 nHn; 47 RR)
% Number of literals : 137 ( 12 equ; 83 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-3 aty)
% Number of variables : 96 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_OrderedGroup_Oneg__equal__iff__equal_0,axiom,
( X2 = X3
| ~ class_OrderedGroup_Oab__group__add(X1)
| c_uminus(X2,X1) != c_uminus(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.8BEkgGUqw9/E---3.1_15561.p',cls_OrderedGroup_Oneg__equal__iff__equal_0) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_4,axiom,
( class_OrderedGroup_Oab__group__add(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
file('/export/starexec/sandbox/tmp/tmp.8BEkgGUqw9/E---3.1_15561.p',clsrel_Ring__and__Field_Oordered__idom_4) ).
cnf(tfree_tcs,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
file('/export/starexec/sandbox/tmp/tmp.8BEkgGUqw9/E---3.1_15561.p',tfree_tcs) ).
cnf(cls_OrderedGroup_Ominus__minus_0,axiom,
( c_uminus(c_uminus(X2,X1),X1) = X2
| ~ class_OrderedGroup_Oab__group__add(X1) ),
file('/export/starexec/sandbox/tmp/tmp.8BEkgGUqw9/E---3.1_15561.p',cls_OrderedGroup_Ominus__minus_0) ).
cnf(cls_OrderedGroup_Oneg__0__le__iff__le_1,axiom,
( c_lessequals(c_0,c_uminus(X2,X1),X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ c_lessequals(X2,c_0,X1) ),
file('/export/starexec/sandbox/tmp/tmp.8BEkgGUqw9/E---3.1_15561.p',cls_OrderedGroup_Oneg__0__le__iff__le_1) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_54,axiom,
( class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
file('/export/starexec/sandbox/tmp/tmp.8BEkgGUqw9/E---3.1_15561.p',clsrel_Ring__and__Field_Oordered__idom_54) ).
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/tmp/tmp.8BEkgGUqw9/E---3.1_15561.p',cls_Orderings_Oorder__class_Oorder__trans_0) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_44,axiom,
( class_Orderings_Oorder(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
file('/export/starexec/sandbox/tmp/tmp.8BEkgGUqw9/E---3.1_15561.p',clsrel_Ring__and__Field_Oordered__idom_44) ).
cnf(cls_OrderedGroup_Oneg__le__0__iff__le_1,axiom,
( c_lessequals(c_uminus(X2,X1),c_0,X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ c_lessequals(c_0,X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.8BEkgGUqw9/E---3.1_15561.p',cls_OrderedGroup_Oneg__le__0__iff__le_1) ).
cnf(cls_Orderings_Oorder__less__imp__le_0,axiom,
( c_lessequals(X2,X3,X1)
| ~ class_Orderings_Oorder(X1)
| ~ c_less(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.8BEkgGUqw9/E---3.1_15561.p',cls_Orderings_Oorder__less__imp__le_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/tmp/tmp.8BEkgGUqw9/E---3.1_15561.p',cls_Orderings_Olinorder__not__le_0) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_33,axiom,
( class_Orderings_Olinorder(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
file('/export/starexec/sandbox/tmp/tmp.8BEkgGUqw9/E---3.1_15561.p',clsrel_Ring__and__Field_Oordered__idom_33) ).
cnf(cls_OrderedGroup_Oabs__ge__zero_0,axiom,
( c_lessequals(c_0,c_HOL_Oabs(X2,X1),X1)
| ~ class_OrderedGroup_Olordered__ab__group__abs(X1) ),
file('/export/starexec/sandbox/tmp/tmp.8BEkgGUqw9/E---3.1_15561.p',cls_OrderedGroup_Oabs__ge__zero_0) ).
cnf(cls_conjecture_3,negated_conjecture,
~ c_lessequals(c_Orderings_Omax(c_minus(v_f(v_x),v_k(v_x),t_b),c_0,t_b),c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b),
file('/export/starexec/sandbox/tmp/tmp.8BEkgGUqw9/E---3.1_15561.p',cls_conjecture_3) ).
cnf(cls_Orderings_Omin__max_Obelow__sup_Oabove__sup__conv_2,axiom,
( c_lessequals(c_Orderings_Omax(X4,X2,X1),X3,X1)
| ~ class_Orderings_Olinorder(X1)
| ~ c_lessequals(X2,X3,X1)
| ~ c_lessequals(X4,X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.8BEkgGUqw9/E---3.1_15561.p',cls_Orderings_Omin__max_Obelow__sup_Oabove__sup__conv_2) ).
cnf(cls_conjecture_2,negated_conjecture,
~ c_lessequals(c_0,c_minus(v_f(v_x),v_k(v_x),t_b),t_b),
file('/export/starexec/sandbox/tmp/tmp.8BEkgGUqw9/E---3.1_15561.p',cls_conjecture_2) ).
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/tmp/tmp.8BEkgGUqw9/E---3.1_15561.p',clsrel_Ring__and__Field_Oordered__idom_50) ).
cnf(c_0_17,axiom,
( X2 = X3
| ~ class_OrderedGroup_Oab__group__add(X1)
| c_uminus(X2,X1) != c_uminus(X3,X1) ),
cls_OrderedGroup_Oneg__equal__iff__equal_0 ).
cnf(c_0_18,axiom,
( class_OrderedGroup_Oab__group__add(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
clsrel_Ring__and__Field_Oordered__idom_4 ).
cnf(c_0_19,plain,
( X1 = X2
| c_uminus(X1,X3) != c_uminus(X2,X3)
| ~ class_Ring__and__Field_Oordered__idom(X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
tfree_tcs ).
cnf(c_0_21,axiom,
( c_uminus(c_uminus(X2,X1),X1) = X2
| ~ class_OrderedGroup_Oab__group__add(X1) ),
cls_OrderedGroup_Ominus__minus_0 ).
cnf(c_0_22,axiom,
( c_lessequals(c_0,c_uminus(X2,X1),X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ c_lessequals(X2,c_0,X1) ),
cls_OrderedGroup_Oneg__0__le__iff__le_1 ).
cnf(c_0_23,axiom,
( class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
clsrel_Ring__and__Field_Oordered__idom_54 ).
cnf(c_0_24,negated_conjecture,
( X1 = X2
| c_uminus(X1,t_b) != c_uminus(X2,t_b) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( c_uminus(c_uminus(X1,X2),X2) = X1
| ~ class_Ring__and__Field_Oordered__idom(X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_18]) ).
cnf(c_0_26,plain,
( c_lessequals(c_0,c_uminus(X1,X2),X2)
| ~ class_Ring__and__Field_Oordered__idom(X2)
| ~ c_lessequals(X1,c_0,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
c_uminus(c_uminus(X1,t_b),t_b) = X1,
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_20])])]) ).
cnf(c_0_28,negated_conjecture,
( c_lessequals(c_0,X1,t_b)
| ~ c_lessequals(c_uminus(X1,t_b),c_0,t_b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_20])]) ).
cnf(c_0_29,axiom,
( c_lessequals(X4,X3,X1)
| ~ class_Orderings_Oorder(X1)
| ~ c_lessequals(X2,X3,X1)
| ~ c_lessequals(X4,X2,X1) ),
cls_Orderings_Oorder__class_Oorder__trans_0 ).
cnf(c_0_30,negated_conjecture,
( c_lessequals(c_0,c_uminus(X1,t_b),t_b)
| ~ c_lessequals(X1,c_0,t_b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_25]),c_0_20])]) ).
cnf(c_0_31,negated_conjecture,
( c_lessequals(c_0,X1,t_b)
| ~ class_Orderings_Oorder(t_b)
| ~ c_lessequals(c_uminus(X2,t_b),X1,t_b)
| ~ c_lessequals(X2,c_0,t_b) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,axiom,
( class_Orderings_Oorder(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
clsrel_Ring__and__Field_Oordered__idom_44 ).
cnf(c_0_33,negated_conjecture,
( c_lessequals(c_0,X1,t_b)
| ~ c_lessequals(c_uminus(X2,t_b),X1,t_b)
| ~ c_lessequals(X2,c_0,t_b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_20])]) ).
cnf(c_0_34,axiom,
( c_lessequals(c_uminus(X2,X1),c_0,X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ c_lessequals(c_0,X2,X1) ),
cls_OrderedGroup_Oneg__le__0__iff__le_1 ).
cnf(c_0_35,negated_conjecture,
( c_lessequals(c_0,X1,t_b)
| ~ c_lessequals(c_uminus(X2,t_b),c_0,t_b)
| ~ c_lessequals(X2,X1,t_b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_25]),c_0_20])]) ).
cnf(c_0_36,plain,
( c_lessequals(c_uminus(X1,X2),c_0,X2)
| ~ class_Ring__and__Field_Oordered__idom(X2)
| ~ c_lessequals(c_0,X1,X2) ),
inference(spm,[status(thm)],[c_0_34,c_0_23]) ).
cnf(c_0_37,axiom,
( c_lessequals(X2,X3,X1)
| ~ class_Orderings_Oorder(X1)
| ~ c_less(X2,X3,X1) ),
cls_Orderings_Oorder__less__imp__le_0 ).
cnf(c_0_38,axiom,
( c_less(X2,X3,X1)
| c_lessequals(X3,X2,X1)
| ~ class_Orderings_Olinorder(X1) ),
cls_Orderings_Olinorder__not__le_0 ).
cnf(c_0_39,axiom,
( class_Orderings_Olinorder(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
clsrel_Ring__and__Field_Oordered__idom_33 ).
cnf(c_0_40,negated_conjecture,
( c_lessequals(c_0,X1,t_b)
| ~ c_lessequals(c_0,X2,t_b)
| ~ c_lessequals(X2,X1,t_b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_20])]) ).
cnf(c_0_41,axiom,
( c_lessequals(c_0,c_HOL_Oabs(X2,X1),X1)
| ~ class_OrderedGroup_Olordered__ab__group__abs(X1) ),
cls_OrderedGroup_Oabs__ge__zero_0 ).
cnf(c_0_42,plain,
( c_lessequals(X1,X2,X3)
| ~ class_Ring__and__Field_Oordered__idom(X3)
| ~ c_less(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_37,c_0_32]) ).
cnf(c_0_43,negated_conjecture,
~ c_lessequals(c_Orderings_Omax(c_minus(v_f(v_x),v_k(v_x),t_b),c_0,t_b),c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b),
cls_conjecture_3 ).
cnf(c_0_44,axiom,
( c_lessequals(c_Orderings_Omax(X4,X2,X1),X3,X1)
| ~ class_Orderings_Olinorder(X1)
| ~ c_lessequals(X2,X3,X1)
| ~ c_lessequals(X4,X3,X1) ),
cls_Orderings_Omin__max_Obelow__sup_Oabove__sup__conv_2 ).
cnf(c_0_45,plain,
( c_less(X1,X2,X3)
| c_lessequals(X2,X1,X3)
| ~ class_Ring__and__Field_Oordered__idom(X3) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_46,negated_conjecture,
( c_lessequals(c_0,X1,t_b)
| ~ class_OrderedGroup_Olordered__ab__group__abs(t_b)
| ~ c_lessequals(c_HOL_Oabs(X2,t_b),X1,t_b) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,negated_conjecture,
( c_lessequals(X1,X2,t_b)
| ~ c_less(X1,X2,t_b) ),
inference(spm,[status(thm)],[c_0_42,c_0_20]) ).
cnf(c_0_48,negated_conjecture,
( ~ class_Orderings_Olinorder(t_b)
| ~ c_lessequals(c_minus(v_f(v_x),v_k(v_x),t_b),c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b)
| ~ c_lessequals(c_0,c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,negated_conjecture,
( c_less(X1,X2,t_b)
| c_lessequals(X2,X1,t_b) ),
inference(spm,[status(thm)],[c_0_45,c_0_20]) ).
cnf(c_0_50,negated_conjecture,
( c_lessequals(c_0,X1,t_b)
| ~ class_OrderedGroup_Olordered__ab__group__abs(t_b)
| ~ c_less(c_HOL_Oabs(X2,t_b),X1,t_b) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,negated_conjecture,
( c_less(c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),c_minus(v_f(v_x),v_k(v_x),t_b),t_b)
| ~ class_Orderings_Olinorder(t_b)
| ~ c_lessequals(c_0,c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_52,negated_conjecture,
~ c_lessequals(c_0,c_minus(v_f(v_x),v_k(v_x),t_b),t_b),
cls_conjecture_2 ).
cnf(c_0_53,negated_conjecture,
( ~ class_OrderedGroup_Olordered__ab__group__abs(t_b)
| ~ class_Orderings_Olinorder(t_b) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]),c_0_41]) ).
cnf(c_0_54,axiom,
( class_OrderedGroup_Olordered__ab__group__abs(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
clsrel_Ring__and__Field_Oordered__idom_50 ).
cnf(c_0_55,negated_conjecture,
~ class_Orderings_Olinorder(t_b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_20])]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_39]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.32 % Problem : ANA029-1 : TPTP v8.1.2. Released v3.2.0.
% 0.12/0.33 % Command : run_E %s %d THM
% 0.36/0.53 % Computer : n019.cluster.edu
% 0.36/0.53 % Model : x86_64 x86_64
% 0.36/0.53 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.36/0.53 % Memory : 8042.1875MB
% 0.36/0.53 % OS : Linux 3.10.0-693.el7.x86_64
% 0.36/0.53 % CPULimit : 2400
% 0.36/0.53 % WCLimit : 300
% 0.36/0.53 % DateTime : Mon Oct 2 15:08:51 EDT 2023
% 0.36/0.54 % CPUTime :
% 0.40/0.93 Running first-order theorem proving
% 0.40/0.93 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.8BEkgGUqw9/E---3.1_15561.p
% 15.65/2.92 # Version: 3.1pre001
% 15.65/2.92 # Preprocessing class: FMLMSMSMSSSNFFN.
% 15.65/2.92 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.65/2.92 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 15.65/2.92 # Starting new_bool_3 with 300s (1) cores
% 15.65/2.92 # Starting new_bool_1 with 300s (1) cores
% 15.65/2.92 # Starting sh5l with 300s (1) cores
% 15.65/2.92 # sh5l with pid 15642 completed with status 0
% 15.65/2.92 # Result found by sh5l
% 15.65/2.92 # Preprocessing class: FMLMSMSMSSSNFFN.
% 15.65/2.92 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.65/2.92 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 15.65/2.92 # Starting new_bool_3 with 300s (1) cores
% 15.65/2.92 # Starting new_bool_1 with 300s (1) cores
% 15.65/2.92 # Starting sh5l with 300s (1) cores
% 15.65/2.92 # SinE strategy is gf500_gu_R04_F100_L20000
% 15.65/2.92 # Search class: FGHSM-SMLM32-DFFFFFNN
% 15.65/2.92 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 15.65/2.92 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 23s (1) cores
% 15.65/2.92 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with pid 15645 completed with status 0
% 15.65/2.92 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y
% 15.65/2.92 # Preprocessing class: FMLMSMSMSSSNFFN.
% 15.65/2.92 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.65/2.92 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 15.65/2.92 # Starting new_bool_3 with 300s (1) cores
% 15.65/2.92 # Starting new_bool_1 with 300s (1) cores
% 15.65/2.92 # Starting sh5l with 300s (1) cores
% 15.65/2.92 # SinE strategy is gf500_gu_R04_F100_L20000
% 15.65/2.92 # Search class: FGHSM-SMLM32-DFFFFFNN
% 15.65/2.92 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 15.65/2.92 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 23s (1) cores
% 15.65/2.92 # Preprocessing time : 0.022 s
% 15.65/2.92 # Presaturation interreduction done
% 15.65/2.92
% 15.65/2.92 # Proof found!
% 15.65/2.92 # SZS status Unsatisfiable
% 15.65/2.92 # SZS output start CNFRefutation
% See solution above
% 15.65/2.92 # Parsed axioms : 2809
% 15.65/2.92 # Removed by relevancy pruning/SinE : 265
% 15.65/2.92 # Initial clauses : 2544
% 15.65/2.92 # Removed in clause preprocessing : 1
% 15.65/2.92 # Initial clauses in saturation : 2543
% 15.65/2.92 # Processed clauses : 18782
% 15.65/2.92 # ...of these trivial : 115
% 15.65/2.92 # ...subsumed : 11576
% 15.65/2.92 # ...remaining for further processing : 7091
% 15.65/2.92 # Other redundant clauses eliminated : 415
% 15.65/2.92 # Clauses deleted for lack of memory : 0
% 15.65/2.92 # Backward-subsumed : 290
% 15.65/2.92 # Backward-rewritten : 290
% 15.65/2.92 # Generated clauses : 57830
% 15.65/2.92 # ...of the previous two non-redundant : 50413
% 15.65/2.92 # ...aggressively subsumed : 0
% 15.65/2.92 # Contextual simplify-reflections : 85
% 15.65/2.92 # Paramodulations : 57369
% 15.65/2.92 # Factorizations : 5
% 15.65/2.92 # NegExts : 0
% 15.65/2.92 # Equation resolutions : 456
% 15.65/2.92 # Total rewrite steps : 29054
% 15.65/2.92 # Propositional unsat checks : 1
% 15.65/2.92 # Propositional check models : 1
% 15.65/2.92 # Propositional check unsatisfiable : 0
% 15.65/2.92 # Propositional clauses : 0
% 15.65/2.92 # Propositional clauses after purity: 0
% 15.65/2.92 # Propositional unsat core size : 0
% 15.65/2.92 # Propositional preprocessing time : 0.000
% 15.65/2.92 # Propositional encoding time : 0.023
% 15.65/2.92 # Propositional solver time : 0.017
% 15.65/2.92 # Success case prop preproc time : 0.000
% 15.65/2.92 # Success case prop encoding time : 0.000
% 15.65/2.92 # Success case prop solver time : 0.000
% 15.65/2.92 # Current number of processed clauses : 4075
% 15.65/2.92 # Positive orientable unit clauses : 585
% 15.65/2.92 # Positive unorientable unit clauses: 8
% 15.65/2.92 # Negative unit clauses : 282
% 15.65/2.92 # Non-unit-clauses : 3200
% 15.65/2.92 # Current number of unprocessed clauses: 35090
% 15.65/2.92 # ...number of literals in the above : 123145
% 15.65/2.92 # Current number of archived formulas : 0
% 15.65/2.92 # Current number of archived clauses : 3016
% 15.65/2.92 # Clause-clause subsumption calls (NU) : 8282378
% 15.65/2.92 # Rec. Clause-clause subsumption calls : 4518782
% 15.65/2.92 # Non-unit clause-clause subsumptions : 6743
% 15.65/2.92 # Unit Clause-clause subsumption calls : 84132
% 15.65/2.92 # Rewrite failures with RHS unbound : 0
% 15.65/2.92 # BW rewrite match attempts : 1636
% 15.65/2.92 # BW rewrite match successes : 126
% 15.65/2.92 # Condensation attempts : 0
% 15.65/2.92 # Condensation successes : 0
% 15.65/2.92 # Termbank termtop insertions : 1021080
% 15.65/2.92
% 15.65/2.92 # -------------------------------------------------
% 15.65/2.92 # User time : 1.860 s
% 15.65/2.92 # System time : 0.046 s
% 15.65/2.92 # Total time : 1.906 s
% 15.65/2.92 # Maximum resident set size: 6708 pages
% 15.65/2.92
% 15.65/2.92 # -------------------------------------------------
% 15.65/2.92 # User time : 1.894 s
% 15.65/2.92 # System time : 0.047 s
% 15.65/2.92 # Total time : 1.940 s
% 15.65/2.92 # Maximum resident set size: 3524 pages
% 15.65/2.92 % E---3.1 exiting
% 15.65/2.92 % E---3.1 exiting
%------------------------------------------------------------------------------