%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT023-1 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:04:05 PM UTC 2026
% Result : Unsatisfiable 7.28s 1.43s
% Output : CNFRefutation 7.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 10
% Syntax : Number of clauses : 72 ( 72 unt; 0 nHn; 4 RR)
% Number of literals : 72 ( 71 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 173 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(quasi_lattice2,axiom,
meet(join(X1,meet(X2,X3)),join(X1,X2)) = join(X1,meet(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT004-0.ax',quasi_lattice2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT004-0.ax',commutativity_of_meet) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT004-0.ax',associativity_of_meet) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT004-0.ax',idempotence_of_meet) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT004-0.ax',idempotence_of_join) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT004-0.ax',commutativity_of_join) ).
cnf(quasi_lattice1,axiom,
join(meet(X1,join(X2,X3)),meet(X1,X2)) = meet(X1,join(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT004-0.ax',quasi_lattice1) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT004-0.ax',associativity_of_join) ).
cnf(modularity_axiom,hypothesis,
join(meet(join(X1,X2),X3),X2) = join(meet(join(X3,X2),X1),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',modularity_axiom) ).
cnf(prove_modularity,negated_conjecture,
meet(a,join(b,meet(a,c))) != join(meet(a,b),meet(a,c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_modularity) ).
cnf(c_0_10,axiom,
meet(join(X1,meet(X2,X3)),join(X1,X2)) = join(X1,meet(X2,X3)),
quasi_lattice2 ).
cnf(c_0_11,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_12,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_13,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_14,plain,
meet(join(X1,X2),join(X1,meet(X2,X3))) = join(X1,meet(X2,X3)),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_16,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_18,plain,
meet(X1,join(X1,meet(X1,X2))) = join(X1,meet(X1,X2)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
meet(X1,meet(X2,X1)) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_16,c_0_11]) ).
cnf(c_0_20,axiom,
join(meet(X1,join(X2,X3)),meet(X1,X2)) = meet(X1,join(X2,X3)),
quasi_lattice1 ).
cnf(c_0_21,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_22,plain,
meet(X1,meet(X2,join(X1,meet(X1,X2)))) = meet(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_17]),c_0_11]),c_0_12]) ).
cnf(c_0_23,plain,
meet(X1,join(X1,meet(X2,X1))) = join(X1,meet(X2,X1)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
join(meet(X1,X2),meet(X1,join(X2,X3))) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[c_0_20,c_0_17]) ).
cnf(c_0_25,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_21,c_0_15]) ).
cnf(c_0_26,plain,
meet(X1,meet(X2,join(X1,meet(X2,X1)))) = meet(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_19]),c_0_12]),c_0_23]) ).
cnf(c_0_27,plain,
meet(X1,meet(X2,meet(X1,X3))) = meet(X2,meet(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_19]),c_0_12]),c_0_12]) ).
cnf(c_0_28,plain,
join(X1,meet(X1,join(X1,X2))) = meet(X1,join(X1,X2)),
inference(spm,[status(thm)],[c_0_24,c_0_13]) ).
cnf(c_0_29,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_25,c_0_17]) ).
cnf(c_0_30,hypothesis,
join(meet(join(X1,X2),X3),X2) = join(meet(join(X3,X2),X1),X2),
modularity_axiom ).
cnf(c_0_31,plain,
meet(X1,join(X2,meet(X1,X2))) = meet(X1,X2),
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_19,c_0_26]),c_0_12]),c_0_27]),c_0_11]),c_0_12]),c_0_23]) ).
cnf(c_0_32,plain,
join(X1,join(X2,meet(X1,join(X1,X2)))) = join(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_13]),c_0_11]),c_0_17]),c_0_21]) ).
cnf(c_0_33,plain,
join(X1,meet(X1,join(X2,X1))) = meet(X1,join(X2,X1)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,hypothesis,
join(X1,meet(join(X2,X1),X3)) = join(X1,meet(join(X3,X1),X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_17]),c_0_17]) ).
cnf(c_0_35,plain,
meet(X1,join(X2,meet(X2,X1))) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_31,c_0_11]) ).
cnf(c_0_36,plain,
join(X1,join(X2,meet(X1,join(X2,X1)))) = join(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_29]),c_0_21]),c_0_33]) ).
cnf(c_0_37,plain,
join(X1,join(X2,join(X1,X3))) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_29]),c_0_21]),c_0_21]) ).
cnf(c_0_38,hypothesis,
join(X1,meet(join(X2,X1),X3)) = join(X1,meet(X2,join(X3,X1))),
inference(spm,[status(thm)],[c_0_34,c_0_11]) ).
cnf(c_0_39,plain,
join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
inference(spm,[status(thm)],[c_0_17,c_0_21]) ).
cnf(c_0_40,plain,
join(meet(X1,X2),meet(X2,X1)) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_24,c_0_35]) ).
cnf(c_0_41,plain,
join(X1,meet(X2,join(X1,X2))) = join(X1,X2),
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_29,c_0_36]),c_0_21]),c_0_37]),c_0_17]),c_0_21]),c_0_33]) ).
cnf(c_0_42,hypothesis,
join(X1,meet(join(X1,X2),X3)) = join(X1,meet(X2,join(X3,X1))),
inference(spm,[status(thm)],[c_0_38,c_0_17]) ).
cnf(c_0_43,plain,
join(X1,join(X2,X3)) = join(X3,join(X2,X1)),
inference(spm,[status(thm)],[c_0_39,c_0_17]) ).
cnf(c_0_44,plain,
join(meet(X1,X2),join(meet(X2,X1),X3)) = join(meet(X2,X1),X3),
inference(spm,[status(thm)],[c_0_21,c_0_40]) ).
cnf(c_0_45,plain,
join(X1,meet(X2,join(X2,X1))) = join(X2,X1),
inference(spm,[status(thm)],[c_0_41,c_0_17]) ).
cnf(c_0_46,hypothesis,
join(X1,meet(X2,join(meet(X2,X3),X1))) = join(X1,meet(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_14]),c_0_25]),c_0_21]),c_0_29]) ).
cnf(c_0_47,plain,
join(meet(X1,X2),X3) = join(X3,meet(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_40]) ).
cnf(c_0_48,plain,
meet(X1,meet(X2,X3)) = meet(X3,meet(X1,X2)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_49,plain,
meet(join(X1,X2),join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_14,c_0_45]) ).
cnf(c_0_50,plain,
meet(join(X1,X2),join(X2,meet(X1,X3))) = join(X2,meet(X1,X3)),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_51,hypothesis,
meet(X1,join(X2,X1)) = join(X1,meet(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_15]),c_0_11]),c_0_33]) ).
cnf(c_0_52,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_17]),c_0_21]) ).
cnf(c_0_53,hypothesis,
join(X1,meet(X2,join(X1,meet(X3,X2)))) = join(X1,meet(X2,X3)),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_54,plain,
meet(X1,meet(X2,X3)) = meet(X3,meet(X2,X1)),
inference(spm,[status(thm)],[c_0_48,c_0_11]) ).
cnf(c_0_55,plain,
meet(join(X1,X2),meet(join(X2,X1),X3)) = meet(join(X2,X1),X3),
inference(spm,[status(thm)],[c_0_12,c_0_49]) ).
cnf(c_0_56,plain,
join(X1,join(meet(X1,X2),meet(X2,X3))) = join(X1,meet(X2,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_24,c_0_50]),c_0_11]),c_0_51]),c_0_21]),c_0_37]),c_0_52]) ).
cnf(c_0_57,hypothesis,
meet(join(X1,meet(X1,X2)),X3) = meet(X1,meet(join(X2,X1),X3)),
inference(spm,[status(thm)],[c_0_12,c_0_51]) ).
cnf(c_0_58,hypothesis,
join(X1,meet(X2,meet(X3,join(X2,X1)))) = join(X1,meet(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_46]),c_0_49]),c_0_25]),c_0_38]),c_0_12]) ).
cnf(c_0_59,plain,
meet(join(X1,X2),X3) = meet(X3,join(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_49]) ).
cnf(c_0_60,plain,
join(X1,join(meet(X2,X1),meet(X2,X3))) = join(X1,meet(X2,X3)),
inference(spm,[status(thm)],[c_0_56,c_0_11]) ).
cnf(c_0_61,hypothesis,
join(meet(X1,X2),meet(X1,meet(join(X2,X1),X3))) = join(meet(X1,X2),meet(X1,join(X3,meet(X1,X2)))),
inference(spm,[status(thm)],[c_0_38,c_0_57]) ).
cnf(c_0_62,hypothesis,
join(X1,meet(X2,meet(join(X1,X2),X3))) = join(X1,meet(X2,X3)),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_63,hypothesis,
join(X1,meet(X2,join(X3,meet(X2,X1)))) = join(X1,meet(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_60]),c_0_62]) ).
cnf(c_0_64,hypothesis,
join(X1,meet(X2,join(meet(X2,X1),X3))) = join(X1,meet(X2,X3)),
inference(spm,[status(thm)],[c_0_63,c_0_17]) ).
cnf(c_0_65,plain,
join(meet(X1,X2),meet(X1,join(meet(X1,X2),X3))) = meet(X1,join(meet(X1,X2),X3)),
inference(spm,[status(thm)],[c_0_24,c_0_16]) ).
cnf(c_0_66,negated_conjecture,
meet(a,join(b,meet(a,c))) != join(meet(a,b),meet(a,c)),
inference(fof_simplification,[status(thm)],[prove_modularity]) ).
cnf(c_0_67,hypothesis,
meet(X1,join(meet(X1,X2),X3)) = join(meet(X1,X2),meet(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_16]),c_0_65]) ).
cnf(c_0_68,plain,
join(X1,join(meet(X2,X3),meet(X2,X1))) = join(X1,meet(X2,X3)),
inference(spm,[status(thm)],[c_0_56,c_0_47]) ).
cnf(c_0_69,negated_conjecture,
meet(a,join(b,meet(a,c))) != join(meet(a,b),meet(a,c)),
c_0_66 ).
cnf(c_0_70,hypothesis,
meet(X1,join(X2,meet(X1,X3))) = join(meet(X1,X3),meet(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_67]),c_0_21]),c_0_68]),c_0_29]) ).
cnf(c_0_71,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_70]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : LAT023-1 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.30 % Computer : n012.cluster.edu
% 0.04/0.30 % Model : x86_64 x86_64
% 0.04/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30 % Memory : 8046.5625MB
% 0.04/0.30 % OS : Linux 6.8.0-71-generic
% 0.04/0.30 % CPULimit : 300
% 0.04/0.30 % WCLimit : 300
% 0.04/0.30 % DateTime : Sun Sep 20 23:06:37 UTC 2026
% 0.04/0.30 % CPUTime :
% 0.04/0.30 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.34 Running first-order theorem proving
% 0.04/0.34 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/benchmark/theBenchmark.p
% 7.28/1.43 % Version: 3.5.1
% 7.28/1.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 7.28/1.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.28/1.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 7.28/1.43 % Starting new_bool_3 with 300s (1) cores
% 7.28/1.43 % Starting new_bool_1 with 300s (1) cores
% 7.28/1.43 % Starting sh5l with 300s (1) cores
% 7.28/1.43 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1048900 completed with status 0
% 7.28/1.43 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 7.28/1.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 7.28/1.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.28/1.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 7.28/1.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 7.28/1.43 % No SInE strategy applied
% 7.28/1.43 % Search class: FUUPM-FFSF22-MFFFFFNN
% 7.28/1.43 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 7.28/1.43 % Starting SubtermCWHack with 136s (1) cores
% 7.28/1.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 7.28/1.43 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 7.28/1.43 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 7.28/1.43 % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 7.28/1.43 % E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with pid 1048907 completed with status 0
% 7.28/1.43 % Result found by E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S
% 7.28/1.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 7.28/1.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.28/1.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 7.28/1.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 7.28/1.43 % No SInE strategy applied
% 7.28/1.43 % Search class: FUUPM-FFSF22-MFFFFFNN
% 7.28/1.43 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 7.28/1.43 % Starting SubtermCWHack with 136s (1) cores
% 7.28/1.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 7.28/1.43 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 7.28/1.43 % Preprocessing time : 0.001 s
% 7.28/1.43 % Presaturation interreduction done
% 7.28/1.43
% 7.28/1.43 % Proof found!
% 7.28/1.43 % SZS status Unsatisfiable
% 7.28/1.43 % SZS output start CNFRefutation
% See solution above
% 7.28/1.43 % Parsed axioms : 10
% 7.28/1.43 % Removed by relevancy pruning/SinE : 0
% 7.28/1.43 % Initial clauses : 10
% 7.28/1.43 % Removed in clause preprocessing : 0
% 7.28/1.43 % Initial clauses in saturation : 10
% 7.28/1.43 % Processed clauses : 3532
% 7.28/1.43 % ...of these trivial : 935
% 7.28/1.43 % ...subsumed : 2279
% 7.28/1.43 % ...remaining for further processing : 318
% 7.28/1.43 % Other redundant clauses eliminated : 0
% 7.28/1.43 % Clauses deleted for lack of memory : 0
% 7.28/1.43 % Backward-subsumed : 0
% 7.28/1.43 % Backward-rewritten : 108
% 7.28/1.43 % Generated clauses : 95066
% 7.28/1.43 % ...of the previous two non-redundant : 79336
% 7.28/1.43 % ...aggressively subsumed : 0
% 7.28/1.43 % Contextual simplify-reflections : 0
% 7.28/1.43 % Paramodulations : 95066
% 7.28/1.43 % Factorizations : 0
% 7.28/1.43 % NegExts : 0
% 7.28/1.43 % Equation resolutions : 0
% 7.28/1.43 % Disequality decompositions : 0
% 7.28/1.43 % Total rewrite steps : 246616
% 7.28/1.43 % ...of those cached : 190603
% 7.28/1.43 % Propositional unsat checks : 0
% 7.28/1.43 % Propositional check models : 0
% 7.28/1.43 % Propositional check unsatisfiable : 0
% 7.28/1.43 % Propositional clauses : 0
% 7.28/1.43 % Propositional clauses after purity: 0
% 7.28/1.43 % Propositional unsat core size : 0
% 7.28/1.43 % Propositional preprocessing time : 0.000
% 7.28/1.43 % Propositional encoding time : 0.000
% 7.28/1.43 % Propositional solver time : 0.000
% 7.28/1.43 % Success case prop preproc time : 0.000
% 7.28/1.43 % Success case prop encoding time : 0.000
% 7.28/1.43 % Success case prop solver time : 0.000
% 7.28/1.43 % Current number of processed clauses : 200
% 7.28/1.43 % Positive orientable unit clauses : 174
% 7.28/1.43 % Positive unorientable unit clauses: 26
% 7.28/1.43 % Negative unit clauses : 0
% 7.28/1.43 % Non-unit-clauses : 0
% 7.28/1.43 % Current number of unprocessed clauses: 75442
% 7.28/1.43 % ...number of literals in the above : 75442
% 7.28/1.43 % Current number of archived formulas : 0
% 7.28/1.43 % Current number of archived clauses : 118
% 7.28/1.43 % Clause-clause subsumption calls (NU) : 0
% 7.28/1.43 % Rec. Clause-clause subsumption calls : 0
% 7.28/1.43 % Non-unit clause-clause subsumptions : 0
% 7.28/1.43 % Unit Clause-clause subsumption calls : 752
% 7.28/1.43 % Rewrite failures with RHS unbound : 0
% 7.28/1.43 % BW rewrite match attempts : 4459
% 7.28/1.43 % BW rewrite match successes : 505
% 7.28/1.43 % Condensation attempts : 0
% 7.28/1.43 % Condensation successes : 0
% 7.28/1.43 % Termbank termtop insertions : 1521839
% 7.28/1.43 % Search garbage collected termcells : 2
% 7.28/1.43
% 7.28/1.43 % -------------------------------------------------
% 7.28/1.43 % User time : 0.999 s
% 7.28/1.43 % System time : 0.050 s
% 7.28/1.43 % Total time : 1.050 s
% 7.28/1.43 % Maximum resident set size: 3640 pages
% 7.28/1.43
% 7.28/1.43 % -------------------------------------------------
% 7.28/1.43 % User time : 4.951 s
% 7.28/1.43 % System time : 0.263 s
% 7.28/1.43 % Total time : 5.214 s
% 7.28/1.43 % Maximum resident set size: 4608 pages
% 7.28/1.43 % E exiting
%------------------------------------------------------------------------------