%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT209-1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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:27 PM UTC 2026
% Result : Unsatisfiable 5.18s 11.13s
% Output : CNFRefutation 5.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 13
% Syntax : Number of clauses : 101 ( 93 unt; 0 nHn; 13 RR)
% Number of literals : 113 ( 112 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 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 : 202 ( 30 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',associativity_of_meet) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',idempotence_of_meet) ).
cnf(complement_meet,axiom,
meet(X1,complement(X1)) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-4.ax',complement_meet) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',absorption2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',commutativity_of_meet) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',commutativity_of_join) ).
cnf(complement_join,axiom,
join(X1,complement(X1)) = one,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-4.ax',complement_join) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',absorption1) ).
cnf(equation_H64,axiom,
meet(X1,join(X2,X3)) = meet(X1,join(X2,meet(X1,join(X3,meet(X1,join(X2,meet(X1,X3))))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equation_H64) ).
cnf(meet_join_complement,axiom,
( join(X1,X2) != one
| meet(X1,X2) != zero
| complement(X1) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-4.ax',meet_join_complement) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',associativity_of_join) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',idempotence_of_join) ).
cnf(prove_distributivity,negated_conjecture,
meet(a,join(b,c)) != join(meet(a,b),meet(a,c)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_distributivity) ).
cnf(c_0_13,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_14,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_15,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,axiom,
meet(X1,complement(X1)) = zero,
complement_meet ).
cnf(c_0_17,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_18,plain,
meet(X1,zero) = zero,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_20,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_21,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_22,plain,
meet(X1,meet(X2,complement(meet(X1,X2)))) = zero,
inference(spm,[status(thm)],[c_0_16,c_0_13]) ).
cnf(c_0_23,plain,
meet(zero,X1) = zero,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,axiom,
join(X1,complement(X1)) = one,
complement_join ).
cnf(c_0_25,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_27,plain,
meet(X1,meet(X2,complement(meet(X2,X1)))) = zero,
inference(spm,[status(thm)],[c_0_22,c_0_19]) ).
cnf(c_0_28,plain,
meet(X1,meet(complement(X1),X2)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_16]),c_0_23]) ).
cnf(c_0_29,plain,
complement(zero) = one,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
meet(X1,one) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_24]) ).
cnf(c_0_31,axiom,
meet(X1,join(X2,X3)) = meet(X1,join(X2,meet(X1,join(X3,meet(X1,join(X2,meet(X1,X3))))))),
equation_H64 ).
cnf(c_0_32,plain,
meet(complement(X1),meet(X2,X1)) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30]),c_0_13]) ).
cnf(c_0_33,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_21]) ).
cnf(c_0_34,plain,
meet(one,X1) = X1,
inference(spm,[status(thm)],[c_0_30,c_0_19]) ).
cnf(c_0_35,plain,
( join(X1,X2) != one
| meet(X1,X2) != zero
| complement(X1) = X2 ),
inference(fof_simplification,[status(thm)],[meet_join_complement]) ).
cnf(c_0_36,plain,
meet(X1,join(X2,meet(X1,join(complement(X1),meet(X1,X2))))) = meet(X1,join(X2,complement(X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_16]),c_0_20]) ).
cnf(c_0_37,plain,
meet(X1,complement(join(X2,X1))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_19]) ).
cnf(c_0_38,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_39,plain,
join(one,X1) = one,
inference(spm,[status(thm)],[c_0_26,c_0_34]) ).
cnf(c_0_40,plain,
( join(X1,X2) != one
| meet(X1,X2) != zero
| complement(X1) = X2 ),
c_0_35 ).
cnf(c_0_41,plain,
meet(X1,join(complement(X1),complement(join(X2,X1)))) = zero,
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_36,c_0_37]),c_0_20]),c_0_16]),c_0_20]),c_0_37]),c_0_21]) ).
cnf(c_0_42,plain,
join(X1,join(complement(X1),X2)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_24]),c_0_39]) ).
cnf(c_0_43,plain,
join(complement(X1),complement(join(X2,X1))) = complement(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]) ).
cnf(c_0_44,plain,
meet(X1,join(complement(X1),meet(X2,complement(meet(X1,X2))))) = zero,
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_36,c_0_22]),c_0_20]),c_0_16]),c_0_20]),c_0_22]),c_0_21]) ).
cnf(c_0_45,plain,
( join(X1,X2) != one
| meet(X2,X1) != zero
| complement(X1) = X2 ),
inference(spm,[status(thm)],[c_0_40,c_0_19]) ).
cnf(c_0_46,plain,
meet(complement(X1),complement(join(X2,X1))) = complement(join(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_43]),c_0_19]) ).
cnf(c_0_47,plain,
join(complement(X1),meet(X2,complement(meet(X1,X2)))) = complement(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_44]),c_0_42])]) ).
cnf(c_0_48,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_16]),c_0_21]),c_0_24])]) ).
cnf(c_0_49,plain,
meet(complement(X1),complement(meet(X1,X2))) = complement(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_17]),c_0_19]) ).
cnf(c_0_50,plain,
join(X1,meet(X2,complement(meet(complement(X1),X2)))) = X1,
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_51,plain,
meet(X1,complement(meet(complement(X1),X2))) = X1,
inference(spm,[status(thm)],[c_0_49,c_0_48]) ).
cnf(c_0_52,plain,
meet(X1,meet(X2,X1)) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_15,c_0_19]) ).
cnf(c_0_53,plain,
join(X1,meet(X2,complement(meet(X2,complement(X1))))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_27]),c_0_29]),c_0_30]) ).
cnf(c_0_54,plain,
meet(X1,complement(meet(X2,complement(X1)))) = X1,
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,plain,
meet(X1,complement(join(X1,X2))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_26]),c_0_19]) ).
cnf(c_0_56,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_19]) ).
cnf(c_0_57,plain,
meet(X1,complement(meet(X1,complement(X2)))) = meet(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_53]),c_0_13]),c_0_19]),c_0_54]) ).
cnf(c_0_58,plain,
meet(X1,meet(X2,complement(join(meet(X1,X2),X3)))) = zero,
inference(spm,[status(thm)],[c_0_13,c_0_55]) ).
cnf(c_0_59,plain,
join(X1,join(X2,X1)) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_26]),c_0_38]) ).
cnf(c_0_60,plain,
join(X1,one) = one,
inference(spm,[status(thm)],[c_0_39,c_0_21]) ).
cnf(c_0_61,plain,
meet(X1,complement(meet(X1,X2))) = meet(X1,complement(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_57]),c_0_15]) ).
cnf(c_0_62,plain,
meet(X1,complement(join(X2,meet(X1,complement(X2))))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_46]),c_0_21]) ).
cnf(c_0_63,plain,
join(complement(X1),join(X2,X1)) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_42]),c_0_60]),c_0_38]) ).
cnf(c_0_64,plain,
meet(X1,join(X2,meet(X1,complement(X2)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_29]),c_0_30]),c_0_48]) ).
cnf(c_0_65,plain,
join(X1,complement(meet(X1,X2))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_17]),c_0_21]) ).
cnf(c_0_66,plain,
join(X1,meet(X2,complement(X1))) = join(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_64]),c_0_38]),c_0_21]),c_0_17]) ).
cnf(c_0_67,plain,
( meet(X1,complement(X2)) != zero
| meet(X1,X2) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_61]),c_0_48]),c_0_21]),c_0_65])]) ).
cnf(c_0_68,plain,
join(X1,meet(complement(X1),X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_66,c_0_19]) ).
cnf(c_0_69,plain,
meet(X1,complement(meet(X2,X1))) = meet(X1,complement(X2)),
inference(spm,[status(thm)],[c_0_61,c_0_19]) ).
cnf(c_0_70,plain,
join(X1,complement(meet(X2,complement(X1)))) = complement(meet(X2,complement(X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_54]),c_0_21]) ).
cnf(c_0_71,plain,
( meet(X1,X2) != zero
| meet(X1,complement(X2)) = X1 ),
inference(spm,[status(thm)],[c_0_67,c_0_48]) ).
cnf(c_0_72,plain,
complement(meet(X1,complement(X2))) = join(X2,complement(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_68]),c_0_70]) ).
cnf(c_0_73,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_74,plain,
( meet(X2,complement(X1)) != zero
| meet(X1,X2) = X2 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_69]),c_0_48]),c_0_52]) ).
cnf(c_0_75,plain,
complement(meet(X1,X2)) = join(complement(X2),complement(X1)),
inference(spm,[status(thm)],[c_0_72,c_0_48]) ).
cnf(c_0_76,plain,
meet(X1,join(X2,join(X3,X1))) = X1,
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_31,c_0_33]),c_0_33]),c_0_38]),c_0_73]),c_0_33]),c_0_33]) ).
cnf(c_0_77,plain,
( meet(complement(X1),X2) != zero
| meet(X1,X2) = X2 ),
inference(spm,[status(thm)],[c_0_74,c_0_19]) ).
cnf(c_0_78,plain,
meet(X1,meet(X2,join(complement(X2),complement(X1)))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_75]),c_0_13]) ).
cnf(c_0_79,plain,
meet(X1,meet(X2,join(X3,X1))) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_17]),c_0_13]) ).
cnf(c_0_80,plain,
meet(X1,join(complement(X1),X2)) = meet(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_48]),c_0_79]),c_0_48]) ).
cnf(c_0_81,plain,
join(X1,join(meet(X2,complement(X1)),X3)) = join(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_66]),c_0_38]) ).
cnf(c_0_82,plain,
join(X1,join(meet(X2,X1),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_38,c_0_56]) ).
cnf(c_0_83,plain,
meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_13,c_0_26]) ).
cnf(c_0_84,plain,
join(X1,join(X2,X3)) = join(X2,join(X3,X1)),
inference(spm,[status(thm)],[c_0_38,c_0_21]) ).
cnf(c_0_85,plain,
meet(X1,join(meet(X2,X1),X3)) = meet(join(X2,X3),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_80]),c_0_48]),c_0_19]) ).
cnf(c_0_86,plain,
join(meet(X1,X2),join(X3,meet(join(X1,X4),X2))) = join(meet(join(X1,X4),X2),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84]) ).
cnf(c_0_87,plain,
join(X1,join(meet(X1,X2),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_38,c_0_17]) ).
cnf(c_0_88,plain,
join(X1,meet(join(X2,X1),X3)) = join(meet(X2,X3),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_85]),c_0_38]),c_0_86]),c_0_21]) ).
cnf(c_0_89,plain,
meet(join(X1,X2),join(meet(X1,X3),X2)) = join(meet(X1,X3),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_87]),c_0_19]) ).
cnf(c_0_90,plain,
meet(X1,meet(X2,join(X1,X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_83,c_0_19]) ).
cnf(c_0_91,plain,
join(X1,meet(X2,join(X3,X1))) = meet(join(X2,X1),join(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_31,c_0_88]),c_0_88]),c_0_89]),c_0_82]),c_0_89]),c_0_21]) ).
cnf(c_0_92,plain,
meet(X1,join(X2,meet(X3,X1))) = meet(join(X3,X2),X1),
inference(spm,[status(thm)],[c_0_85,c_0_21]) ).
cnf(c_0_93,plain,
meet(join(X1,X2),join(X2,X3)) = join(meet(X3,X1),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_52]),c_0_90]),c_0_91]) ).
cnf(c_0_94,plain,
meet(X1,join(meet(X1,X2),X3)) = meet(join(X2,X3),X1),
inference(spm,[status(thm)],[c_0_85,c_0_19]) ).
cnf(c_0_95,negated_conjecture,
meet(a,join(b,c)) != join(meet(a,b),meet(a,c)),
inference(fof_simplification,[status(thm)],[prove_distributivity]) ).
cnf(c_0_96,plain,
meet(join(X1,X2),join(X3,X2)) = join(meet(X1,X3),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_13]),c_0_19]),c_0_26]) ).
cnf(c_0_97,plain,
meet(X1,join(X2,meet(X1,X3))) = meet(join(X3,X2),X1),
inference(spm,[status(thm)],[c_0_94,c_0_21]) ).
cnf(c_0_98,negated_conjecture,
meet(a,join(b,c)) != join(meet(a,b),meet(a,c)),
c_0_95 ).
cnf(c_0_99,plain,
join(meet(X1,X2),meet(X1,X3)) = meet(join(X3,X2),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_17]),c_0_97]) ).
cnf(c_0_100,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_99]),c_0_21]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : LAT209-1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.05/10.33 % Computer : n012.cluster.edu
% 0.05/10.33 % Model : x86_64 x86_64
% 0.05/10.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/10.33 % Memory : 8046.5625MB
% 0.05/10.33 % OS : Linux 6.8.0-71-generic
% 0.05/10.33 % CPULimit : 300
% 0.05/10.33 % WCLimit : 300
% 0.05/10.33 % DateTime : Sun Sep 20 23:20:18 UTC 2026
% 0.05/10.34 % CPUTime :
% 0.05/10.34 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.05/10.38 Running first-order theorem proving
% 0.05/10.38 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/benchmark/theBenchmark.p
% 5.18/11.13 % Version: 3.5.1
% 5.18/11.13 % Preprocessing class: FSSSSMSSSSSNFFN.
% 5.18/11.13 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.18/11.13 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 5.18/11.13 % Starting new_bool_3 with 300s (1) cores
% 5.18/11.13 % Starting new_bool_1 with 300s (1) cores
% 5.18/11.13 % Starting sh5l with 300s (1) cores
% 5.18/11.13 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1064574 completed with status 0
% 5.18/11.13 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 5.18/11.13 % Preprocessing class: FSSSSMSSSSSNFFN.
% 5.18/11.13 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.18/11.13 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 5.18/11.13 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.18/11.13 % No SInE strategy applied
% 5.18/11.13 % Search class: FHUPM-FFSF21-DFFFFFNN
% 5.18/11.13 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 5.18/11.13 % Starting SubtermCWHack with 136s (1) cores
% 5.18/11.13 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 5.18/11.13 % Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 5.18/11.13 % Starting new_bool_3 with 136s (1) cores
% 5.18/11.13 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 5.18/11.13 % G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with pid 1064580 completed with status 0
% 5.18/11.13 % Result found by G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S
% 5.18/11.13 % Preprocessing class: FSSSSMSSSSSNFFN.
% 5.18/11.13 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.18/11.13 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 5.18/11.13 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.18/11.13 % No SInE strategy applied
% 5.18/11.13 % Search class: FHUPM-FFSF21-DFFFFFNN
% 5.18/11.13 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 5.18/11.13 % Starting SubtermCWHack with 136s (1) cores
% 5.18/11.13 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 5.18/11.13 % Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 5.18/11.13 % Preprocessing time : 0.001 s
% 5.18/11.13 % Presaturation interreduction done
% 5.18/11.13
% 5.18/11.13 % Proof found!
% 5.18/11.13 % SZS status Unsatisfiable
% 5.18/11.13 % SZS output start CNFRefutation
% See solution above
% 5.18/11.13 % Parsed axioms : 13
% 5.18/11.13 % Removed by relevancy pruning/SinE : 0
% 5.18/11.13 % Initial clauses : 13
% 5.18/11.13 % Removed in clause preprocessing : 0
% 5.18/11.13 % Initial clauses in saturation : 13
% 5.18/11.13 % Processed clauses : 3897
% 5.18/11.13 % ...of these trivial : 949
% 5.18/11.13 % ...subsumed : 2494
% 5.18/11.13 % ...remaining for further processing : 454
% 5.18/11.13 % Other redundant clauses eliminated : 0
% 5.18/11.13 % Clauses deleted for lack of memory : 0
% 5.18/11.13 % Backward-subsumed : 0
% 5.18/11.13 % Backward-rewritten : 184
% 5.18/11.13 % Generated clauses : 51641
% 5.18/11.13 % ...of the previous two non-redundant : 29342
% 5.18/11.13 % ...aggressively subsumed : 0
% 5.18/11.13 % Contextual simplify-reflections : 0
% 5.18/11.13 % Paramodulations : 51606
% 5.18/11.13 % Factorizations : 0
% 5.18/11.13 % NegExts : 0
% 5.18/11.13 % Equation resolutions : 35
% 5.18/11.13 % Disequality decompositions : 0
% 5.18/11.13 % Total rewrite steps : 127916
% 5.18/11.13 % ...of those cached : 108266
% 5.18/11.13 % Propositional unsat checks : 0
% 5.18/11.13 % Propositional check models : 0
% 5.18/11.13 % Propositional check unsatisfiable : 0
% 5.18/11.13 % Propositional clauses : 0
% 5.18/11.13 % Propositional clauses after purity: 0
% 5.18/11.13 % Propositional unsat core size : 0
% 5.18/11.13 % Propositional preprocessing time : 0.000
% 5.18/11.13 % Propositional encoding time : 0.000
% 5.18/11.13 % Propositional solver time : 0.000
% 5.18/11.13 % Success case prop preproc time : 0.000
% 5.18/11.13 % Success case prop encoding time : 0.000
% 5.18/11.13 % Success case prop solver time : 0.000
% 5.18/11.13 % Current number of processed clauses : 257
% 5.18/11.13 % Positive orientable unit clauses : 139
% 5.18/11.13 % Positive unorientable unit clauses: 7
% 5.18/11.13 % Negative unit clauses : 0
% 5.18/11.13 % Non-unit-clauses : 111
% 5.18/11.13 % Current number of unprocessed clauses: 24283
% 5.18/11.13 % ...number of literals in the above : 29428
% 5.18/11.13 % Current number of archived formulas : 0
% 5.18/11.13 % Current number of archived clauses : 197
% 5.18/11.13 % Clause-clause subsumption calls (NU) : 13330
% 5.18/11.13 % Rec. Clause-clause subsumption calls : 13116
% 5.18/11.13 % Non-unit clause-clause subsumptions : 1875
% 5.18/11.13 % Unit Clause-clause subsumption calls : 153
% 5.18/11.13 % Rewrite failures with RHS unbound : 0
% 5.18/11.13 % BW rewrite match attempts : 1498
% 5.18/11.13 % BW rewrite match successes : 457
% 5.18/11.13 % Condensation attempts : 0
% 5.18/11.13 % Condensation successes : 0
% 5.18/11.13 % Termbank termtop insertions : 647124
% 5.18/11.13 % Search garbage collected termcells : 8
% 5.18/11.13
% 5.18/11.13 % -------------------------------------------------
% 5.18/11.13 % User time : 0.631 s
% 5.18/11.13 % System time : 0.021 s
% 5.18/11.13 % Total time : 0.652 s
% 5.18/11.13 % Maximum resident set size: 3644 pages
% 5.18/11.13
% 5.18/11.13 % -------------------------------------------------
% 5.18/11.13 % User time : 3.240 s
% 5.18/11.13 % System time : 0.152 s
% 5.18/11.13 % Total time : 3.392 s
% 5.18/11.13 % Maximum resident set size: 4608 pages
% 5.18/11.13 % E exiting
%------------------------------------------------------------------------------