TSTP Solution File: LAT195-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LAT195-1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 18:07:59 EDT 2023
% Result : Unsatisfiable 0.20s 0.67s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 13
% Syntax : Number of clauses : 84 ( 80 unt; 0 nHn; 8 RR)
% Number of literals : 91 ( 90 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 162 ( 23 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.tkXyC68E6Z/E---3.1_30177.p',absorption1) ).
cnf(complement_join,axiom,
join(X1,complement(X1)) = one,
file('/export/starexec/sandbox2/tmp/tmp.tkXyC68E6Z/E---3.1_30177.p',complement_join) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.tkXyC68E6Z/E---3.1_30177.p',commutativity_of_meet) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.tkXyC68E6Z/E---3.1_30177.p',associativity_of_meet) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.tkXyC68E6Z/E---3.1_30177.p',idempotence_of_meet) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.tkXyC68E6Z/E---3.1_30177.p',absorption2) ).
cnf(complement_meet,axiom,
meet(X1,complement(X1)) = zero,
file('/export/starexec/sandbox2/tmp/tmp.tkXyC68E6Z/E---3.1_30177.p',complement_meet) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.tkXyC68E6Z/E---3.1_30177.p',associativity_of_join) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.tkXyC68E6Z/E---3.1_30177.p',commutativity_of_join) ).
cnf(equation_H34,axiom,
meet(X1,join(X2,meet(X3,X4))) = meet(X1,join(X2,meet(X3,join(X2,meet(X4,join(X2,X3)))))),
file('/export/starexec/sandbox2/tmp/tmp.tkXyC68E6Z/E---3.1_30177.p',equation_H34) ).
cnf(meet_join_complement,axiom,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
file('/export/starexec/sandbox2/tmp/tmp.tkXyC68E6Z/E---3.1_30177.p',meet_join_complement) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.tkXyC68E6Z/E---3.1_30177.p',idempotence_of_join) ).
cnf(prove_distributivity,negated_conjecture,
meet(a,join(b,c)) != join(meet(a,b),meet(a,c)),
file('/export/starexec/sandbox2/tmp/tmp.tkXyC68E6Z/E---3.1_30177.p',prove_distributivity) ).
cnf(c_0_13,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_14,axiom,
join(X1,complement(X1)) = one,
complement_join ).
cnf(c_0_15,plain,
meet(X1,one) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_17,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_18,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_19,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_20,plain,
meet(one,X1) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,axiom,
meet(X1,complement(X1)) = zero,
complement_meet ).
cnf(c_0_23,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_16]) ).
cnf(c_0_24,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_25,plain,
join(one,X1) = one,
inference(spm,[status(thm)],[c_0_13,c_0_20]) ).
cnf(c_0_26,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_27,plain,
meet(X1,zero) = zero,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,axiom,
meet(X1,join(X2,meet(X3,X4))) = meet(X1,join(X2,meet(X3,join(X2,meet(X4,join(X2,X3)))))),
equation_H34 ).
cnf(c_0_29,plain,
join(X1,join(X2,X1)) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_13]),c_0_24]) ).
cnf(c_0_30,plain,
join(X1,join(complement(X1),X2)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_14]),c_0_25]) ).
cnf(c_0_31,plain,
join(X1,one) = one,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,plain,
meet(zero,X1) = zero,
inference(spm,[status(thm)],[c_0_27,c_0_16]) ).
cnf(c_0_33,plain,
join(X1,meet(X2,join(X1,meet(X3,join(X1,X2))))) = join(X1,meet(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_28]),c_0_16]),c_0_28]),c_0_18]) ).
cnf(c_0_34,plain,
join(complement(X1),join(X2,X1)) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_24]) ).
cnf(c_0_35,axiom,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
meet_join_complement ).
cnf(c_0_36,plain,
meet(X1,meet(complement(X1),X2)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_22]),c_0_32]) ).
cnf(c_0_37,plain,
join(X1,meet(complement(X1),join(X1,X2))) = join(X1,meet(complement(X1),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_14]),c_0_15]) ).
cnf(c_0_38,plain,
join(X1,complement(meet(X2,X1))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_23]),c_0_26]) ).
cnf(c_0_39,plain,
( meet(complement(X1),X2) = complement(X1)
| join(X1,meet(complement(X1),X2)) != one ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
join(X1,meet(complement(X1),complement(meet(X2,X1)))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_15]),c_0_14]) ).
cnf(c_0_41,plain,
join(X1,join(X2,complement(join(X1,X2)))) = one,
inference(spm,[status(thm)],[c_0_14,c_0_24]) ).
cnf(c_0_42,plain,
meet(complement(X1),complement(meet(X2,X1))) = complement(X1),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,plain,
join(X1,meet(complement(X1),join(X2,complement(join(X1,X2))))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_41]),c_0_15]),c_0_14]) ).
cnf(c_0_44,plain,
( complement(X1) = X2
| meet(X2,X1) != zero
| join(X1,X2) != one ),
inference(spm,[status(thm)],[c_0_35,c_0_16]) ).
cnf(c_0_45,plain,
join(complement(X1),complement(meet(X2,X1))) = complement(meet(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_42]),c_0_26]) ).
cnf(c_0_46,plain,
meet(complement(X1),join(X2,complement(join(X1,X2)))) = complement(X1),
inference(spm,[status(thm)],[c_0_39,c_0_43]) ).
cnf(c_0_47,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_22]),c_0_26]),c_0_14])]) ).
cnf(c_0_48,plain,
join(complement(X1),complement(join(X1,X2))) = complement(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_13]),c_0_26]) ).
cnf(c_0_49,plain,
meet(X1,join(X2,complement(join(complement(X1),X2)))) = X1,
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,plain,
join(X1,join(X2,complement(join(X2,X1)))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_29]),c_0_26]),c_0_24]) ).
cnf(c_0_51,plain,
complement(one) = zero,
inference(spm,[status(thm)],[c_0_22,c_0_20]) ).
cnf(c_0_52,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_22]) ).
cnf(c_0_53,plain,
join(X1,complement(join(complement(X1),X2))) = X1,
inference(spm,[status(thm)],[c_0_48,c_0_47]) ).
cnf(c_0_54,plain,
meet(X1,join(X2,complement(join(X2,complement(X1))))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),c_0_52]) ).
cnf(c_0_55,plain,
join(X1,complement(join(X2,complement(X1)))) = X1,
inference(spm,[status(thm)],[c_0_53,c_0_26]) ).
cnf(c_0_56,plain,
join(X1,complement(meet(X1,X2))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_19]),c_0_26]) ).
cnf(c_0_57,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_58,plain,
join(X1,complement(join(X1,complement(X2)))) = join(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_54]),c_0_24]),c_0_26]),c_0_55]) ).
cnf(c_0_59,plain,
meet(complement(X1),complement(join(X1,X2))) = complement(join(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_13]),c_0_16]) ).
cnf(c_0_60,plain,
join(X1,meet(complement(X1),complement(meet(X1,X2)))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_56]),c_0_15]),c_0_14]) ).
cnf(c_0_61,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_24,c_0_57]) ).
cnf(c_0_62,plain,
join(X1,meet(complement(X1),X2)) = join(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_58]),c_0_37]),c_0_59]),c_0_58]) ).
cnf(c_0_63,plain,
meet(complement(X1),complement(meet(X1,X2))) = complement(X1),
inference(spm,[status(thm)],[c_0_39,c_0_60]) ).
cnf(c_0_64,plain,
join(X1,complement(join(X1,X2))) = join(X1,complement(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_58]),c_0_61]) ).
cnf(c_0_65,plain,
join(complement(X1),meet(X1,X2)) = join(complement(X1),X2),
inference(spm,[status(thm)],[c_0_62,c_0_47]) ).
cnf(c_0_66,plain,
join(complement(X1),complement(meet(X1,X2))) = complement(meet(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_63]),c_0_26]) ).
cnf(c_0_67,plain,
complement(meet(X1,X2)) = join(complement(X1),complement(X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_64]),c_0_66]) ).
cnf(c_0_68,plain,
meet(X1,meet(X2,join(complement(X1),complement(X2)))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_67]),c_0_17]) ).
cnf(c_0_69,plain,
join(X1,meet(X2,join(X1,complement(X2)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_68]),c_0_52]),c_0_47]) ).
cnf(c_0_70,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_26]) ).
cnf(c_0_71,plain,
join(X1,meet(X2,join(complement(X2),X1))) = X1,
inference(spm,[status(thm)],[c_0_69,c_0_26]) ).
cnf(c_0_72,plain,
meet(X1,join(complement(X1),X2)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_17]),c_0_16]),c_0_70]) ).
cnf(c_0_73,plain,
join(X1,join(meet(complement(X1),X2),X3)) = join(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_62]),c_0_24]) ).
cnf(c_0_74,plain,
meet(X1,join(meet(X1,X2),X3)) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_72]),c_0_47]) ).
cnf(c_0_75,plain,
join(X1,join(meet(X2,X1),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_76,plain,
meet(X1,join(meet(X2,X1),X3)) = meet(X1,join(X2,X3)),
inference(spm,[status(thm)],[c_0_74,c_0_16]) ).
cnf(c_0_77,plain,
meet(join(X1,X2),join(meet(X3,X1),X2)) = join(meet(X3,X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_75]),c_0_16]) ).
cnf(c_0_78,plain,
meet(X1,join(X2,meet(X1,X3))) = meet(X1,join(X3,X2)),
inference(spm,[status(thm)],[c_0_74,c_0_26]) ).
cnf(c_0_79,plain,
meet(X1,join(X2,meet(X3,X1))) = meet(X1,join(X3,X2)),
inference(spm,[status(thm)],[c_0_76,c_0_26]) ).
cnf(c_0_80,plain,
join(meet(X1,X2),meet(X2,X3)) = meet(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_19]),c_0_78]),c_0_79]) ).
cnf(c_0_81,negated_conjecture,
meet(a,join(b,c)) != join(meet(a,b),meet(a,c)),
prove_distributivity ).
cnf(c_0_82,plain,
join(meet(X1,X2),meet(X1,X3)) = meet(X1,join(X2,X3)),
inference(spm,[status(thm)],[c_0_80,c_0_16]) ).
cnf(c_0_83,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_82])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : LAT195-1 : TPTP v8.1.2. Released v3.1.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 11:21:36 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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.tkXyC68E6Z/E---3.1_30177.p
% 0.20/0.67 # Version: 3.1pre001
% 0.20/0.67 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.67 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.67 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.67 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.67 # Starting sh5l with 300s (1) cores
% 0.20/0.67 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 30255 completed with status 0
% 0.20/0.67 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.20/0.67 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.67 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.67 # No SInE strategy applied
% 0.20/0.67 # Search class: FHUPM-FFSF21-DFFFFFNN
% 0.20/0.67 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.67 # Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 0.20/0.67 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.20/0.67 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.67 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.20/0.67 # Starting G-E--_303_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.20/0.67 # E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with pid 30260 completed with status 0
% 0.20/0.67 # Result found by E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S
% 0.20/0.67 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.67 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.67 # No SInE strategy applied
% 0.20/0.67 # Search class: FHUPM-FFSF21-DFFFFFNN
% 0.20/0.67 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.67 # Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 0.20/0.67 # Preprocessing time : 0.001 s
% 0.20/0.67 # Presaturation interreduction done
% 0.20/0.67
% 0.20/0.67 # Proof found!
% 0.20/0.67 # SZS status Unsatisfiable
% 0.20/0.67 # SZS output start CNFRefutation
% See solution above
% 0.20/0.67 # Parsed axioms : 13
% 0.20/0.67 # Removed by relevancy pruning/SinE : 0
% 0.20/0.67 # Initial clauses : 13
% 0.20/0.67 # Removed in clause preprocessing : 0
% 0.20/0.67 # Initial clauses in saturation : 13
% 0.20/0.67 # Processed clauses : 2365
% 0.20/0.67 # ...of these trivial : 577
% 0.20/0.67 # ...subsumed : 1472
% 0.20/0.67 # ...remaining for further processing : 316
% 0.20/0.67 # Other redundant clauses eliminated : 0
% 0.20/0.67 # Clauses deleted for lack of memory : 0
% 0.20/0.67 # Backward-subsumed : 0
% 0.20/0.67 # Backward-rewritten : 82
% 0.20/0.67 # Generated clauses : 22479
% 0.20/0.67 # ...of the previous two non-redundant : 12653
% 0.20/0.67 # ...aggressively subsumed : 0
% 0.20/0.67 # Contextual simplify-reflections : 0
% 0.20/0.67 # Paramodulations : 22454
% 0.20/0.67 # Factorizations : 0
% 0.20/0.67 # NegExts : 0
% 0.20/0.67 # Equation resolutions : 25
% 0.20/0.67 # Total rewrite steps : 45121
% 0.20/0.67 # Propositional unsat checks : 0
% 0.20/0.67 # Propositional check models : 0
% 0.20/0.67 # Propositional check unsatisfiable : 0
% 0.20/0.67 # Propositional clauses : 0
% 0.20/0.67 # Propositional clauses after purity: 0
% 0.20/0.67 # Propositional unsat core size : 0
% 0.20/0.67 # Propositional preprocessing time : 0.000
% 0.20/0.67 # Propositional encoding time : 0.000
% 0.20/0.67 # Propositional solver time : 0.000
% 0.20/0.67 # Success case prop preproc time : 0.000
% 0.20/0.67 # Success case prop encoding time : 0.000
% 0.20/0.67 # Success case prop solver time : 0.000
% 0.20/0.67 # Current number of processed clauses : 221
% 0.20/0.67 # Positive orientable unit clauses : 113
% 0.20/0.67 # Positive unorientable unit clauses: 6
% 0.20/0.67 # Negative unit clauses : 0
% 0.20/0.67 # Non-unit-clauses : 102
% 0.20/0.67 # Current number of unprocessed clauses: 9839
% 0.20/0.67 # ...number of literals in the above : 12484
% 0.20/0.67 # Current number of archived formulas : 0
% 0.20/0.67 # Current number of archived clauses : 95
% 0.20/0.67 # Clause-clause subsumption calls (NU) : 7476
% 0.20/0.67 # Rec. Clause-clause subsumption calls : 7381
% 0.20/0.67 # Non-unit clause-clause subsumptions : 1131
% 0.20/0.67 # Unit Clause-clause subsumption calls : 31
% 0.20/0.67 # Rewrite failures with RHS unbound : 0
% 0.20/0.67 # BW rewrite match attempts : 640
% 0.20/0.67 # BW rewrite match successes : 276
% 0.20/0.67 # Condensation attempts : 0
% 0.20/0.67 # Condensation successes : 0
% 0.20/0.67 # Termbank termtop insertions : 210301
% 0.20/0.67
% 0.20/0.67 # -------------------------------------------------
% 0.20/0.67 # User time : 0.160 s
% 0.20/0.67 # System time : 0.009 s
% 0.20/0.67 # Total time : 0.169 s
% 0.20/0.67 # Maximum resident set size: 1592 pages
% 0.20/0.67
% 0.20/0.67 # -------------------------------------------------
% 0.20/0.67 # User time : 0.821 s
% 0.20/0.67 # System time : 0.030 s
% 0.20/0.67 # Total time : 0.851 s
% 0.20/0.67 # Maximum resident set size: 1676 pages
% 0.20/0.67 % E---3.1 exiting
% 0.20/0.67 % E---3.1 exiting
%------------------------------------------------------------------------------