%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT399-2 : TPTP v9.3.1. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:05:16 PM UTC 2026
% Result : Unsatisfiable 210.55s 33.17s
% Output : CNFRefutation 210.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of clauses : 87 ( 87 unt; 0 nHn; 12 RR)
% Number of literals : 87 ( 86 equ; 11 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 198 ( 21 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(conjecture,negated_conjecture,
join(upme(meet(a,X1),X2,X3),meet(X2,X3)) = meet(join(meet(meet(a,X1),X2),X3),join(meet(meet(a,X1),X3),X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conjecture) ).
cnf(definition_of_upme,axiom,
upme(X1,X2,X3) = meet(X1,join(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_of_upme) ).
cnf(absorption_003,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',absorption_003) ).
cnf(absorption,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',absorption) ).
cnf(commutativity_001,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_001) ).
cnf(commutativity,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity) ).
cnf(associativity,axiom,
meet(X1,meet(X2,X3)) = meet(meet(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity) ).
cnf(associativity_002,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_002) ).
cnf(conjecture_1,negated_conjecture,
upme(meet(a,z1),z2,z3) != lome(meet(a,z1),z2,z3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conjecture_1) ).
cnf(definition_of_lome,axiom,
lome(X1,X2,X3) = join(meet(X1,X2),meet(X1,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_of_lome) ).
cnf(c_0_10,negated_conjecture,
join(upme(meet(a,X1),X2,X3),meet(X2,X3)) = meet(join(meet(meet(a,X1),X2),X3),join(meet(meet(a,X1),X3),X2)),
conjecture ).
cnf(c_0_11,axiom,
upme(X1,X2,X3) = meet(X1,join(X2,X3)),
definition_of_upme ).
cnf(c_0_12,axiom,
meet(X1,join(X1,X2)) = X1,
absorption_003 ).
cnf(c_0_13,axiom,
join(X1,meet(X1,X2)) = X1,
absorption ).
cnf(c_0_14,axiom,
join(X1,X2) = join(X2,X1),
commutativity_001 ).
cnf(c_0_15,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity ).
cnf(c_0_16,negated_conjecture,
join(meet(meet(a,X1),join(X2,X3)),meet(X2,X3)) = meet(join(meet(meet(a,X1),X2),X3),join(meet(meet(a,X1),X3),X2)),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,axiom,
meet(X1,meet(X2,X3)) = meet(meet(X1,X2),X3),
associativity ).
cnf(c_0_18,plain,
meet(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_20,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_21,negated_conjecture,
meet(join(meet(a,meet(X1,X2)),X3),join(meet(a,meet(X1,X3)),X2)) = join(meet(X2,X3),meet(a,meet(X1,join(X2,X3)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17]),c_0_17]),c_0_14]) ).
cnf(c_0_22,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
meet(X1,meet(X2,X1)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_13]),c_0_17]) ).
cnf(c_0_24,plain,
join(X1,meet(X2,meet(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_17]) ).
cnf(c_0_25,negated_conjecture,
meet(join(meet(a,X1),X2),join(meet(a,X2),X1)) = join(meet(X1,X2),meet(a,join(X1,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_22]),c_0_22]) ).
cnf(c_0_26,plain,
meet(X1,meet(X2,meet(X1,X3))) = meet(X1,meet(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_23]),c_0_17]),c_0_17]) ).
cnf(c_0_27,plain,
join(X1,meet(X2,meet(X1,X3))) = X1,
inference(spm,[status(thm)],[c_0_24,c_0_15]) ).
cnf(c_0_28,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
associativity_002 ).
cnf(c_0_29,negated_conjecture,
join(meet(a,X1),meet(X1,meet(a,X2))) = meet(a,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(spm,[status(thm)],[c_0_25,c_0_13]),c_0_17]),c_0_22]),c_0_17]),c_0_19]),c_0_17]),c_0_26]),c_0_17]),c_0_27]),c_0_14]) ).
cnf(c_0_30,plain,
join(X1,join(X2,X1)) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_12]),c_0_28]) ).
cnf(c_0_31,plain,
join(X1,join(meet(X2,X1),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_28,c_0_20]) ).
cnf(c_0_32,negated_conjecture,
join(meet(a,X1),meet(a,meet(X2,X1))) = meet(a,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_15]),c_0_17]) ).
cnf(c_0_33,negated_conjecture,
upme(meet(a,z1),z2,z3) != lome(meet(a,z1),z2,z3),
inference(fof_simplification,[status(thm)],[conjecture_1]) ).
cnf(c_0_34,negated_conjecture,
meet(join(meet(a,join(meet(X1,X2),meet(a,meet(X3,join(X1,X2))))),X4),join(meet(a,meet(X3,X2)),join(X1,meet(a,meet(join(meet(a,meet(X3,X1)),X2),X4))))) = join(meet(join(meet(a,meet(X3,X2)),X1),X4),meet(a,meet(join(meet(a,meet(X3,X1)),X2),join(meet(a,meet(X3,X2)),join(X1,X4))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_21]),c_0_28]),c_0_14]),c_0_28]) ).
cnf(c_0_35,plain,
join(meet(X1,X2),meet(X1,meet(X2,X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_13,c_0_17]) ).
cnf(c_0_36,plain,
meet(X1,meet(X2,join(meet(X1,X2),X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_37,plain,
join(X1,join(X2,join(X1,X3))) = join(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_30]),c_0_28]),c_0_28]) ).
cnf(c_0_38,negated_conjecture,
join(meet(a,X1),join(X2,meet(a,join(X1,X2)))) = join(meet(a,X1),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_25]),c_0_28]),c_0_31]) ).
cnf(c_0_39,negated_conjecture,
join(meet(a,X1),meet(a,join(X1,X2))) = meet(a,join(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_12]),c_0_14]) ).
cnf(c_0_40,negated_conjecture,
upme(meet(a,z1),z2,z3) != lome(meet(a,z1),z2,z3),
c_0_33 ).
cnf(c_0_41,axiom,
lome(X1,X2,X3) = join(meet(X1,X2),meet(X1,X3)),
definition_of_lome ).
cnf(c_0_42,negated_conjecture,
join(meet(a,X1),meet(a,join(X2,X1))) = meet(a,join(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_19]),c_0_14]) ).
cnf(c_0_43,negated_conjecture,
join(meet(a,X1),meet(a,X2)) = meet(a,join(meet(a,X2),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(spm,[status(thm)],[c_0_34,c_0_35]),c_0_22]),c_0_18]),c_0_23]),c_0_14]),c_0_20]),c_0_13]),c_0_14]),c_0_13]),c_0_18]),c_0_14]),c_0_13]),c_0_23]),c_0_14]),c_0_20]),c_0_18]),c_0_36]),c_0_15]) ).
cnf(c_0_44,negated_conjecture,
join(X1,meet(a,join(X2,X1))) = join(X1,meet(a,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_30]),c_0_39]) ).
cnf(c_0_45,negated_conjecture,
join(meet(meet(a,z1),z2),meet(meet(a,z1),z3)) != meet(meet(a,z1),join(z2,z3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_11]),c_0_41]) ).
cnf(c_0_46,negated_conjecture,
join(meet(a,meet(X1,X2)),join(X3,meet(a,meet(X1,join(X2,X3))))) = join(meet(a,meet(X1,X2)),X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_21]),c_0_28]),c_0_31]) ).
cnf(c_0_47,negated_conjecture,
meet(a,join(X1,meet(a,X2))) = meet(a,join(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43]),c_0_14]),c_0_44]) ).
cnf(c_0_48,negated_conjecture,
join(meet(z2,meet(a,z1)),meet(z3,meet(a,z1))) != meet(meet(a,z1),join(z2,z3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_15]),c_0_15]) ).
cnf(c_0_49,negated_conjecture,
join(X1,meet(a,join(X1,X2))) = join(X1,meet(a,X2)),
inference(spm,[status(thm)],[c_0_44,c_0_14]) ).
cnf(c_0_50,plain,
join(X1,join(X2,meet(join(X1,X2),X3))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_13,c_0_28]) ).
cnf(c_0_51,negated_conjecture,
meet(a,join(meet(a,X1),X2)) = meet(a,join(X1,X2)),
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_46,c_0_47]),c_0_22]),c_0_22]),c_0_39]),c_0_43]),c_0_14]),c_0_44]),c_0_47]),c_0_22]),c_0_43]) ).
cnf(c_0_52,plain,
join(meet(X1,X2),meet(X1,meet(X3,X2))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_24,c_0_26]) ).
cnf(c_0_53,plain,
meet(join(X1,X2),join(X2,X1)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_19,c_0_30]) ).
cnf(c_0_54,negated_conjecture,
join(meet(z2,meet(a,z1)),meet(z3,meet(a,z1))) != meet(a,meet(z1,join(z2,z3))),
inference(rw,[status(thm)],[c_0_48,c_0_17]) ).
cnf(c_0_55,plain,
meet(X1,meet(X2,X3)) = meet(X3,meet(X1,X2)),
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_56,negated_conjecture,
join(X1,meet(a,join(X2,meet(join(X1,X2),X3)))) = join(X1,meet(a,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_49]) ).
cnf(c_0_57,negated_conjecture,
meet(join(meet(a,meet(X1,X2)),X3),join(meet(X3,X2),meet(a,meet(X1,join(X3,X2))))) = join(meet(X2,X3),meet(a,meet(X1,join(X2,X3)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_21]),c_0_21]) ).
cnf(c_0_58,negated_conjecture,
join(meet(a,X1),meet(a,X2)) = meet(a,join(X2,X1)),
inference(rw,[status(thm)],[c_0_43,c_0_51]) ).
cnf(c_0_59,plain,
join(meet(X1,X2),meet(X1,join(X2,X3))) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_12]),c_0_14]) ).
cnf(c_0_60,plain,
meet(X1,meet(X2,join(X3,meet(X1,X2)))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_61,plain,
meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_17,c_0_12]) ).
cnf(c_0_62,plain,
meet(join(X1,X2),meet(X3,join(X2,X1))) = meet(join(X1,X2),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_53]),c_0_23]) ).
cnf(c_0_63,negated_conjecture,
join(meet(a,meet(z1,z2)),meet(a,meet(z1,z3))) != meet(a,meet(z1,join(z2,z3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55]),c_0_55]) ).
cnf(c_0_64,negated_conjecture,
meet(a,join(X1,meet(X2,join(X3,X1)))) = meet(a,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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_31]),c_0_47]),c_0_14]),c_0_58]),c_0_28]),c_0_14]),c_0_59]),c_0_43]),c_0_51]) ).
cnf(c_0_65,plain,
join(meet(X1,X2),meet(X2,join(X3,meet(X1,X2)))) = meet(X2,join(X3,meet(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_60]),c_0_14]) ).
cnf(c_0_66,plain,
join(meet(X1,X2),meet(X2,X1)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_20,c_0_23]) ).
cnf(c_0_67,plain,
join(meet(X1,X2),meet(join(X1,X3),X2)) = meet(join(X1,X3),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_61]),c_0_14]) ).
cnf(c_0_68,plain,
meet(join(X1,X2),X3) = meet(X3,join(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_53]),c_0_62]) ).
cnf(c_0_69,negated_conjecture,
meet(a,join(meet(z1,z2),meet(a,meet(z1,z3)))) != meet(a,meet(z1,join(z2,z3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_43]),c_0_14]) ).
cnf(c_0_70,negated_conjecture,
meet(a,join(meet(X1,X2),meet(X2,X3))) = meet(a,meet(X2,join(X3,meet(X1,X2)))),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_71,plain,
join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
inference(spm,[status(thm)],[c_0_14,c_0_28]) ).
cnf(c_0_72,plain,
join(meet(X1,X2),join(X3,meet(X2,X1))) = join(meet(X1,X2),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_66]),c_0_30]) ).
cnf(c_0_73,plain,
join(X1,meet(join(X1,X2),join(X3,X1))) = meet(join(X1,X2),join(X3,X1)),
inference(spm,[status(thm)],[c_0_67,c_0_19]) ).
cnf(c_0_74,negated_conjecture,
meet(a,join(X1,meet(join(X1,X2),X3))) = meet(a,join(X1,meet(X3,X2))),
inference(spm,[status(thm)],[c_0_64,c_0_68]) ).
cnf(c_0_75,negated_conjecture,
meet(a,join(meet(z1,z2),meet(z1,z3))) != meet(a,meet(z1,join(z2,z3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_47]),c_0_14]) ).
cnf(c_0_76,negated_conjecture,
meet(a,join(meet(X1,X2),meet(X1,X3))) = meet(a,meet(X1,join(X3,meet(X1,X2)))),
inference(spm,[status(thm)],[c_0_70,c_0_15]) ).
cnf(c_0_77,plain,
join(meet(X1,X2),X3) = join(X3,meet(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_66]),c_0_72]) ).
cnf(c_0_78,plain,
meet(X1,meet(X2,meet(X3,join(meet(X1,X3),X4)))) = meet(X1,meet(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_36]),c_0_26]) ).
cnf(c_0_79,negated_conjecture,
meet(a,meet(join(X1,X2),join(X3,X1))) = meet(a,join(X1,meet(X3,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_73]),c_0_74]) ).
cnf(c_0_80,negated_conjecture,
meet(a,meet(z1,join(z3,meet(z1,z2)))) != meet(a,meet(z1,join(z2,z3))),
inference(rw,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_81,negated_conjecture,
meet(a,meet(X1,join(X2,meet(X1,X3)))) = meet(a,meet(X1,join(X3,meet(X2,X1)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_77]),c_0_76]) ).
cnf(c_0_82,plain,
meet(X1,meet(X2,X3)) = meet(X2,meet(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_15]),c_0_17]) ).
cnf(c_0_83,negated_conjecture,
meet(X1,meet(a,join(X2,meet(X1,X3)))) = meet(X1,meet(a,join(X2,X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_17]),c_0_15]),c_0_19]) ).
cnf(c_0_84,negated_conjecture,
meet(a,meet(z1,join(z2,meet(z1,z3)))) != meet(a,meet(z1,join(z2,z3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_81]),c_0_15]) ).
cnf(c_0_85,negated_conjecture,
meet(a,meet(X1,join(X2,meet(X1,X3)))) = meet(X1,meet(a,join(X2,X3))),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_86,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_85]),c_0_82])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LAT399-2 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n007.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 20 23:57:06 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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
% 210.55/33.17 % Version: 3.5.1
% 210.55/33.17 % Preprocessing class: FSMSSMSSSSSNFFN.
% 210.55/33.17 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 210.55/33.17 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 210.55/33.17 % Starting new_bool_3 with 300s (1) cores
% 210.55/33.17 % Starting new_bool_1 with 300s (1) cores
% 210.55/33.17 % Starting sh5l with 300s (1) cores
% 210.55/33.17 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3915037 completed with status 0
% 210.55/33.17 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 210.55/33.17 % Preprocessing class: FSMSSMSSSSSNFFN.
% 210.55/33.17 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 210.55/33.17 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 210.55/33.17 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 210.55/33.17 % No SInE strategy applied
% 210.55/33.17 % Search class: FUUPM-FFSF22-MFFFFFNN
% 210.55/33.17 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 210.55/33.17 % Starting SubtermCWHack with 136s (1) cores
% 210.55/33.17 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 210.55/33.17 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 210.55/33.17 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 210.55/33.17 % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 210.55/33.17 % E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with pid 3915044 completed with status 0
% 210.55/33.17 % Result found by E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S
% 210.55/33.17 % Preprocessing class: FSMSSMSSSSSNFFN.
% 210.55/33.17 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 210.55/33.17 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 210.55/33.17 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 210.55/33.17 % No SInE strategy applied
% 210.55/33.17 % Search class: FUUPM-FFSF22-MFFFFFNN
% 210.55/33.17 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 210.55/33.17 % Starting SubtermCWHack with 136s (1) cores
% 210.55/33.17 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 210.55/33.17 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 210.55/33.17 % Preprocessing time : 0.001 s
% 210.55/33.17 % Presaturation interreduction done
% 210.55/33.17
% 210.55/33.17 % Proof found!
% 210.55/33.17 % SZS status Unsatisfiable
% 210.55/33.17 % SZS output start CNFRefutation
% See solution above
% 210.55/33.17 % Parsed axioms : 12
% 210.55/33.17 % Removed by relevancy pruning/SinE : 0
% 210.55/33.17 % Initial clauses : 12
% 210.55/33.17 % Removed in clause preprocessing : 4
% 210.55/33.17 % Initial clauses in saturation : 8
% 210.55/33.17 % Processed clauses : 28338
% 210.55/33.17 % ...of these trivial : 15553
% 210.55/33.17 % ...subsumed : 11821
% 210.55/33.17 % ...remaining for further processing : 964
% 210.55/33.17 % Other redundant clauses eliminated : 0
% 210.55/33.17 % Clauses deleted for lack of memory : 0
% 210.55/33.17 % Backward-subsumed : 0
% 210.55/33.17 % Backward-rewritten : 202
% 210.55/33.17 % Generated clauses : 888995
% 210.55/33.17 % ...of the previous two non-redundant : 608254
% 210.55/33.17 % ...aggressively subsumed : 0
% 210.55/33.17 % Contextual simplify-reflections : 0
% 210.55/33.17 % Paramodulations : 888995
% 210.55/33.17 % Factorizations : 0
% 210.55/33.17 % NegExts : 0
% 210.55/33.17 % Equation resolutions : 0
% 210.55/33.17 % Disequality decompositions : 0
% 210.55/33.17 % Total rewrite steps : 2460530
% 210.55/33.17 % ...of those cached : 2131837
% 210.55/33.17 % Propositional unsat checks : 0
% 210.55/33.17 % Propositional check models : 0
% 210.55/33.17 % Propositional check unsatisfiable : 0
% 210.55/33.17 % Propositional clauses : 0
% 210.55/33.17 % Propositional clauses after purity: 0
% 210.55/33.17 % Propositional unsat core size : 0
% 210.55/33.17 % Propositional preprocessing time : 0.000
% 210.55/33.17 % Propositional encoding time : 0.000
% 210.55/33.17 % Propositional solver time : 0.000
% 210.55/33.17 % Success case prop preproc time : 0.000
% 210.55/33.17 % Success case prop encoding time : 0.000
% 210.55/33.17 % Success case prop solver time : 0.000
% 210.55/33.17 % Current number of processed clauses : 754
% 210.55/33.17 % Positive orientable unit clauses : 744
% 210.55/33.17 % Positive unorientable unit clauses: 10
% 210.55/33.17 % Negative unit clauses : 0
% 210.55/33.17 % Non-unit-clauses : 0
% 210.55/33.17 % Current number of unprocessed clauses: 577726
% 210.55/33.17 % ...number of literals in the above : 577726
% 210.55/33.17 % Current number of archived formulas : 0
% 210.55/33.17 % Current number of archived clauses : 214
% 210.55/33.17 % Clause-clause subsumption calls (NU) : 0
% 210.55/33.17 % Rec. Clause-clause subsumption calls : 0
% 210.55/33.17 % Non-unit clause-clause subsumptions : 0
% 210.55/33.17 % Unit Clause-clause subsumption calls : 548
% 210.55/33.17 % Rewrite failures with RHS unbound : 0
% 210.55/33.17 % BW rewrite match attempts : 15599
% 210.55/33.17 % BW rewrite match successes : 1014
% 210.55/33.17 % Condensation attempts : 0
% 210.55/33.17 % Condensation successes : 0
% 210.55/33.17 % Termbank termtop insertions : 19058506
% 210.55/33.17 % Search garbage collected termcells : 2
% 210.55/33.17
% 210.55/33.17 % -------------------------------------------------
% 210.55/33.17 % User time : 31.139 s
% 210.55/33.17 % System time : 0.998 s
% 210.55/33.17 % Total time : 32.137 s
% 210.55/33.17 % Maximum resident set size: 3628 pages
% 210.55/33.17
% 210.55/33.17 % -------------------------------------------------
% 210.55/33.17 % User time : 140.856 s
% 210.55/33.17 % System time : 4.590 s
% 210.55/33.17 % Total time : 145.445 s
% 210.55/33.17 % Maximum resident set size: 4608 pages
% 210.55/33.17 % E exiting
%------------------------------------------------------------------------------