%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : GRP149-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n018.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:25:26 PM UTC 2026
% Result : Unsatisfiable 2.46s 0.79s
% Output : CNFRefutation 2.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 7
% Syntax : Number of clauses : 31 ( 31 unt; 0 nHn; 23 RR)
% Number of literals : 31 ( 30 equ; 16 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 18 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t1,axiom,
greatest_lower_bound(a,c) = a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t6,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t47,plain,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
inference(orient,[status(thm)],[t6]) ).
cnf(t81,plain,
greatest_lower_bound(c,a) = a,
inference(step,[status(thm)],[t1,t47]) ).
cnf(t61,plain,
greatest_lower_bound(c,a) = a,
inference(orient,[status(thm)],[t81]) ).
cnf(t2,axiom,
greatest_lower_bound(b,c) = b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t82,plain,
greatest_lower_bound(c,b) = b,
inference(step,[status(thm)],[t2,t47]) ).
cnf(t64,plain,
greatest_lower_bound(c,b) = b,
inference(orient,[status(thm)],[t82]) ).
cnf(t8,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t67,plain,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
inference(orient,[status(thm)],[t8]) ).
cnf(t11,axiom,
least_upper_bound(least_upper_bound(X1,X2),X3) = least_upper_bound(X1,least_upper_bound(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t71,plain,
least_upper_bound(least_upper_bound(X1,X2),X3) = least_upper_bound(X1,least_upper_bound(X2,X3)),
inference(orient,[status(thm)],[t11]) ).
cnf(t9,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t21,plain,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
inference(orient,[status(thm)],[t9]) ).
cnf(goal_0,negated_conjecture,
least_upper_bound(least_upper_bound(a,b),c) != c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(g0_0,plain,
least_upper_bound(least_upper_bound(a,b),c) != least_upper_bound(least_upper_bound(greatest_lower_bound(c,a),b),c),
inference(rw,[status(thm)],[goal_0,t61]) ).
cnf(g0_1,plain,
least_upper_bound(least_upper_bound(a,b),c) != least_upper_bound(least_upper_bound(greatest_lower_bound(c,a),greatest_lower_bound(c,b)),c),
inference(rw,[status(thm)],[g0_0,t64]) ).
cnf(g0_2,plain,
least_upper_bound(least_upper_bound(a,b),c) != least_upper_bound(least_upper_bound(greatest_lower_bound(c,a),greatest_lower_bound(b,c)),c),
inference(rw,[status(thm)],[g0_1,t47]) ).
cnf(g0_3,plain,
least_upper_bound(least_upper_bound(a,b),c) != least_upper_bound(least_upper_bound(greatest_lower_bound(b,c),greatest_lower_bound(c,a)),c),
inference(rw,[status(thm)],[g0_2,t67]) ).
cnf(g0_4,plain,
least_upper_bound(least_upper_bound(a,b),c) != least_upper_bound(greatest_lower_bound(b,c),least_upper_bound(greatest_lower_bound(c,a),c)),
inference(rw,[status(thm)],[g0_3,t71]) ).
cnf(g0_5,plain,
least_upper_bound(least_upper_bound(a,b),c) != least_upper_bound(greatest_lower_bound(b,c),least_upper_bound(c,greatest_lower_bound(c,a))),
inference(rw,[status(thm)],[g0_4,t67]) ).
cnf(g0_6,plain,
least_upper_bound(least_upper_bound(a,b),c) != least_upper_bound(greatest_lower_bound(b,c),least_upper_bound(c,greatest_lower_bound(a,c))),
inference(rw,[status(thm)],[g0_5,t47]) ).
cnf(g0_7,plain,
least_upper_bound(least_upper_bound(a,b),c) != least_upper_bound(greatest_lower_bound(c,b),least_upper_bound(c,greatest_lower_bound(a,c))),
inference(rw,[status(thm)],[g0_6,t47]) ).
cnf(g0_8,plain,
least_upper_bound(least_upper_bound(a,b),c) != least_upper_bound(least_upper_bound(c,greatest_lower_bound(a,c)),greatest_lower_bound(c,b)),
inference(rw,[status(thm)],[g0_7,t67]) ).
cnf(g0_9,plain,
least_upper_bound(least_upper_bound(a,b),c) != least_upper_bound(least_upper_bound(c,greatest_lower_bound(c,a)),greatest_lower_bound(c,b)),
inference(rw,[status(thm)],[g0_8,t47]) ).
cnf(g0_10,plain,
least_upper_bound(least_upper_bound(a,b),c) != least_upper_bound(least_upper_bound(greatest_lower_bound(c,a),c),greatest_lower_bound(c,b)),
inference(rw,[status(thm)],[g0_9,t67]) ).
cnf(g0_11,plain,
least_upper_bound(least_upper_bound(a,b),c) != least_upper_bound(greatest_lower_bound(c,a),least_upper_bound(c,greatest_lower_bound(c,b))),
inference(rw,[status(thm)],[g0_10,t71]) ).
cnf(g0_12,plain,
least_upper_bound(least_upper_bound(a,b),c) != least_upper_bound(greatest_lower_bound(c,a),c),
inference(rw,[status(thm)],[g0_11,t21]) ).
cnf(g0_13,plain,
least_upper_bound(least_upper_bound(a,b),c) != least_upper_bound(c,greatest_lower_bound(c,a)),
inference(rw,[status(thm)],[g0_12,t67]) ).
cnf(g0_14,plain,
least_upper_bound(least_upper_bound(a,b),c) != c,
inference(rw,[status(thm)],[g0_13,t21]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP149-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.08/0.35 % Computer : n018.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 13:54:04 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.46/0.79 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.46/0.79 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------