TSTP Solution File: LAT087-1 by E-SAT---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.2.0
% Problem : LAT087-1 : TPTP v8.2.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d SAT
% Computer : n026.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 Jun 24 10:22:06 EDT 2024
% Result : Unsatisfiable 0.71s 0.64s
% Output : CNFRefutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 2
% Syntax : Number of clauses : 55 ( 55 unt; 0 nHn; 4 RR)
% Number of literals : 55 ( 54 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 14 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 150 ( 37 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X3),meet(join(meet(X1,join(join(meet(X4,X2),meet(X2,X5)),X2)),meet(join(meet(X2,meet(meet(join(X4,join(X2,X5)),join(X6,X2)),X2)),meet(X7,join(X2,meet(meet(join(X4,join(X2,X5)),join(X6,X2)),X2)))),join(X1,join(join(meet(X4,X2),meet(X2,X5)),X2)))),join(join(meet(X1,X2),meet(X2,join(X1,X2))),X3))) = X2,
file('/export/starexec/sandbox2/tmp/tmp.RhFag4tJrq/E---3.1_28417.p',single_axiom) ).
cnf(prove_normal_axioms_8,negated_conjecture,
join(a,meet(a,b)) != a,
file('/export/starexec/sandbox2/tmp/tmp.RhFag4tJrq/E---3.1_28417.p',prove_normal_axioms_8) ).
cnf(c_0_2,axiom,
join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X3),meet(join(meet(X1,join(join(meet(X4,X2),meet(X2,X5)),X2)),meet(join(meet(X2,meet(meet(join(X4,join(X2,X5)),join(X6,X2)),X2)),meet(X7,join(X2,meet(meet(join(X4,join(X2,X5)),join(X6,X2)),X2)))),join(X1,join(join(meet(X4,X2),meet(X2,X5)),X2)))),join(join(meet(X1,X2),meet(X2,join(X1,X2))),X3))) = X2,
single_axiom ).
cnf(c_0_3,plain,
join(meet(join(meet(X1,join(meet(X2,X3),meet(X3,join(X2,X3)))),meet(join(meet(X2,X3),meet(X3,join(X2,X3))),join(X1,join(meet(X2,X3),meet(X3,join(X2,X3)))))),X4),meet(join(meet(X1,join(join(meet(X5,join(meet(X2,X3),meet(X3,join(X2,X3)))),meet(join(meet(X2,X3),meet(X3,join(X2,X3))),X6)),join(meet(X2,X3),meet(X3,join(X2,X3))))),meet(X3,join(X1,join(join(meet(X5,join(meet(X2,X3),meet(X3,join(X2,X3)))),meet(join(meet(X2,X3),meet(X3,join(X2,X3))),X6)),join(meet(X2,X3),meet(X3,join(X2,X3))))))),join(join(meet(X1,join(meet(X2,X3),meet(X3,join(X2,X3)))),meet(join(meet(X2,X3),meet(X3,join(X2,X3))),join(X1,join(meet(X2,X3),meet(X3,join(X2,X3)))))),X4))) = join(meet(X2,X3),meet(X3,join(X2,X3))),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X3),meet(join(meet(X1,join(join(meet(X4,X2),meet(X2,X5)),X2)),meet(join(meet(X6,join(join(meet(X7,X2),meet(X2,X8)),X2)),meet(join(meet(X2,meet(meet(join(X7,join(X2,X8)),join(X9,X2)),X2)),meet(X10,join(X2,meet(meet(join(X7,join(X2,X8)),join(X9,X2)),X2)))),join(X6,join(join(meet(X7,X2),meet(X2,X8)),X2)))),join(X1,join(join(meet(X4,X2),meet(X2,X5)),X2)))),join(join(meet(X1,X2),meet(X2,join(X1,X2))),X3))) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_2]) ).
cnf(c_0_5,plain,
join(meet(join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X2),meet(X2,join(join(meet(X1,X2),meet(X2,join(X1,X2))),X2))),X3),meet(X2,join(join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X2),meet(X2,join(join(meet(X1,X2),meet(X2,join(X1,X2))),X2))),X3))) = X2,
inference(spm,[status(thm)],[c_0_4,c_0_2]) ).
cnf(c_0_6,plain,
join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X3),meet(join(meet(X1,join(join(meet(X4,X2),meet(X2,X5)),X2)),meet(X2,join(X1,join(join(meet(X4,X2),meet(X2,X5)),X2)))),join(join(meet(X1,X2),meet(X2,join(X1,X2))),X3))) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_5]) ).
cnf(c_0_7,plain,
join(meet(X1,X2),meet(X1,join(X1,X2))) = X1,
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_8,plain,
join(meet(X1,join(join(meet(X2,X3),meet(X3,X4)),X3)),meet(X3,join(X1,join(join(meet(X2,X3),meet(X3,X4)),X3)))) = X3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_6]),c_0_6]),c_0_6]),c_0_7]) ).
cnf(c_0_9,plain,
join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X3),meet(X2,join(join(meet(X1,X2),meet(X2,join(X1,X2))),X3))) = X2,
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_10,plain,
join(meet(X1,join(join(meet(X2,X3),meet(X3,X4)),X3)),meet(join(meet(X3,meet(meet(join(X2,join(X3,X4)),join(X5,X3)),X3)),meet(X6,join(X3,meet(meet(join(X2,join(X3,X4)),join(X5,X3)),X3)))),join(X1,join(join(meet(X2,X3),meet(X3,X4)),X3)))) = X3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_2]),c_0_2]),c_0_7]) ).
cnf(c_0_11,plain,
join(meet(X1,meet(meet(join(X2,join(X1,X3)),join(X4,X1)),X1)),meet(X5,join(X1,meet(meet(join(X2,join(X1,X3)),join(X4,X1)),X1)))) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
join(meet(X1,X2),meet(X2,join(X1,X2))) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_11]) ).
cnf(c_0_13,plain,
meet(meet(join(X1,join(X2,X3)),join(X4,X2)),X2) = X2,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
join(meet(X1,join(X2,X2)),meet(X2,join(X1,join(X2,X2)))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_6]),c_0_8]),c_0_8]),c_0_8]),c_0_8]) ).
cnf(c_0_15,plain,
join(meet(X1,X1),meet(X2,join(X1,X1))) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_13]) ).
cnf(c_0_16,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,plain,
meet(X1,X1) = X1,
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(spm,[status(thm)],[c_0_2,c_0_16]),c_0_12]),c_0_12]),c_0_11]),c_0_8]),c_0_12]),c_0_16]) ).
cnf(c_0_18,plain,
meet(meet(join(X1,X2),join(X3,X2)),X2) = X2,
inference(spm,[status(thm)],[c_0_13,c_0_16]) ).
cnf(c_0_19,plain,
join(meet(meet(X1,X2),meet(X1,join(X1,X2))),meet(meet(X1,X2),X1)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_7,c_0_7]) ).
cnf(c_0_20,plain,
join(X1,meet(X2,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_17]),c_0_16]) ).
cnf(c_0_21,plain,
meet(join(X1,X2),X2) = X2,
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_22,plain,
meet(meet(X1,meet(X2,X1)),X1) = meet(X1,meet(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_17]),c_0_16]) ).
cnf(c_0_23,plain,
meet(X1,meet(X2,X1)) = meet(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_11]),c_0_13]),c_0_16]),c_0_13]),c_0_16]) ).
cnf(c_0_24,plain,
meet(meet(X1,X2),X2) = meet(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_23]) ).
cnf(c_0_25,plain,
meet(meet(join(X1,X2),join(X3,X1)),X1) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_16]) ).
cnf(c_0_26,plain,
join(meet(X1,meet(X2,X1)),X1) = X1,
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(spm,[status(thm)],[c_0_2,c_0_20]),c_0_12]),c_0_12]),c_0_11]),c_0_8]),c_0_12]),c_0_17]) ).
cnf(c_0_27,plain,
join(meet(X1,X1),join(X1,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_13]),c_0_13]),c_0_13]) ).
cnf(c_0_28,plain,
meet(join(X1,join(X2,X3)),X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_16]),c_0_24]) ).
cnf(c_0_29,plain,
meet(meet(join(X1,X2),X1),X1) = X1,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
meet(meet(X1,join(X2,X1)),X1) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_27]) ).
cnf(c_0_31,plain,
meet(join(X1,X2),meet(X2,X3)) = meet(X2,X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_2]),c_0_12]),c_0_12]) ).
cnf(c_0_32,plain,
join(meet(meet(meet(X1,join(X2,X2)),meet(X2,join(X1,join(X2,X2)))),meet(meet(X1,join(X2,X2)),X2)),meet(meet(meet(X1,join(X2,X2)),meet(X2,join(X1,join(X2,X2)))),meet(X1,join(X2,X2)))) = meet(meet(X1,join(X2,X2)),meet(X2,join(X1,join(X2,X2)))),
inference(spm,[status(thm)],[c_0_19,c_0_14]) ).
cnf(c_0_33,plain,
meet(join(X1,X2),X1) = X1,
inference(rw,[status(thm)],[c_0_29,c_0_24]) ).
cnf(c_0_34,plain,
meet(X1,meet(X1,join(X2,X1))) = meet(X1,join(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_12]),c_0_30]) ).
cnf(c_0_35,plain,
meet(X1,meet(meet(X1,join(X2,X1)),X3)) = meet(meet(X1,join(X2,X1)),X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_14]),c_0_16]),c_0_16]) ).
cnf(c_0_36,plain,
join(meet(X1,X2),X2) = X2,
inference(rw,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_37,plain,
meet(X1,join(join(X1,X2),X1)) = X1,
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)],[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(spm,[status(thm)],[c_0_32,c_0_33]),c_0_16]),c_0_16]),c_0_16]),c_0_34]),c_0_16]),c_0_17]),c_0_30]),c_0_16]),c_0_16]),c_0_16]),c_0_34]),c_0_16]),c_0_30]),c_0_16]),c_0_16]),c_0_16]),c_0_16]),c_0_34]) ).
cnf(c_0_38,plain,
meet(meet(X1,join(X2,X1)),meet(X1,X3)) = meet(X1,X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_14]),c_0_16]),c_0_16]),c_0_30]),c_0_16]),c_0_30]) ).
cnf(c_0_39,plain,
join(X1,join(join(X1,X2),X1)) = join(join(X1,X2),X1),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,plain,
join(meet(X1,join(X1,join(X2,X1))),X1) = meet(X1,join(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_38]),c_0_30]) ).
cnf(c_0_41,plain,
meet(X1,join(X2,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_7]),c_0_40]),c_0_7]) ).
cnf(c_0_42,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_36,c_0_41]) ).
cnf(c_0_43,plain,
join(meet(meet(X1,X2),X1),meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_42,c_0_19]) ).
cnf(c_0_44,plain,
meet(join(X1,join(X2,X3)),X3) = X3,
inference(spm,[status(thm)],[c_0_31,c_0_21]) ).
cnf(c_0_45,plain,
join(meet(meet(X1,join(join(meet(X2,X3),meet(X3,X4)),X3)),meet(X3,join(X1,join(join(meet(X2,X3),meet(X3,X4)),X3)))),meet(meet(X1,join(join(meet(X2,X3),meet(X3,X4)),X3)),X3)) = meet(X1,join(join(meet(X2,X3),meet(X3,X4)),X3)),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_46,plain,
meet(join(X1,meet(join(X2,X3),join(X4,X2))),X2) = X2,
inference(spm,[status(thm)],[c_0_31,c_0_25]) ).
cnf(c_0_47,plain,
join(meet(X1,join(X2,join(X3,X1))),X1) = X1,
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,plain,
join(join(meet(X1,X2),meet(X2,X3)),X2) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_31]),c_0_21]),c_0_47]) ).
cnf(c_0_49,plain,
join(meet(X1,X2),X1) = X1,
inference(spm,[status(thm)],[c_0_48,c_0_43]) ).
cnf(c_0_50,negated_conjecture,
join(a,meet(a,b)) != a,
inference(fof_simplification,[status(thm)],[prove_normal_axioms_8]) ).
cnf(c_0_51,plain,
meet(meet(X1,X2),X1) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_49]),c_0_16]) ).
cnf(c_0_52,negated_conjecture,
join(a,meet(a,b)) != a,
c_0_50 ).
cnf(c_0_53,plain,
join(X1,meet(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_51]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LAT087-1 : TPTP v8.2.0. Released v2.6.0.
% 0.07/0.12 % Command : run_E %s %d SAT
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri Jun 21 20:02:39 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 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/tmp/tmp.RhFag4tJrq/E---3.1_28417.p
% 0.71/0.64 # Version: 3.2.0
% 0.71/0.64 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.71/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.71/0.64 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.71/0.64 # Starting new_bool_3 with 300s (1) cores
% 0.71/0.64 # Starting new_bool_1 with 300s (1) cores
% 0.71/0.64 # Starting sh5l with 300s (1) cores
% 0.71/0.64 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 28494 completed with status 0
% 0.71/0.64 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.71/0.64 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.71/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.71/0.64 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.71/0.64 # No SInE strategy applied
% 0.71/0.64 # Search class: FUUPF-FFSF22-DFFFFFNN
% 0.71/0.64 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.71/0.64 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.71/0.64 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.71/0.64 # Starting new_bool_3 with 136s (1) cores
% 0.71/0.64 # Starting G----_0015_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.71/0.64 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.71/0.64 # G----_0015_C18_F1_SE_CS_SP_S0Y with pid 28503 completed with status 0
% 0.71/0.64 # Result found by G----_0015_C18_F1_SE_CS_SP_S0Y
% 0.71/0.64 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.71/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.71/0.64 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.71/0.64 # No SInE strategy applied
% 0.71/0.64 # Search class: FUUPF-FFSF22-DFFFFFNN
% 0.71/0.64 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.71/0.64 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.71/0.64 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.71/0.64 # Starting new_bool_3 with 136s (1) cores
% 0.71/0.64 # Starting G----_0015_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.71/0.64 # Preprocessing time : 0.001 s
% 0.71/0.64
% 0.71/0.64 # Proof found!
% 0.71/0.64 # SZS status Unsatisfiable
% 0.71/0.64 # SZS output start CNFRefutation
% See solution above
% 0.71/0.64 # Parsed axioms : 2
% 0.71/0.64 # Removed by relevancy pruning/SinE : 0
% 0.71/0.64 # Initial clauses : 2
% 0.71/0.64 # Removed in clause preprocessing : 0
% 0.71/0.64 # Initial clauses in saturation : 2
% 0.71/0.64 # Processed clauses : 274
% 0.71/0.64 # ...of these trivial : 178
% 0.71/0.64 # ...subsumed : 0
% 0.71/0.64 # ...remaining for further processing : 96
% 0.71/0.64 # Other redundant clauses eliminated : 0
% 0.71/0.64 # Clauses deleted for lack of memory : 0
% 0.71/0.64 # Backward-subsumed : 0
% 0.71/0.64 # Backward-rewritten : 49
% 0.71/0.64 # Generated clauses : 6924
% 0.71/0.64 # ...of the previous two non-redundant : 3922
% 0.71/0.64 # ...aggressively subsumed : 0
% 0.71/0.64 # Contextual simplify-reflections : 0
% 0.71/0.64 # Paramodulations : 6924
% 0.71/0.64 # Factorizations : 0
% 0.71/0.64 # NegExts : 0
% 0.71/0.64 # Equation resolutions : 0
% 0.71/0.64 # Disequality decompositions : 0
% 0.71/0.64 # Total rewrite steps : 19118
% 0.71/0.64 # ...of those cached : 16644
% 0.71/0.64 # Propositional unsat checks : 0
% 0.71/0.64 # Propositional check models : 0
% 0.71/0.64 # Propositional check unsatisfiable : 0
% 0.71/0.64 # Propositional clauses : 0
% 0.71/0.64 # Propositional clauses after purity: 0
% 0.71/0.64 # Propositional unsat core size : 0
% 0.71/0.64 # Propositional preprocessing time : 0.000
% 0.71/0.64 # Propositional encoding time : 0.000
% 0.71/0.64 # Propositional solver time : 0.000
% 0.71/0.64 # Success case prop preproc time : 0.000
% 0.71/0.64 # Success case prop encoding time : 0.000
% 0.71/0.64 # Success case prop solver time : 0.000
% 0.71/0.64 # Current number of processed clauses : 47
% 0.71/0.64 # Positive orientable unit clauses : 47
% 0.71/0.64 # Positive unorientable unit clauses: 0
% 0.71/0.64 # Negative unit clauses : 0
% 0.71/0.64 # Non-unit-clauses : 0
% 0.71/0.64 # Current number of unprocessed clauses: 3574
% 0.71/0.64 # ...number of literals in the above : 3574
% 0.71/0.64 # Current number of archived formulas : 0
% 0.71/0.64 # Current number of archived clauses : 49
% 0.71/0.64 # Clause-clause subsumption calls (NU) : 0
% 0.71/0.64 # Rec. Clause-clause subsumption calls : 0
% 0.71/0.64 # Non-unit clause-clause subsumptions : 0
% 0.71/0.64 # Unit Clause-clause subsumption calls : 0
% 0.71/0.64 # Rewrite failures with RHS unbound : 0
% 0.71/0.64 # BW rewrite match attempts : 510
% 0.71/0.64 # BW rewrite match successes : 43
% 0.71/0.64 # Condensation attempts : 0
% 0.71/0.64 # Condensation successes : 0
% 0.71/0.64 # Termbank termtop insertions : 330182
% 0.71/0.64 # Search garbage collected termcells : 2
% 0.71/0.64
% 0.71/0.64 # -------------------------------------------------
% 0.71/0.64 # User time : 0.128 s
% 0.71/0.64 # System time : 0.004 s
% 0.71/0.64 # Total time : 0.132 s
% 0.71/0.64 # Maximum resident set size: 1540 pages
% 0.71/0.64
% 0.71/0.64 # -------------------------------------------------
% 0.71/0.64 # User time : 0.642 s
% 0.71/0.64 # System time : 0.017 s
% 0.71/0.64 # Total time : 0.659 s
% 0.71/0.64 # Maximum resident set size: 1688 pages
% 0.71/0.64 % E---3.1 exiting
% 0.71/0.64 % E exiting
%------------------------------------------------------------------------------