%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LAT008-1 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n003.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 : Fri Sep 25 01:54:59 PM UTC 2026
% Result : Unsatisfiable 4.02s 1.12s
% Output : CNFRefutation 4.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 3
% Syntax : Number of clauses : 35 ( 35 unt; 0 nHn; 4 RR)
% Number of literals : 35 ( 34 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 71 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t1,axiom,
join(meet(X1,X2),meet(X3,X2)) = meet(X2,join(X3,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t3,plain,
join(meet(X1,X2),meet(X3,X2)) = meet(X2,join(X3,X1)),
inference(orient,[status(thm)],[t1]) ).
cnf(t0,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t2,plain,
meet(X1,join(X1,X2)) = X1,
inference(orient,[status(thm)],[t0]) ).
cnf(t6,plain,
meet(X1,X2) = meet(meet(X1,X2),meet(X2,join(X3,X1))),
inference(cp,[status(thm)],[t2,t3]) ).
cnf(t36,plain,
meet(meet(X1,X2),meet(X2,join(X3,X1))) = meet(X1,X2),
inference(orient,[status(thm)],[t6]) ).
cnf(t39,plain,
meet(X1,X2) = meet(meet(X1,X2),X2),
inference(cp,[status(thm)],[t36,t2]) ).
cnf(t46,plain,
meet(meet(X1,X2),X2) = meet(X1,X2),
inference(orient,[status(thm)],[t39]) ).
cnf(t48,plain,
meet(X1,join(meet(X2,X1),X3)) = join(meet(X3,X1),meet(X2,X1)),
inference(cp,[status(thm)],[t3,t46]) ).
cnf(t180,plain,
meet(X1,join(meet(X2,X1),X3)) = meet(X1,join(X2,X3)),
inference(step,[status(thm)],[t48,t3]) ).
cnf(t64,plain,
meet(X1,join(meet(X2,X1),X3)) = meet(X1,join(X2,X3)),
inference(orient,[status(thm)],[t180]) ).
cnf(t65,plain,
meet(X1,join(X2,meet(X3,X1))) = meet(X1,meet(X1,join(X3,X2))),
inference(cp,[status(thm)],[t64,t3]) ).
cnf(t47,plain,
meet(X1,join(X2,meet(X3,X1))) = join(meet(X3,X1),meet(X2,X1)),
inference(cp,[status(thm)],[t3,t46]) ).
cnf(t179,plain,
meet(X1,join(X2,meet(X3,X1))) = meet(X1,join(X2,X3)),
inference(step,[status(thm)],[t47,t3]) ).
cnf(t52,plain,
meet(X1,join(X2,meet(X3,X1))) = meet(X1,join(X2,X3)),
inference(orient,[status(thm)],[t179]) ).
cnf(t181,plain,
meet(X1,join(X2,X3)) = meet(X1,meet(X1,join(X3,X2))),
inference(step,[status(thm)],[t65,t52]) ).
cnf(t78,plain,
meet(X1,meet(X1,join(X2,X3))) = meet(X1,join(X3,X2)),
inference(orient,[status(thm)],[t181]) ).
cnf(t79,plain,
meet(X1,join(X2,X1)) = meet(X1,X1),
inference(cp,[status(thm)],[t78,t2]) ).
cnf(t90,plain,
meet(X1,join(X2,X1)) = meet(X1,X1),
inference(orient,[status(thm)],[t79]) ).
cnf(t91,plain,
meet(X1,X1) = X1,
inference(cp,[status(thm)],[t90,t2]) ).
cnf(t105,plain,
meet(X1,X1) = X1,
inference(orient,[status(thm)],[t91]) ).
cnf(t108,plain,
meet(X1,join(X2,X1)) = join(X1,meet(X2,X1)),
inference(cp,[status(thm)],[t3,t105]) ).
cnf(t182,plain,
meet(X1,join(X2,X1)) = X1,
inference(step,[status(thm)],[t90,t105]) ).
cnf(t106,plain,
meet(X1,join(X2,X1)) = X1,
inference(orient,[status(thm)],[t182]) ).
cnf(t184,plain,
X1 = join(X1,meet(X2,X1)),
inference(step,[status(thm)],[t108,t106]) ).
cnf(t113,plain,
join(X1,meet(X2,X1)) = X1,
inference(orient,[status(thm)],[t184]) ).
cnf(t114,plain,
X1 = join(X1,X1),
inference(cp,[status(thm)],[t113,t105]) ).
cnf(t129,plain,
join(X1,X1) = X1,
inference(orient,[status(thm)],[t114]) ).
cnf(t130,plain,
meet(X1,X2) = meet(X2,join(X1,X1)),
inference(cp,[status(thm)],[t129,t3]) ).
cnf(t188,plain,
meet(X1,X2) = meet(X2,X1),
inference(step,[status(thm)],[t130,t129]) ).
cnf(t164,plain,
meet(X1,X2) = meet(X2,X1),
inference(orient,[status(thm)],[t188]) ).
cnf(goal_0,negated_conjecture,
join(a,meet(a,b)) != a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(g0_0,plain,
join(a,meet(b,a)) != a,
inference(rw,[status(thm)],[goal_0,t164]) ).
cnf(g0_1,plain,
a != a,
inference(rw,[status(thm)],[g0_0,t113]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT008-1 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.08/0.35 % Computer : n003.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Wed Sep 23 20:02:04 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.02/1.12 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.02/1.12 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------