TSTP Solution File: TOP051-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : TOP051-1 : TPTP v8.1.2. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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 : Sat May 4 10:40:43 EDT 2024
% Result : Unsatisfiable 0.20s 0.55s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 14
% Syntax : Number of clauses : 86 ( 86 unt; 0 nHn; 72 RR)
% Number of literals : 86 ( 85 equ; 7 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 11 con; 0-10 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(involutory_quandle_02,axiom,
product(product(X1,X2),X3) = product(product(X1,X3),product(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.rDtDVtGe8a/E---3.1_14090.p',involutory_quandle_02) ).
cnf(involutory_quandle,axiom,
product(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.rDtDVtGe8a/E---3.1_14090.p',involutory_quandle) ).
cnf(involutory_quandle_01,axiom,
product(product(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/tmp/tmp.rDtDVtGe8a/E---3.1_14090.p',involutory_quandle_01) ).
cnf(knot_07,axiom,
product(a6,a2) = a7,
file('/export/starexec/sandbox2/tmp/tmp.rDtDVtGe8a/E---3.1_14090.p',knot_07) ).
cnf(knot,axiom,
product(a1,a6) = a2,
file('/export/starexec/sandbox2/tmp/tmp.rDtDVtGe8a/E---3.1_14090.p',knot) ).
cnf(knot_03,axiom,
product(a2,a7) = a3,
file('/export/starexec/sandbox2/tmp/tmp.rDtDVtGe8a/E---3.1_14090.p',knot_03) ).
cnf(knot_08,axiom,
product(a7,a3) = a8,
file('/export/starexec/sandbox2/tmp/tmp.rDtDVtGe8a/E---3.1_14090.p',knot_08) ).
cnf(knot_10,axiom,
product(a9,a4) = a10,
file('/export/starexec/sandbox2/tmp/tmp.rDtDVtGe8a/E---3.1_14090.p',knot_10) ).
cnf(knot_05,axiom,
product(a4,a10) = a5,
file('/export/starexec/sandbox2/tmp/tmp.rDtDVtGe8a/E---3.1_14090.p',knot_05) ).
cnf(knot_09,axiom,
product(a8,a6) = a9,
file('/export/starexec/sandbox2/tmp/tmp.rDtDVtGe8a/E---3.1_14090.p',knot_09) ).
cnf(knot_04,axiom,
product(a3,a1) = a4,
file('/export/starexec/sandbox2/tmp/tmp.rDtDVtGe8a/E---3.1_14090.p',knot_04) ).
cnf(knot_06,axiom,
product(a5,a9) = a6,
file('/export/starexec/sandbox2/tmp/tmp.rDtDVtGe8a/E---3.1_14090.p',knot_06) ).
cnf(knot_11,axiom,
product(a10,a5) = a11,
file('/export/starexec/sandbox2/tmp/tmp.rDtDVtGe8a/E---3.1_14090.p',knot_11) ).
cnf(goal,negated_conjecture,
tuple(a1,a6,a5,a2,a7,a3,a4,a9,a10,a8) != tuple(a2,a7,a6,a3,a8,a4,a5,a10,a11,a9),
file('/export/starexec/sandbox2/tmp/tmp.rDtDVtGe8a/E---3.1_14090.p',goal) ).
cnf(c_0_14,axiom,
product(product(X1,X2),X3) = product(product(X1,X3),product(X2,X3)),
involutory_quandle_02 ).
cnf(c_0_15,axiom,
product(X1,X1) = X1,
involutory_quandle ).
cnf(c_0_16,axiom,
product(product(X1,X2),X2) = X1,
involutory_quandle_01 ).
cnf(c_0_17,axiom,
product(a6,a2) = a7,
knot_07 ).
cnf(c_0_18,axiom,
product(a1,a6) = a2,
knot ).
cnf(c_0_19,axiom,
product(a2,a7) = a3,
knot_03 ).
cnf(c_0_20,plain,
product(product(X1,X2),X1) = product(X1,product(X2,X1)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
product(a7,a2) = a6,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
product(a2,a6) = a1,
inference(spm,[status(thm)],[c_0_16,c_0_18]) ).
cnf(c_0_23,plain,
product(a3,a7) = a2,
inference(spm,[status(thm)],[c_0_16,c_0_19]) ).
cnf(c_0_24,axiom,
product(a7,a3) = a8,
knot_08 ).
cnf(c_0_25,plain,
product(product(X1,a7),a3) = product(product(X1,a2),a7),
inference(spm,[status(thm)],[c_0_14,c_0_19]) ).
cnf(c_0_26,plain,
product(a3,a2) = a1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_19]),c_0_21]),c_0_22]) ).
cnf(c_0_27,plain,
product(a3,a8) = product(a2,a3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_23]),c_0_24]) ).
cnf(c_0_28,plain,
product(product(X1,a2),a7) = product(product(X1,a6),a2),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_29,plain,
product(a1,a7) = product(a2,a3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_25]),c_0_26]),c_0_24]),c_0_27]) ).
cnf(c_0_30,axiom,
product(a9,a4) = a10,
knot_10 ).
cnf(c_0_31,plain,
product(product(a3,a6),a2) = product(a2,a3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_26]),c_0_29]) ).
cnf(c_0_32,axiom,
product(a4,a10) = a5,
knot_05 ).
cnf(c_0_33,plain,
product(a10,a4) = a9,
inference(spm,[status(thm)],[c_0_16,c_0_30]) ).
cnf(c_0_34,axiom,
product(a8,a6) = a9,
knot_09 ).
cnf(c_0_35,plain,
product(product(X1,a1),a6) = product(product(X1,a6),a2),
inference(spm,[status(thm)],[c_0_14,c_0_18]) ).
cnf(c_0_36,axiom,
product(a3,a1) = a4,
knot_04 ).
cnf(c_0_37,plain,
product(a3,a6) = product(a2,a1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_31]),c_0_20]),c_0_26]) ).
cnf(c_0_38,plain,
product(a1,a2) = a3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_22]),c_0_17]),c_0_19]) ).
cnf(c_0_39,plain,
product(product(X1,a9),a4) = product(product(X1,a4),a10),
inference(spm,[status(thm)],[c_0_14,c_0_30]) ).
cnf(c_0_40,axiom,
product(a5,a9) = a6,
knot_06 ).
cnf(c_0_41,plain,
product(a5,a4) = product(a4,a9),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_32]),c_0_33]) ).
cnf(c_0_42,plain,
product(a5,a10) = a4,
inference(spm,[status(thm)],[c_0_16,c_0_32]) ).
cnf(c_0_43,axiom,
product(a10,a5) = a11,
knot_11 ).
cnf(c_0_44,plain,
product(product(X1,a8),a6) = product(product(X1,a6),a9),
inference(spm,[status(thm)],[c_0_14,c_0_34]) ).
cnf(c_0_45,plain,
product(a4,a6) = product(a2,a3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_20]),c_0_38]) ).
cnf(c_0_46,plain,
product(product(X1,a10),a5) = product(product(X1,a4),a10),
inference(spm,[status(thm)],[c_0_14,c_0_32]) ).
cnf(c_0_47,plain,
product(product(a4,a9),a10) = product(a6,a4),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_48,plain,
product(a5,a11) = product(a4,a5),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_42]),c_0_43]) ).
cnf(c_0_49,plain,
product(product(a2,a1),a9) = product(product(a2,a3),a6),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_27]),c_0_37]) ).
cnf(c_0_50,plain,
product(product(a2,a3),a6) = a4,
inference(spm,[status(thm)],[c_0_16,c_0_45]) ).
cnf(c_0_51,plain,
product(a4,a5) = product(a6,a4),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_46]),c_0_41]),c_0_47]),c_0_43]),c_0_48]) ).
cnf(c_0_52,plain,
product(product(a2,a1),a9) = a4,
inference(rw,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_53,plain,
product(a1,product(a2,a1)) = a4,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_38]),c_0_36]) ).
cnf(c_0_54,plain,
product(a4,product(a4,a9)) = a6,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_51]),c_0_16]),c_0_41]) ).
cnf(c_0_55,plain,
product(a4,a9) = product(a2,a1),
inference(spm,[status(thm)],[c_0_16,c_0_52]) ).
cnf(c_0_56,plain,
product(a4,product(a2,a1)) = a1,
inference(spm,[status(thm)],[c_0_16,c_0_53]) ).
cnf(c_0_57,plain,
product(a8,a3) = a7,
inference(spm,[status(thm)],[c_0_16,c_0_24]) ).
cnf(c_0_58,negated_conjecture,
tuple(a1,a6,a5,a2,a7,a3,a4,a9,a10,a8) != tuple(a2,a7,a6,a3,a8,a4,a5,a10,a11,a9),
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_59,plain,
a1 = a6,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).
cnf(c_0_60,plain,
product(a6,a7) = a8,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_19]),c_0_24]) ).
cnf(c_0_61,plain,
product(a7,a6) = product(a6,a1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_17]),c_0_22]) ).
cnf(c_0_62,plain,
product(product(X1,a3),a8) = product(product(X1,a7),a3),
inference(spm,[status(thm)],[c_0_14,c_0_24]) ).
cnf(c_0_63,plain,
product(a8,a7) = a6,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_24]),c_0_23]),c_0_21]) ).
cnf(c_0_64,plain,
product(a8,product(a2,a3)) = product(a7,a8),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_57]),c_0_27]) ).
cnf(c_0_65,negated_conjecture,
tuple(a1,a6,a5,a2,a7,a3,a4,a9,a10,a8) != tuple(a2,a7,a6,a3,a8,a4,a5,a10,a11,a9),
c_0_58 ).
cnf(c_0_66,plain,
a2 = a6,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_59]),c_0_15]) ).
cnf(c_0_67,plain,
a3 = a7,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_59]),c_0_17]) ).
cnf(c_0_68,plain,
a4 = a6,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_59]),c_0_59]),c_0_22]),c_0_59]),c_0_15]) ).
cnf(c_0_69,plain,
product(a6,product(a6,a1)) = a9,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_60]),c_0_34]),c_0_61]) ).
cnf(c_0_70,plain,
product(a7,a8) = product(a6,a3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_62]),c_0_63]),c_0_27]),c_0_64]) ).
cnf(c_0_71,plain,
product(a9,a6) = a8,
inference(spm,[status(thm)],[c_0_16,c_0_34]) ).
cnf(c_0_72,negated_conjecture,
tuple(a6,a7,a6,a7,a8,a6,a5,a10,a11,a9) != tuple(a6,a6,a5,a6,a7,a7,a6,a9,a10,a8),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_59]),c_0_66]),c_0_67]),c_0_68]),c_0_66]),c_0_67]),c_0_68]) ).
cnf(c_0_73,plain,
a9 = a6,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_59]),c_0_15]),c_0_15]) ).
cnf(c_0_74,plain,
product(a6,a9) = a5,
inference(spm,[status(thm)],[c_0_16,c_0_40]) ).
cnf(c_0_75,plain,
product(a8,product(a2,a3)) = product(a6,a3),
inference(rw,[status(thm)],[c_0_64,c_0_70]) ).
cnf(c_0_76,plain,
a8 = a10,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_68]),c_0_71]) ).
cnf(c_0_77,negated_conjecture,
tuple(a6,a7,a6,a7,a8,a6,a5,a10,a11,a6) != tuple(a6,a6,a5,a6,a7,a7,a6,a6,a10,a8),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73]),c_0_73]) ).
cnf(c_0_78,plain,
a5 = a6,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_59]),c_0_22]),c_0_59]),c_0_74]),c_0_68]) ).
cnf(c_0_79,plain,
a10 = a6,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_67]),c_0_19]),c_0_67]),c_0_63]),c_0_67]),c_0_60]),c_0_76]) ).
cnf(c_0_80,negated_conjecture,
tuple(a6,a7,a6,a7,a8,a6,a6,a10,a11,a6) != tuple(a6,a6,a6,a6,a7,a7,a6,a6,a10,a8),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_78]),c_0_78]) ).
cnf(c_0_81,plain,
a7 = a6,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_67]),c_0_70]),c_0_67]),c_0_60]),c_0_67]),c_0_19]),c_0_67]),c_0_76]),c_0_79]) ).
cnf(c_0_82,plain,
product(a9,a10) = a11,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_33]),c_0_32]),c_0_43]) ).
cnf(c_0_83,negated_conjecture,
tuple(a6,a6,a6,a6,a6,a6,a6,a6,a11,a6) != tuple(a6,a6,a6,a6,a6,a6,a6,a6,a6,a6),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_76]),c_0_76]),c_0_81]),c_0_81]),c_0_79]),c_0_79]),c_0_81]),c_0_81]),c_0_79]),c_0_79]) ).
cnf(c_0_84,plain,
a11 = a6,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_73]),c_0_79]),c_0_15]) ).
cnf(c_0_85,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_84])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : TOP051-1 : TPTP v8.1.2. Released v8.1.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n014.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 11:08:46 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.51 Running first-order theorem proving
% 0.20/0.51 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.rDtDVtGe8a/E---3.1_14090.p
% 0.20/0.55 # Version: 3.1.0
% 0.20/0.55 # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.20/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.20/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.55 # Starting sh5l with 300s (1) cores
% 0.20/0.55 # new_bool_3 with pid 14208 completed with status 0
% 0.20/0.55 # Result found by new_bool_3
% 0.20/0.55 # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.20/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.20/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.55 # Search class: FUUPS-FFSM33-SFFFFFNN
% 0.20/0.55 # partial match(1): FUUPS-FFSF33-SFFFFFNN
% 0.20/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.55 # SAT001_MinMin_p005000_rr_RG with pid 14213 completed with status 0
% 0.20/0.55 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.55 # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.20/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.20/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.55 # Search class: FUUPS-FFSM33-SFFFFFNN
% 0.20/0.55 # partial match(1): FUUPS-FFSF33-SFFFFFNN
% 0.20/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.55 # Preprocessing time : 0.001 s
% 0.20/0.55 # Presaturation interreduction done
% 0.20/0.55
% 0.20/0.55 # Proof found!
% 0.20/0.55 # SZS status Unsatisfiable
% 0.20/0.55 # SZS output start CNFRefutation
% See solution above
% 0.20/0.55 # Parsed axioms : 14
% 0.20/0.55 # Removed by relevancy pruning/SinE : 0
% 0.20/0.55 # Initial clauses : 14
% 0.20/0.55 # Removed in clause preprocessing : 0
% 0.20/0.55 # Initial clauses in saturation : 14
% 0.20/0.55 # Processed clauses : 209
% 0.20/0.55 # ...of these trivial : 51
% 0.20/0.55 # ...subsumed : 0
% 0.20/0.55 # ...remaining for further processing : 158
% 0.20/0.55 # Other redundant clauses eliminated : 0
% 0.20/0.55 # Clauses deleted for lack of memory : 0
% 0.20/0.55 # Backward-subsumed : 0
% 0.20/0.55 # Backward-rewritten : 128
% 0.20/0.55 # Generated clauses : 1366
% 0.20/0.55 # ...of the previous two non-redundant : 1296
% 0.20/0.55 # ...aggressively subsumed : 0
% 0.20/0.55 # Contextual simplify-reflections : 0
% 0.20/0.55 # Paramodulations : 1366
% 0.20/0.55 # Factorizations : 0
% 0.20/0.55 # NegExts : 0
% 0.20/0.55 # Equation resolutions : 0
% 0.20/0.55 # Disequality decompositions : 0
% 0.20/0.55 # Total rewrite steps : 1406
% 0.20/0.55 # ...of those cached : 1077
% 0.20/0.55 # Propositional unsat checks : 0
% 0.20/0.55 # Propositional check models : 0
% 0.20/0.55 # Propositional check unsatisfiable : 0
% 0.20/0.55 # Propositional clauses : 0
% 0.20/0.55 # Propositional clauses after purity: 0
% 0.20/0.55 # Propositional unsat core size : 0
% 0.20/0.55 # Propositional preprocessing time : 0.000
% 0.20/0.55 # Propositional encoding time : 0.000
% 0.20/0.55 # Propositional solver time : 0.000
% 0.20/0.55 # Success case prop preproc time : 0.000
% 0.20/0.55 # Success case prop encoding time : 0.000
% 0.20/0.55 # Success case prop solver time : 0.000
% 0.20/0.55 # Current number of processed clauses : 16
% 0.20/0.55 # Positive orientable unit clauses : 16
% 0.20/0.55 # Positive unorientable unit clauses: 0
% 0.20/0.55 # Negative unit clauses : 0
% 0.20/0.55 # Non-unit-clauses : 0
% 0.20/0.55 # Current number of unprocessed clauses: 1099
% 0.20/0.55 # ...number of literals in the above : 1099
% 0.20/0.55 # Current number of archived formulas : 0
% 0.20/0.55 # Current number of archived clauses : 142
% 0.20/0.55 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.55 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.55 # Non-unit clause-clause subsumptions : 0
% 0.20/0.55 # Unit Clause-clause subsumption calls : 0
% 0.20/0.55 # Rewrite failures with RHS unbound : 0
% 0.20/0.55 # BW rewrite match attempts : 43
% 0.20/0.55 # BW rewrite match successes : 25
% 0.20/0.55 # Condensation attempts : 0
% 0.20/0.55 # Condensation successes : 0
% 0.20/0.55 # Termbank termtop insertions : 18942
% 0.20/0.55 # Search garbage collected termcells : 2
% 0.20/0.55
% 0.20/0.55 # -------------------------------------------------
% 0.20/0.55 # User time : 0.024 s
% 0.20/0.55 # System time : 0.004 s
% 0.20/0.55 # Total time : 0.028 s
% 0.20/0.55 # Maximum resident set size: 1672 pages
% 0.20/0.55
% 0.20/0.55 # -------------------------------------------------
% 0.20/0.55 # User time : 0.026 s
% 0.20/0.55 # System time : 0.007 s
% 0.20/0.55 # Total time : 0.033 s
% 0.20/0.55 # Maximum resident set size: 1688 pages
% 0.20/0.55 % E---3.1 exiting
% 0.20/0.55 % E exiting
%------------------------------------------------------------------------------