%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : GRP148-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n001.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 4.81s 1.10s
% Output : CNFRefutation 4.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of clauses : 27 ( 27 unt; 0 nHn; 21 RR)
% Number of literals : 27 ( 26 equ; 14 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 : 14 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t8,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t47,plain,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
inference(orient,[status(thm)],[t8]) ).
cnf(t2,axiom,
least_upper_bound(a,c) = c,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t65,plain,
least_upper_bound(c,a) = c,
inference(step,[status(thm)],[t2,t47]) ).
cnf(t61,plain,
least_upper_bound(c,a) = c,
inference(orient,[status(thm)],[t65]) ).
cnf(t3,axiom,
least_upper_bound(b,c) = c,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t66,plain,
least_upper_bound(c,b) = c,
inference(step,[status(thm)],[t3,t47]) ).
cnf(t63,plain,
least_upper_bound(c,b) = c,
inference(orient,[status(thm)],[t66]) ).
cnf(t11,axiom,
least_upper_bound(least_upper_bound(X1,X2),X3) = least_upper_bound(X1,least_upper_bound(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t51,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(t7,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t21,plain,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
inference(orient,[status(thm)],[t7]) ).
cnf(goal_0,negated_conjecture,
greatest_lower_bound(least_upper_bound(a,b),c) != least_upper_bound(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(g0_0,plain,
greatest_lower_bound(least_upper_bound(a,b),c) != least_upper_bound(b,a),
inference(rw,[status(thm)],[goal_0,t47]) ).
cnf(g0_1,plain,
greatest_lower_bound(least_upper_bound(a,b),least_upper_bound(c,a)) != least_upper_bound(b,a),
inference(rw,[status(thm)],[g0_0,t61]) ).
cnf(g0_2,plain,
greatest_lower_bound(least_upper_bound(a,b),least_upper_bound(a,c)) != least_upper_bound(b,a),
inference(rw,[status(thm)],[g0_1,t47]) ).
cnf(g0_3,plain,
greatest_lower_bound(least_upper_bound(a,b),least_upper_bound(a,least_upper_bound(c,b))) != least_upper_bound(b,a),
inference(rw,[status(thm)],[g0_2,t63]) ).
cnf(g0_4,plain,
greatest_lower_bound(least_upper_bound(a,b),least_upper_bound(a,least_upper_bound(b,c))) != least_upper_bound(b,a),
inference(rw,[status(thm)],[g0_3,t47]) ).
cnf(g0_5,plain,
greatest_lower_bound(least_upper_bound(a,b),least_upper_bound(least_upper_bound(b,c),a)) != least_upper_bound(b,a),
inference(rw,[status(thm)],[g0_4,t47]) ).
cnf(g0_6,plain,
greatest_lower_bound(least_upper_bound(b,a),least_upper_bound(least_upper_bound(b,c),a)) != least_upper_bound(b,a),
inference(rw,[status(thm)],[g0_5,t47]) ).
cnf(g0_7,plain,
greatest_lower_bound(least_upper_bound(b,a),least_upper_bound(b,least_upper_bound(c,a))) != least_upper_bound(b,a),
inference(rw,[status(thm)],[g0_6,t51]) ).
cnf(g0_8,plain,
greatest_lower_bound(least_upper_bound(b,a),least_upper_bound(least_upper_bound(c,a),b)) != least_upper_bound(b,a),
inference(rw,[status(thm)],[g0_7,t47]) ).
cnf(g0_9,plain,
greatest_lower_bound(least_upper_bound(b,a),least_upper_bound(c,least_upper_bound(a,b))) != least_upper_bound(b,a),
inference(rw,[status(thm)],[g0_8,t51]) ).
cnf(g0_10,plain,
greatest_lower_bound(least_upper_bound(b,a),least_upper_bound(least_upper_bound(a,b),c)) != least_upper_bound(b,a),
inference(rw,[status(thm)],[g0_9,t47]) ).
cnf(g0_11,plain,
greatest_lower_bound(least_upper_bound(b,a),least_upper_bound(least_upper_bound(b,a),c)) != least_upper_bound(b,a),
inference(rw,[status(thm)],[g0_10,t47]) ).
cnf(g0_12,plain,
least_upper_bound(b,a) != least_upper_bound(b,a),
inference(rw,[status(thm)],[g0_11,t21]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP148-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.36 % Computer : n001.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Wed Sep 23 13:57:49 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.81/1.10 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.81/1.10 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------