%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : LAT042-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n004.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 08:47:42 AM UTC 2026
% Result : Unsatisfiable 11.17s 11.50s
% Output : Proof 11.52s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(idempotence_of_meet,axiom,
meet(X,X) = X,
file('LAT001-0.ax',idempotence_of_meet) ).
cnf(idempotence_of_join,axiom,
join(X,X) = X,
file('LAT001-0.ax',idempotence_of_join) ).
cnf(absorption1,axiom,
meet(X,join(X,Y)) = X,
file('LAT001-0.ax',absorption1) ).
cnf(absorption2,axiom,
join(X,meet(X,Y)) = X,
file('LAT001-0.ax',absorption2) ).
cnf(commutativity_of_meet,axiom,
meet(X,Y) = meet(Y,X),
file('LAT001-0.ax',commutativity_of_meet) ).
cnf(commutativity_of_join,axiom,
join(X,Y) = join(Y,X),
file('LAT001-0.ax',commutativity_of_join) ).
cnf(associativity_of_meet,axiom,
meet(meet(X,Y),Z) = meet(X,meet(Y,Z)),
file('LAT001-0.ax',associativity_of_meet) ).
cnf(associativity_of_join,axiom,
join(join(X,Y),Z) = join(X,join(Y,Z)),
file('LAT001-0.ax',associativity_of_join) ).
cnf(distributivity,axiom,
meet(X,join(Y,Z)) = join(meet(X,Y),meet(X,Z)),
file('theBenchmark.p',distributivity) ).
cnf(invertability1,axiom,
join(complement(X),X) = n1,
file('theBenchmark.p',invertability1) ).
cnf(invertability2,axiom,
meet(complement(X),X) = n0,
file('theBenchmark.p',invertability2) ).
cnf(invertability3,axiom,
complement(complement(X)) = X,
file('theBenchmark.p',invertability3) ).
cnf(prove_modular_law,negated_conjecture,
join(a,meet(b,join(a,c))) != meet(join(a,b),join(a,c)),
file('theBenchmark.p',prove_modular_law) ).
cnf(equality_1,axiom,
Eq_x_0 = Eq_x_0,
theory(equality,[reflexivity]) ).
cnf(equality_2,axiom,
( Eq_x_1 = Eq_x_0
| Eq_x_0 != Eq_x_1 ),
theory(equality,[symmetry]) ).
cnf(equality_3,axiom,
( Eq_x_0 = Eq_x_2
| Eq_x_1 != Eq_x_2
| Eq_x_0 != Eq_x_1 ),
theory(equality,[transitivity]) ).
cnf(equality_4,axiom,
( meet(Eq_x_0,Eq_x_1) = meet(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_5,axiom,
( join(Eq_x_0,Eq_x_1) = join(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_6,axiom,
( complement(Eq_x_0) = complement(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT042-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.03 This is a CNF_UNS_RFO_PEQ_UEQ problem
% 0.00/0.03 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.34 % Computer : n004.cluster.edu
% 0.09/0.34 % Model : x86_64 x86_64
% 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34 % Memory : 8046.5625MB
% 0.09/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/0.34 % CPULimit : 300
% 0.09/0.34 % WCLimit : 300
% 0.09/0.34 % DateTime : Sat Sep 19 12:31:19 UTC 2026
% 0.09/0.35 % CPUTime :
% 11.17/11.50 % SZS status Unsatisfiable for theBenchmark
% 11.17/11.50 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------