TSTP Solution File: LAT005-10 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LAT005-10 : TPTP v8.2.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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 May 20 23:25:23 EDT 2024
% Result : Unsatisfiable 61.49s 8.26s
% Output : CNFRefutation 61.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 19
% Syntax : Number of clauses : 127 ( 127 unt; 0 nHn; 30 RR)
% Number of literals : 127 ( 126 equ; 7 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-4 aty)
% Number of variables : 199 ( 41 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(complement_meet,axiom,
ifeq(complement(X1,X2),true,meet(X1,X2),n0) = n0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',complement_meet) ).
cnf(complement_of_a_join_b,hypothesis,
complement(r1,join(a,b)) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',complement_of_a_join_b) ).
cnf(ifeq_axiom_002,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom_002) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_of_meet) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',absorption1) ).
cnf(modular,axiom,
ifeq3(meet(X1,X2),X1,meet(X2,join(X1,X3)),join(X1,meet(X3,X2))) = join(X1,meet(X3,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',modular) ).
cnf(x_join_0,axiom,
join(X1,n0) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x_join_0) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_join) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_meet) ).
cnf(ifeq_axiom,axiom,
ifeq3(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',absorption2) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_of_join) ).
cnf(complement_of_a_meet_b,hypothesis,
complement(r2,meet(a,b)) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',complement_of_a_meet_b) ).
cnf(x_meet_0,axiom,
meet(X1,n0) = n0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x_meet_0) ).
cnf(complement_join,axiom,
ifeq(complement(X1,X2),true,join(X1,X2),n1) = n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',complement_join) ).
cnf(x_meet_1,axiom,
meet(X1,n1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x_meet_1) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_of_meet) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_of_join) ).
cnf(prove_lemma,negated_conjecture,
r1 != meet(join(r1,meet(r2,b)),join(r1,meet(r2,a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lemma) ).
cnf(c_0_19,axiom,
ifeq(complement(X1,X2),true,meet(X1,X2),n0) = n0,
complement_meet ).
cnf(c_0_20,hypothesis,
complement(r1,join(a,b)) = true,
complement_of_a_join_b ).
cnf(c_0_21,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom_002 ).
cnf(c_0_22,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_23,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_24,axiom,
ifeq3(meet(X1,X2),X1,meet(X2,join(X1,X3)),join(X1,meet(X3,X2))) = join(X1,meet(X3,X2)),
modular ).
cnf(c_0_25,hypothesis,
meet(r1,join(a,b)) = n0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_26,axiom,
join(X1,n0) = X1,
x_join_0 ).
cnf(c_0_27,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_28,plain,
meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_30,hypothesis,
ifeq3(meet(X1,join(a,b)),X1,meet(join(a,b),join(X1,r1)),X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_26]) ).
cnf(c_0_31,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_27]) ).
cnf(c_0_32,axiom,
ifeq3(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_33,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_34,plain,
meet(X1,meet(X2,join(X1,X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,hypothesis,
meet(join(r1,b),join(a,b)) = b,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_27]),c_0_32]),c_0_29]) ).
cnf(c_0_36,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_37,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_33,c_0_29]) ).
cnf(c_0_38,plain,
join(meet(X1,X2),meet(X1,meet(X2,X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_33,c_0_22]) ).
cnf(c_0_39,hypothesis,
meet(a,join(r1,b)) = meet(a,b),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,hypothesis,
complement(r2,meet(a,b)) = true,
complement_of_a_meet_b ).
cnf(c_0_41,axiom,
meet(X1,n0) = n0,
x_meet_0 ).
cnf(c_0_42,plain,
join(X1,join(meet(X2,X1),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,hypothesis,
join(meet(a,b),meet(a,meet(join(r1,b),X1))) = meet(a,b),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,plain,
ifeq3(meet(X1,X2),X1,meet(X2,join(X1,X3)),join(X1,meet(X2,X3))) = join(X1,meet(X2,X3)),
inference(spm,[status(thm)],[c_0_24,c_0_29]) ).
cnf(c_0_45,hypothesis,
meet(r2,meet(a,b)) = n0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_40]),c_0_21]) ).
cnf(c_0_46,plain,
meet(n0,X1) = n0,
inference(spm,[status(thm)],[c_0_41,c_0_29]) ).
cnf(c_0_47,hypothesis,
join(b,meet(a,meet(join(r1,b),X1))) = b,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_37]) ).
cnf(c_0_48,plain,
meet(join(X1,X2),join(X1,X3)) = join(X1,meet(X3,join(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_23]),c_0_32]) ).
cnf(c_0_49,plain,
meet(join(X1,X2),join(X2,X3)) = join(X2,meet(join(X1,X2),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_31]),c_0_32]) ).
cnf(c_0_50,hypothesis,
meet(r2,meet(a,meet(b,X1))) = n0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_45]),c_0_46]),c_0_22]) ).
cnf(c_0_51,hypothesis,
join(b,meet(a,join(r1,meet(X1,join(r1,b))))) = b,
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,plain,
join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
inference(spm,[status(thm)],[c_0_27,c_0_36]) ).
cnf(c_0_53,plain,
meet(X1,meet(X2,X1)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_33]),c_0_22]) ).
cnf(c_0_54,plain,
meet(X1,join(meet(X1,X2),X3)) = join(meet(X1,X2),meet(X1,X3)),
inference(spm,[status(thm)],[c_0_49,c_0_33]) ).
cnf(c_0_55,axiom,
ifeq(complement(X1,X2),true,join(X1,X2),n1) = n1,
complement_join ).
cnf(c_0_56,hypothesis,
meet(r2,meet(a,meet(X1,b))) = n0,
inference(spm,[status(thm)],[c_0_50,c_0_29]) ).
cnf(c_0_57,plain,
meet(X1,meet(X2,X3)) = meet(X2,meet(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_29]),c_0_22]) ).
cnf(c_0_58,plain,
meet(X1,meet(X2,X3)) = meet(X3,meet(X1,X2)),
inference(spm,[status(thm)],[c_0_29,c_0_22]) ).
cnf(c_0_59,hypothesis,
join(b,meet(a,join(r1,meet(join(r1,b),X1)))) = b,
inference(spm,[status(thm)],[c_0_51,c_0_29]) ).
cnf(c_0_60,hypothesis,
meet(join(r1,b),meet(join(a,b),X1)) = meet(b,X1),
inference(spm,[status(thm)],[c_0_22,c_0_35]) ).
cnf(c_0_61,plain,
meet(X1,meet(X2,join(meet(X1,X2),X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_62,plain,
join(X1,join(X2,X3)) = join(X3,join(X2,X1)),
inference(spm,[status(thm)],[c_0_52,c_0_27]) ).
cnf(c_0_63,plain,
join(meet(X1,X2),join(meet(X2,X1),X3)) = join(meet(X1,X2),X3),
inference(spm,[status(thm)],[c_0_42,c_0_53]) ).
cnf(c_0_64,plain,
join(meet(X1,X2),meet(X2,X1)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_37,c_0_53]) ).
cnf(c_0_65,plain,
meet(X1,join(X2,meet(X1,X3))) = join(meet(X1,X3),meet(X1,X2)),
inference(spm,[status(thm)],[c_0_54,c_0_27]) ).
cnf(c_0_66,hypothesis,
join(r2,meet(a,b)) = n1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_40]),c_0_21]) ).
cnf(c_0_67,axiom,
meet(X1,n1) = X1,
x_meet_1 ).
cnf(c_0_68,hypothesis,
meet(a,meet(b,meet(r2,X1))) = n0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57]),c_0_58]) ).
cnf(c_0_69,hypothesis,
join(b,meet(a,join(r1,meet(b,X1)))) = b,
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_70,plain,
meet(X1,meet(X2,join(meet(X2,X1),X3))) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_61,c_0_29]) ).
cnf(c_0_71,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_72,hypothesis,
meet(join(r1,a),join(a,b)) = a,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_23]),c_0_27]),c_0_32]),c_0_29]) ).
cnf(c_0_73,plain,
ifeq3(meet(X1,X2),X1,meet(join(X1,X3),X2),join(X1,meet(X3,X2))) = join(X1,meet(X3,X2)),
inference(spm,[status(thm)],[c_0_24,c_0_29]) ).
cnf(c_0_74,plain,
meet(join(X1,X2),join(X1,X3)) = join(X1,meet(join(X1,X2),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_23]),c_0_32]) ).
cnf(c_0_75,plain,
join(meet(X1,X2),X3) = join(X3,meet(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]) ).
cnf(c_0_76,hypothesis,
join(meet(a,b),meet(a,r2)) = a,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]) ).
cnf(c_0_77,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_78,hypothesis,
meet(a,meet(b,meet(X1,meet(r2,X2)))) = n0,
inference(spm,[status(thm)],[c_0_68,c_0_58]) ).
cnf(c_0_79,hypothesis,
join(b,meet(a,join(r1,meet(X1,b)))) = b,
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_80,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_22,c_0_71]) ).
cnf(c_0_81,hypothesis,
join(a,meet(join(r1,a),meet(join(a,b),X1))) = a,
inference(spm,[status(thm)],[c_0_38,c_0_72]) ).
cnf(c_0_82,plain,
meet(X1,meet(X2,join(X3,X1))) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_57,c_0_31]) ).
cnf(c_0_83,negated_conjecture,
r1 != meet(join(r1,meet(r2,b)),join(r1,meet(r2,a))),
inference(fof_simplification,[status(thm)],[prove_lemma]) ).
cnf(c_0_84,plain,
join(X1,meet(join(X1,X2),X3)) = join(X1,meet(X2,join(X1,X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_23]),c_0_32]),c_0_74]) ).
cnf(c_0_85,hypothesis,
meet(join(r1,b),meet(X1,join(a,b))) = meet(X1,b),
inference(spm,[status(thm)],[c_0_57,c_0_35]) ).
cnf(c_0_86,plain,
meet(X1,join(X2,meet(X3,X1))) = join(meet(X1,X3),meet(X1,X2)),
inference(spm,[status(thm)],[c_0_54,c_0_75]) ).
cnf(c_0_87,hypothesis,
join(b,meet(a,r2)) = join(a,b),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_76]),c_0_27]) ).
cnf(c_0_88,plain,
join(X1,join(X2,X1)) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_23]),c_0_36]) ).
cnf(c_0_89,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_36,c_0_77]) ).
cnf(c_0_90,hypothesis,
meet(a,meet(r2,meet(X1,meet(b,X2)))) = n0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_58]),c_0_22]) ).
cnf(c_0_91,hypothesis,
meet(a,meet(b,join(r1,meet(X1,b)))) = meet(a,join(r1,meet(X1,b))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_79]),c_0_22]),c_0_29]) ).
cnf(c_0_92,plain,
meet(X1,meet(X2,meet(X1,X3))) = meet(X2,meet(X1,X3)),
inference(spm,[status(thm)],[c_0_80,c_0_58]) ).
cnf(c_0_93,hypothesis,
meet(r1,meet(join(a,b),X1)) = n0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_25]),c_0_46]) ).
cnf(c_0_94,hypothesis,
join(a,meet(join(r1,a),meet(X1,join(a,b)))) = a,
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_95,negated_conjecture,
r1 != meet(join(r1,meet(r2,b)),join(r1,meet(r2,a))),
c_0_83 ).
cnf(c_0_96,hypothesis,
join(r1,meet(b,join(r1,meet(X1,join(a,b))))) = join(r1,meet(X1,b)),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_97,hypothesis,
meet(r2,join(a,b)) = join(meet(a,r2),meet(b,r2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_29]),c_0_29]) ).
cnf(c_0_98,plain,
meet(join(X1,X2),join(X3,X2)) = join(X2,meet(join(X1,X2),X3)),
inference(spm,[status(thm)],[c_0_49,c_0_27]) ).
cnf(c_0_99,plain,
join(X1,meet(join(X2,X1),X3)) = join(X1,meet(X2,join(X1,X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_88]),c_0_84]),c_0_49]),c_0_89]) ).
cnf(c_0_100,hypothesis,
meet(a,meet(r2,join(r1,meet(X1,b)))) = n0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_92]),c_0_57]) ).
cnf(c_0_101,hypothesis,
meet(r1,meet(X1,join(a,b))) = n0,
inference(spm,[status(thm)],[c_0_93,c_0_29]) ).
cnf(c_0_102,hypothesis,
meet(b,join(r1,a)) = meet(a,b),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_72]),c_0_29]),c_0_29]) ).
cnf(c_0_103,hypothesis,
meet(join(r1,a),join(a,meet(X1,join(a,b)))) = a,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_94]),c_0_31]),c_0_32]) ).
cnf(c_0_104,negated_conjecture,
meet(join(r1,meet(a,r2)),join(r1,meet(b,r2))) != r1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_29]),c_0_29]),c_0_29]) ).
cnf(c_0_105,plain,
meet(join(X1,X2),join(X1,join(X2,X3))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_23,c_0_36]) ).
cnf(c_0_106,hypothesis,
join(r1,meet(b,join(r1,join(meet(a,r2),meet(b,r2))))) = join(r1,meet(b,r2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_29]) ).
cnf(c_0_107,plain,
meet(join(X1,X2),join(X1,X3)) = join(X1,meet(X2,join(X1,X3))),
inference(rw,[status(thm)],[c_0_74,c_0_84]) ).
cnf(c_0_108,plain,
meet(join(X1,X2),join(X3,X2)) = join(X2,meet(X1,join(X2,X3))),
inference(rw,[status(thm)],[c_0_98,c_0_99]) ).
cnf(c_0_109,plain,
meet(X1,join(meet(X2,X1),X3)) = join(meet(X2,X1),meet(X1,X3)),
inference(spm,[status(thm)],[c_0_49,c_0_37]) ).
cnf(c_0_110,hypothesis,
meet(a,join(meet(r1,r2),meet(b,r2))) = n0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_65]),c_0_29]),c_0_29]),c_0_27]) ).
cnf(c_0_111,hypothesis,
meet(r1,b) = n0,
inference(spm,[status(thm)],[c_0_101,c_0_31]) ).
cnf(c_0_112,hypothesis,
meet(b,meet(join(r1,a),X1)) = meet(a,meet(b,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_102]),c_0_22]) ).
cnf(c_0_113,hypothesis,
meet(join(r1,a),meet(X1,join(a,b))) = meet(X1,a),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_103]),c_0_22]),c_0_29]),c_0_23]) ).
cnf(c_0_114,negated_conjecture,
join(r1,meet(b,meet(r2,join(r1,meet(a,r2))))) != r1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_104,c_0_74]),c_0_57]),c_0_29]) ).
cnf(c_0_115,plain,
meet(join(X1,X2),meet(X3,join(X1,join(X2,X4)))) = meet(X3,join(X1,X2)),
inference(spm,[status(thm)],[c_0_57,c_0_105]) ).
cnf(c_0_116,hypothesis,
meet(b,join(r1,join(meet(a,r2),meet(b,r2)))) = meet(b,r2),
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_31,c_0_106]),c_0_22]),c_0_107]),c_0_108]),c_0_22]),c_0_109]),c_0_29]),c_0_27]),c_0_110]),c_0_26]),c_0_65]),c_0_29]),c_0_111]),c_0_26]) ).
cnf(c_0_117,hypothesis,
meet(b,meet(X1,join(r1,a))) = meet(a,meet(b,X1)),
inference(spm,[status(thm)],[c_0_112,c_0_29]) ).
cnf(c_0_118,hypothesis,
join(r1,meet(a,join(r1,meet(X1,join(a,b))))) = join(r1,meet(X1,a)),
inference(spm,[status(thm)],[c_0_84,c_0_113]) ).
cnf(c_0_119,negated_conjecture,
join(r1,meet(b,join(meet(r1,r2),meet(a,r2)))) != r1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_86]),c_0_29]),c_0_29]),c_0_27]) ).
cnf(c_0_120,hypothesis,
meet(b,join(meet(r1,r2),meet(a,r2))) = meet(b,join(r1,meet(a,r2))),
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_115,c_0_116]),c_0_57]),c_0_29]),c_0_86]),c_0_29]),c_0_29]),c_0_27]) ).
cnf(c_0_121,hypothesis,
meet(b,join(r1,meet(a,join(r1,X1)))) = meet(a,meet(b,join(r1,X1))),
inference(spm,[status(thm)],[c_0_117,c_0_48]) ).
cnf(c_0_122,hypothesis,
join(r1,meet(a,join(r1,join(meet(a,r2),meet(b,r2))))) = join(r1,meet(a,r2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_97]),c_0_29]) ).
cnf(c_0_123,hypothesis,
meet(a,meet(b,r2)) = n0,
inference(rw,[status(thm)],[c_0_45,c_0_58]) ).
cnf(c_0_124,negated_conjecture,
join(r1,meet(b,join(r1,meet(a,r2)))) != r1,
inference(rw,[status(thm)],[c_0_119,c_0_120]) ).
cnf(c_0_125,hypothesis,
meet(b,join(r1,meet(a,r2))) = n0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_122]),c_0_116]),c_0_123]) ).
cnf(c_0_126,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_124,c_0_125]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.11 % Problem : LAT005-10 : TPTP v8.2.0. Released v7.5.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n024.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 19:45:22 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.46 Running first-order model finding
% 0.20/0.46 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 61.49/8.26 # Version: 3.1.0
% 61.49/8.26 # Preprocessing class: FSMSSMSSSSSNFFN.
% 61.49/8.26 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 61.49/8.26 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 61.49/8.26 # Starting new_bool_3 with 300s (1) cores
% 61.49/8.26 # Starting new_bool_1 with 300s (1) cores
% 61.49/8.26 # Starting sh5l with 300s (1) cores
% 61.49/8.26 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 29613 completed with status 0
% 61.49/8.26 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 61.49/8.26 # Preprocessing class: FSMSSMSSSSSNFFN.
% 61.49/8.26 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 61.49/8.26 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 61.49/8.26 # No SInE strategy applied
% 61.49/8.26 # Search class: FUUPM-FFSF33-MFFFFFNN
% 61.49/8.26 # partial match(1): FUUPM-FFSF32-MFFFFFNN
% 61.49/8.26 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 61.49/8.26 # Starting G-E--_107_C18_F1_AE_Q4_CS_SP_CO_S0Y with 811s (1) cores
% 61.49/8.26 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 61.49/8.26 # Starting G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 61.49/8.26 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 61.49/8.26 # Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 61.49/8.26 # G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with pid 29621 completed with status 0
% 61.49/8.26 # Result found by G-E--_208_B02_F1_AE_CS_SP_PS_S0Y
% 61.49/8.26 # Preprocessing class: FSMSSMSSSSSNFFN.
% 61.49/8.26 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 61.49/8.26 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 61.49/8.26 # No SInE strategy applied
% 61.49/8.26 # Search class: FUUPM-FFSF33-MFFFFFNN
% 61.49/8.26 # partial match(1): FUUPM-FFSF32-MFFFFFNN
% 61.49/8.26 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 61.49/8.26 # Starting G-E--_107_C18_F1_AE_Q4_CS_SP_CO_S0Y with 811s (1) cores
% 61.49/8.26 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 61.49/8.26 # Starting G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 61.49/8.26 # Preprocessing time : 0.001 s
% 61.49/8.26 # Presaturation interreduction done
% 61.49/8.26
% 61.49/8.26 # Proof found!
% 61.49/8.26 # SZS status Unsatisfiable
% 61.49/8.26 # SZS output start CNFRefutation
% See solution above
% 61.49/8.26 # Parsed axioms : 22
% 61.49/8.26 # Removed by relevancy pruning/SinE : 0
% 61.49/8.26 # Initial clauses : 22
% 61.49/8.26 # Removed in clause preprocessing : 0
% 61.49/8.26 # Initial clauses in saturation : 22
% 61.49/8.26 # Processed clauses : 14598
% 61.49/8.26 # ...of these trivial : 7792
% 61.49/8.26 # ...subsumed : 5131
% 61.49/8.26 # ...remaining for further processing : 1675
% 61.49/8.26 # Other redundant clauses eliminated : 0
% 61.49/8.26 # Clauses deleted for lack of memory : 0
% 61.49/8.26 # Backward-subsumed : 0
% 61.49/8.26 # Backward-rewritten : 437
% 61.49/8.26 # Generated clauses : 670873
% 61.49/8.26 # ...of the previous two non-redundant : 426373
% 61.49/8.26 # ...aggressively subsumed : 0
% 61.49/8.26 # Contextual simplify-reflections : 0
% 61.49/8.26 # Paramodulations : 670873
% 61.49/8.26 # Factorizations : 0
% 61.49/8.26 # NegExts : 0
% 61.49/8.26 # Equation resolutions : 0
% 61.49/8.26 # Disequality decompositions : 0
% 61.49/8.26 # Total rewrite steps : 1187603
% 61.49/8.26 # ...of those cached : 1047555
% 61.49/8.26 # Propositional unsat checks : 0
% 61.49/8.26 # Propositional check models : 0
% 61.49/8.26 # Propositional check unsatisfiable : 0
% 61.49/8.26 # Propositional clauses : 0
% 61.49/8.26 # Propositional clauses after purity: 0
% 61.49/8.26 # Propositional unsat core size : 0
% 61.49/8.26 # Propositional preprocessing time : 0.000
% 61.49/8.26 # Propositional encoding time : 0.000
% 61.49/8.26 # Propositional solver time : 0.000
% 61.49/8.26 # Success case prop preproc time : 0.000
% 61.49/8.26 # Success case prop encoding time : 0.000
% 61.49/8.26 # Success case prop solver time : 0.000
% 61.49/8.26 # Current number of processed clauses : 1216
% 61.49/8.26 # Positive orientable unit clauses : 1190
% 61.49/8.26 # Positive unorientable unit clauses: 25
% 61.49/8.26 # Negative unit clauses : 1
% 61.49/8.26 # Non-unit-clauses : 0
% 61.49/8.26 # Current number of unprocessed clauses: 410683
% 61.49/8.26 # ...number of literals in the above : 410683
% 61.49/8.26 # Current number of archived formulas : 0
% 61.49/8.26 # Current number of archived clauses : 459
% 61.49/8.26 # Clause-clause subsumption calls (NU) : 0
% 61.49/8.26 # Rec. Clause-clause subsumption calls : 0
% 61.49/8.26 # Non-unit clause-clause subsumptions : 0
% 61.49/8.26 # Unit Clause-clause subsumption calls : 1765
% 61.49/8.26 # Rewrite failures with RHS unbound : 5576
% 61.49/8.26 # BW rewrite match attempts : 26790
% 61.49/8.26 # BW rewrite match successes : 4168
% 61.49/8.26 # Condensation attempts : 0
% 61.49/8.26 # Condensation successes : 0
% 61.49/8.26 # Termbank termtop insertions : 13277648
% 61.49/8.26 # Search garbage collected termcells : 2
% 61.49/8.26
% 61.49/8.26 # -------------------------------------------------
% 61.49/8.26 # User time : 7.259 s
% 61.49/8.26 # System time : 0.313 s
% 61.49/8.26 # Total time : 7.571 s
% 61.49/8.26 # Maximum resident set size: 1664 pages
% 61.49/8.26
% 61.49/8.26 # -------------------------------------------------
% 61.49/8.26 # User time : 36.559 s
% 61.49/8.26 # System time : 1.601 s
% 61.49/8.26 # Total time : 38.160 s
% 61.49/8.26 # Maximum resident set size: 1692 pages
% 61.49/8.26 % E---3.1 exiting
%------------------------------------------------------------------------------