TSTP Solution File: LAT399-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LAT399-1 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:20 EDT 2024
% Result : Unsatisfiable 257.18s 33.06s
% Output : CNFRefutation 257.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 10
% Syntax : Number of clauses : 106 ( 106 unt; 0 nHn; 10 RR)
% Number of literals : 106 ( 105 equ; 9 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 : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 255 ( 28 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(absorption_003,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',absorption_003) ).
cnf(commutativity_001,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_001) ).
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,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',absorption) ).
cnf(commutativity,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity) ).
cnf(associativity_002,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_002) ).
cnf(associativity,axiom,
meet(X1,meet(X2,X3)) = meet(meet(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity) ).
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,axiom,
meet(X1,join(X1,X2)) = X1,
absorption_003 ).
cnf(c_0_11,axiom,
join(X1,X2) = join(X2,X1),
commutativity_001 ).
cnf(c_0_12,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_13,axiom,
upme(X1,X2,X3) = meet(X1,join(X2,X3)),
definition_of_upme ).
cnf(c_0_14,axiom,
join(X1,meet(X1,X2)) = X1,
absorption ).
cnf(c_0_15,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity ).
cnf(c_0_16,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
associativity_002 ).
cnf(c_0_18,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_12,c_0_13]) ).
cnf(c_0_19,axiom,
meet(X1,meet(X2,X3)) = meet(meet(X1,X2),X3),
associativity ).
cnf(c_0_20,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
meet(X1,join(X2,join(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,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_18,c_0_19]),c_0_19]),c_0_19]),c_0_11]) ).
cnf(c_0_23,plain,
meet(X1,meet(X2,X1)) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_20]),c_0_15]) ).
cnf(c_0_24,plain,
meet(X1,meet(X2,join(X3,X1))) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_14]),c_0_19]) ).
cnf(c_0_25,negated_conjecture,
join(meet(X1,a),meet(a,X2)) = meet(a,join(meet(X2,a),X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_11]),c_0_14]),c_0_24]) ).
cnf(c_0_26,negated_conjecture,
join(meet(a,X1),meet(X2,a)) = meet(a,join(meet(X1,a),X2)),
inference(spm,[status(thm)],[c_0_11,c_0_25]) ).
cnf(c_0_27,negated_conjecture,
join(meet(a,X1),meet(a,X2)) = meet(a,join(meet(X2,a),X1)),
inference(spm,[status(thm)],[c_0_25,c_0_15]) ).
cnf(c_0_28,plain,
join(X1,meet(X2,meet(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_29,negated_conjecture,
meet(a,join(meet(X1,a),X2)) = meet(a,join(meet(X2,a),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_15]),c_0_27]) ).
cnf(c_0_30,plain,
join(X1,meet(X2,meet(X1,X3))) = X1,
inference(spm,[status(thm)],[c_0_28,c_0_15]) ).
cnf(c_0_31,plain,
meet(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_32,negated_conjecture,
meet(a,join(meet(X1,a),X2)) = meet(a,join(X1,meet(X2,a))),
inference(spm,[status(thm)],[c_0_29,c_0_11]) ).
cnf(c_0_33,plain,
meet(X1,join(X2,join(X1,X3))) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_11]) ).
cnf(c_0_34,plain,
join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
inference(spm,[status(thm)],[c_0_11,c_0_17]) ).
cnf(c_0_35,plain,
join(X1,join(meet(X2,meet(X1,X3)),X4)) = join(X1,X4),
inference(spm,[status(thm)],[c_0_17,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
join(meet(X1,a),meet(X2,a)) = meet(a,join(meet(X2,a),X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_23]),c_0_19]),c_0_31]) ).
cnf(c_0_37,negated_conjecture,
meet(a,join(meet(a,X1),X2)) = meet(a,join(X1,meet(X2,a))),
inference(spm,[status(thm)],[c_0_32,c_0_15]) ).
cnf(c_0_38,plain,
meet(X1,meet(X2,X3)) = meet(X3,meet(X1,X2)),
inference(spm,[status(thm)],[c_0_15,c_0_19]) ).
cnf(c_0_39,plain,
join(X1,join(meet(X2,X1),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_17,c_0_20]) ).
cnf(c_0_40,plain,
meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_19,c_0_10]) ).
cnf(c_0_41,negated_conjecture,
join(meet(a,X1),meet(X2,a)) = meet(a,join(X1,meet(X2,a))),
inference(rw,[status(thm)],[c_0_26,c_0_32]) ).
cnf(c_0_42,negated_conjecture,
join(meet(a,X1),meet(join(X2,X1),X3)) = meet(join(meet(a,X1),X3),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_22,c_0_16]),c_0_17]),c_0_33]),c_0_11]),c_0_34]),c_0_35]) ).
cnf(c_0_43,negated_conjecture,
join(meet(X1,a),meet(X2,a)) = meet(a,join(X2,meet(X1,a))),
inference(rw,[status(thm)],[c_0_36,c_0_32]) ).
cnf(c_0_44,negated_conjecture,
meet(a,join(meet(X1,meet(a,X2)),X3)) = meet(a,join(meet(X2,X1),meet(X3,a))),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_45,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_14,c_0_22]),c_0_17]),c_0_39]) ).
cnf(c_0_46,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_14]),c_0_15]) ).
cnf(c_0_47,plain,
join(X1,join(X2,meet(X1,X3))) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_40]),c_0_17]) ).
cnf(c_0_48,negated_conjecture,
meet(a,join(X1,meet(a,join(X2,X1)))) = meet(a,join(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_11]),c_0_14]),c_0_15]) ).
cnf(c_0_49,negated_conjecture,
join(meet(X1,meet(X2,a)),meet(X3,a)) = meet(a,join(X3,meet(X1,meet(X2,a)))),
inference(spm,[status(thm)],[c_0_43,c_0_19]) ).
cnf(c_0_50,negated_conjecture,
meet(a,join(X1,meet(X2,a))) = meet(a,join(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(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_37]),c_0_46]),c_0_43]),c_0_17]),c_0_41]),c_0_17]),c_0_47]),c_0_48]),c_0_46]) ).
cnf(c_0_51,plain,
meet(X1,meet(X2,meet(X3,meet(X1,X2)))) = meet(X3,meet(X1,X2)),
inference(spm,[status(thm)],[c_0_23,c_0_19]) ).
cnf(c_0_52,plain,
meet(X1,meet(X2,meet(X3,X1))) = meet(X2,meet(X3,X1)),
inference(spm,[status(thm)],[c_0_23,c_0_19]) ).
cnf(c_0_53,negated_conjecture,
meet(a,join(X1,meet(X2,meet(X3,a)))) = meet(a,join(meet(X2,X3),meet(X1,a))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_38]),c_0_49]) ).
cnf(c_0_54,negated_conjecture,
meet(a,join(meet(a,X1),X2)) = meet(a,join(X2,X1)),
inference(rw,[status(thm)],[c_0_37,c_0_50]) ).
cnf(c_0_55,plain,
meet(X1,meet(X2,meet(X1,X3))) = meet(X2,meet(X1,X3)),
inference(rw,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_56,negated_conjecture,
join(meet(a,X1),meet(a,X2)) = meet(a,join(X2,meet(X1,a))),
inference(rw,[status(thm)],[c_0_27,c_0_32]) ).
cnf(c_0_57,negated_conjecture,
meet(a,join(X1,meet(X2,meet(X3,a)))) = meet(a,join(X1,meet(X2,X3))),
inference(rw,[status(thm)],[c_0_53,c_0_50]) ).
cnf(c_0_58,negated_conjecture,
meet(a,join(X1,meet(X2,meet(a,X3)))) = meet(a,join(X1,meet(X3,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_44]),c_0_50]) ).
cnf(c_0_59,plain,
join(X1,join(X2,meet(X3,X1))) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_10]),c_0_17]) ).
cnf(c_0_60,plain,
meet(X1,meet(join(X2,X1),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_19,c_0_16]) ).
cnf(c_0_61,negated_conjecture,
join(X1,meet(a,join(X2,meet(X1,a)))) = join(X1,meet(a,X2)),
inference(spm,[status(thm)],[c_0_39,c_0_56]) ).
cnf(c_0_62,plain,
join(meet(X1,X2),meet(X2,meet(X3,X1))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_20,c_0_38]) ).
cnf(c_0_63,negated_conjecture,
meet(a,meet(join(X1,meet(X2,X3)),join(meet(X2,meet(a,X1)),X3))) = meet(a,join(meet(X1,X3),meet(join(X3,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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_55]),c_0_19]),c_0_56]),c_0_19]),c_0_57]),c_0_15]),c_0_19]),c_0_27]),c_0_19]),c_0_15]),c_0_37]),c_0_50]),c_0_11]),c_0_58]) ).
cnf(c_0_64,negated_conjecture,
join(meet(a,X1),meet(a,X2)) = meet(a,join(X1,X2)),
inference(rw,[status(thm)],[c_0_56,c_0_50]) ).
cnf(c_0_65,plain,
join(X1,join(X2,join(meet(X3,X1),X4))) = join(X1,join(X2,X4)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_59]),c_0_17]),c_0_17]) ).
cnf(c_0_66,plain,
join(meet(X1,X2),meet(join(X3,X1),X2)) = meet(join(X3,X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_60]),c_0_11]) ).
cnf(c_0_67,negated_conjecture,
join(X1,meet(a,join(X1,X2))) = join(X1,meet(a,X2)),
inference(rw,[status(thm)],[c_0_61,c_0_50]) ).
cnf(c_0_68,negated_conjecture,
meet(a,join(X1,meet(join(X1,X2),X3))) = 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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_15]),c_0_44]),c_0_50]),c_0_64]),c_0_17]),c_0_65]),c_0_66]),c_0_15]),c_0_44]),c_0_50]) ).
cnf(c_0_69,negated_conjecture,
upme(meet(a,z1),z2,z3) != lome(meet(a,z1),z2,z3),
inference(fof_simplification,[status(thm)],[conjecture_1]) ).
cnf(c_0_70,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_11]),c_0_17]) ).
cnf(c_0_71,negated_conjecture,
join(X1,meet(a,meet(join(X1,X2),X3))) = join(X1,meet(a,meet(X2,X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_67]) ).
cnf(c_0_72,negated_conjecture,
upme(meet(a,z1),z2,z3) != lome(meet(a,z1),z2,z3),
c_0_69 ).
cnf(c_0_73,axiom,
lome(X1,X2,X3) = join(meet(X1,X2),meet(X1,X3)),
definition_of_lome ).
cnf(c_0_74,plain,
meet(X1,meet(X2,X3)) = meet(X2,meet(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_15]),c_0_19]) ).
cnf(c_0_75,plain,
meet(X1,meet(X2,join(X3,meet(X1,X2)))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_16,c_0_19]) ).
cnf(c_0_76,negated_conjecture,
join(meet(a,X1),meet(join(X1,X2),X3)) = meet(join(meet(a,X1),X3),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_22,c_0_10]),c_0_17]),c_0_10]),c_0_70]),c_0_35]),c_0_11]) ).
cnf(c_0_77,negated_conjecture,
join(X1,meet(X2,meet(a,join(X1,X3)))) = join(X1,meet(a,meet(X3,X2))),
inference(spm,[status(thm)],[c_0_71,c_0_38]) ).
cnf(c_0_78,negated_conjecture,
meet(a,join(X1,meet(X2,join(X1,X3)))) = meet(a,join(X1,meet(X2,X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_68]),c_0_58]) ).
cnf(c_0_79,negated_conjecture,
join(meet(a,X1),meet(X2,join(X3,X1))) = meet(join(X1,X3),join(meet(a,X1),X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_16]),c_0_21]),c_0_11]),c_0_34]),c_0_35]) ).
cnf(c_0_80,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_72,c_0_13]),c_0_73]) ).
cnf(c_0_81,plain,
meet(join(X1,X2),join(X1,join(X2,X3))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_10,c_0_17]) ).
cnf(c_0_82,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_16]),c_0_11]) ).
cnf(c_0_83,plain,
meet(X1,meet(X2,meet(X3,join(X4,meet(X1,X3))))) = meet(X2,meet(X1,X3)),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_84,negated_conjecture,
meet(a,meet(join(X1,X2),join(X1,X3))) = 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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_56]),c_0_50]),c_0_78]),c_0_37]),c_0_50]),c_0_79]),c_0_11]),c_0_14]),c_0_15]),c_0_19]) ).
cnf(c_0_85,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_80,c_0_15]),c_0_15]) ).
cnf(c_0_86,plain,
meet(join(X1,X2),join(X2,X1)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_87,negated_conjecture,
meet(X1,meet(a,join(X2,meet(X3,X1)))) = meet(a,meet(X1,join(X2,X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_24]) ).
cnf(c_0_88,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_89,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_85,c_0_19]) ).
cnf(c_0_90,plain,
meet(join(X1,X2),meet(X3,join(X2,X1))) = meet(X3,join(X2,X1)),
inference(spm,[status(thm)],[c_0_38,c_0_86]) ).
cnf(c_0_91,plain,
meet(X1,meet(X2,join(X1,X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_40,c_0_15]) ).
cnf(c_0_92,negated_conjecture,
meet(join(meet(a,meet(X1,X2)),X3),join(meet(a,meet(X2,X3)),meet(X1,X2))) = join(meet(X3,meet(X1,X2)),meet(a,meet(X2,join(X3,meet(X1,X2))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_15]) ).
cnf(c_0_93,negated_conjecture,
meet(a,meet(X1,join(X2,meet(X3,X1)))) = meet(a,meet(X1,join(X2,X3))),
inference(spm,[status(thm)],[c_0_74,c_0_87]) ).
cnf(c_0_94,negated_conjecture,
meet(a,join(X1,meet(a,X2))) = meet(a,join(X2,meet(X1,a))),
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_79,c_0_37]),c_0_56]),c_0_17]),c_0_88]),c_0_11]),c_0_14]),c_0_15]) ).
cnf(c_0_95,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_89,c_0_38]),c_0_38]) ).
cnf(c_0_96,negated_conjecture,
meet(a,join(X1,meet(X2,join(X3,X1)))) = meet(a,join(X1,meet(X3,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_90]),c_0_91]) ).
cnf(c_0_97,negated_conjecture,
meet(join(meet(a,meet(X1,X2)),X3),join(meet(a,meet(X2,X3)),meet(X1,X2))) = join(meet(X3,meet(X1,X2)),meet(a,meet(X2,join(X3,X1)))),
inference(rw,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_98,negated_conjecture,
meet(a,join(X1,meet(a,X2))) = meet(a,join(X1,X2)),
inference(rw,[status(thm)],[c_0_94,c_0_50]) ).
cnf(c_0_99,plain,
join(meet(X1,X2),meet(X2,join(X3,X1))) = meet(X2,join(X3,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_24]),c_0_11]) ).
cnf(c_0_100,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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_27]),c_0_19]),c_0_15]),c_0_74]),c_0_11]) ).
cnf(c_0_101,negated_conjecture,
meet(a,join(meet(X1,meet(a,X2)),X3)) = meet(a,join(X3,meet(X2,X1))),
inference(rw,[status(thm)],[c_0_44,c_0_50]) ).
cnf(c_0_102,negated_conjecture,
meet(a,join(meet(X1,X2),meet(X2,X3))) = meet(a,meet(X2,join(X3,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(spm,[status(thm)],[c_0_96,c_0_97]),c_0_39]),c_0_98]),c_0_99]),c_0_19]),c_0_19]),c_0_16]),c_0_98]) ).
cnf(c_0_103,negated_conjecture,
meet(a,join(meet(z1,z2),meet(z1,z3))) != meet(a,meet(z1,join(z2,z3))),
inference(rw,[status(thm)],[c_0_100,c_0_98]) ).
cnf(c_0_104,negated_conjecture,
meet(a,join(meet(X1,X2),meet(X1,X3))) = meet(a,meet(X1,join(X3,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_19]),c_0_46]),c_0_19]),c_0_54]) ).
cnf(c_0_105,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_103,c_0_104]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LAT399-1 : TPTP v8.2.0. Released v8.1.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 20:47:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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
% 257.18/33.06 # Version: 3.1.0
% 257.18/33.06 # Preprocessing class: FSSSSMSSSSSNFFN.
% 257.18/33.06 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 257.18/33.06 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 257.18/33.06 # Starting new_bool_3 with 300s (1) cores
% 257.18/33.06 # Starting new_bool_1 with 300s (1) cores
% 257.18/33.06 # Starting sh5l with 300s (1) cores
% 257.18/33.06 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 30032 completed with status 0
% 257.18/33.06 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 257.18/33.06 # Preprocessing class: FSSSSMSSSSSNFFN.
% 257.18/33.06 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 257.18/33.06 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 257.18/33.06 # No SInE strategy applied
% 257.18/33.06 # Search class: FUUPM-FFSF22-MFFFFFNN
% 257.18/33.06 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 257.18/33.06 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 257.18/33.06 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 257.18/33.06 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 257.18/33.06 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 257.18/33.06 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 257.18/33.06 # G-E--_300_C01_F1_SE_CS_SP_S0Y with pid 30043 completed with status 0
% 257.18/33.06 # Result found by G-E--_300_C01_F1_SE_CS_SP_S0Y
% 257.18/33.06 # Preprocessing class: FSSSSMSSSSSNFFN.
% 257.18/33.06 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 257.18/33.06 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 257.18/33.06 # No SInE strategy applied
% 257.18/33.06 # Search class: FUUPM-FFSF22-MFFFFFNN
% 257.18/33.06 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 257.18/33.06 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 257.18/33.06 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 257.18/33.06 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 257.18/33.06 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 257.18/33.06 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 257.18/33.06 # Preprocessing time : 0.001 s
% 257.18/33.06
% 257.18/33.06 # Proof found!
% 257.18/33.06 # SZS status Unsatisfiable
% 257.18/33.06 # SZS output start CNFRefutation
% See solution above
% 257.18/33.06 # Parsed axioms : 10
% 257.18/33.06 # Removed by relevancy pruning/SinE : 0
% 257.18/33.06 # Initial clauses : 10
% 257.18/33.06 # Removed in clause preprocessing : 2
% 257.18/33.06 # Initial clauses in saturation : 8
% 257.18/33.06 # Processed clauses : 24781
% 257.18/33.06 # ...of these trivial : 12984
% 257.18/33.06 # ...subsumed : 10844
% 257.18/33.06 # ...remaining for further processing : 953
% 257.18/33.06 # Other redundant clauses eliminated : 0
% 257.18/33.06 # Clauses deleted for lack of memory : 0
% 257.18/33.06 # Backward-subsumed : 0
% 257.18/33.06 # Backward-rewritten : 148
% 257.18/33.06 # Generated clauses : 1142731
% 257.18/33.06 # ...of the previous two non-redundant : 927460
% 257.18/33.06 # ...aggressively subsumed : 0
% 257.18/33.06 # Contextual simplify-reflections : 0
% 257.18/33.06 # Paramodulations : 1142731
% 257.18/33.06 # Factorizations : 0
% 257.18/33.06 # NegExts : 0
% 257.18/33.06 # Equation resolutions : 0
% 257.18/33.06 # Disequality decompositions : 0
% 257.18/33.06 # Total rewrite steps : 4328792
% 257.18/33.06 # ...of those cached : 3675478
% 257.18/33.06 # Propositional unsat checks : 0
% 257.18/33.06 # Propositional check models : 0
% 257.18/33.06 # Propositional check unsatisfiable : 0
% 257.18/33.06 # Propositional clauses : 0
% 257.18/33.06 # Propositional clauses after purity: 0
% 257.18/33.06 # Propositional unsat core size : 0
% 257.18/33.06 # Propositional preprocessing time : 0.000
% 257.18/33.06 # Propositional encoding time : 0.000
% 257.18/33.06 # Propositional solver time : 0.000
% 257.18/33.06 # Success case prop preproc time : 0.000
% 257.18/33.06 # Success case prop encoding time : 0.000
% 257.18/33.06 # Success case prop solver time : 0.000
% 257.18/33.06 # Current number of processed clauses : 805
% 257.18/33.06 # Positive orientable unit clauses : 795
% 257.18/33.06 # Positive unorientable unit clauses: 10
% 257.18/33.06 # Negative unit clauses : 0
% 257.18/33.06 # Non-unit-clauses : 0
% 257.18/33.06 # Current number of unprocessed clauses: 900658
% 257.18/33.06 # ...number of literals in the above : 900658
% 257.18/33.06 # Current number of archived formulas : 0
% 257.18/33.06 # Current number of archived clauses : 150
% 257.18/33.06 # Clause-clause subsumption calls (NU) : 0
% 257.18/33.06 # Rec. Clause-clause subsumption calls : 0
% 257.18/33.06 # Non-unit clause-clause subsumptions : 0
% 257.18/33.06 # Unit Clause-clause subsumption calls : 768
% 257.18/33.06 # Rewrite failures with RHS unbound : 0
% 257.18/33.06 # BW rewrite match attempts : 20217
% 257.18/33.06 # BW rewrite match successes : 1334
% 257.18/33.06 # Condensation attempts : 0
% 257.18/33.06 # Condensation successes : 0
% 257.18/33.06 # Termbank termtop insertions : 39529053
% 257.18/33.06 # Search garbage collected termcells : 2
% 257.18/33.06
% 257.18/33.06 # -------------------------------------------------
% 257.18/33.06 # User time : 30.946 s
% 257.18/33.06 # System time : 0.903 s
% 257.18/33.06 # Total time : 31.849 s
% 257.18/33.06 # Maximum resident set size: 1588 pages
% 257.18/33.06
% 257.18/33.06 # -------------------------------------------------
% 257.18/33.06 # User time : 155.096 s
% 257.18/33.06 # System time : 4.472 s
% 257.18/33.06 # Total time : 159.568 s
% 257.18/33.06 # Maximum resident set size: 1692 pages
% 257.18/33.06 % E---3.1 exiting
% 257.18/33.06 % E exiting
%------------------------------------------------------------------------------