%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : GRP159-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 : 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:27 PM UTC 2026
% Result : Unsatisfiable 2.57s 0.78s
% Output : CNFRefutation 2.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 17 unt; 0 nHn; 9 RR)
% Number of literals : 17 ( 16 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 18 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t14,axiom,
least_upper_bound(multiply(X1,X2),multiply(X1,X3)) = multiply(X1,least_upper_bound(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t24,plain,
least_upper_bound(multiply(X1,X2),multiply(X1,X3)) = multiply(X1,least_upper_bound(X2,X3)),
inference(orient,[status(thm)],[t14]) ).
cnf(t1,axiom,
greatest_lower_bound(a,b) = a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t5,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t46,plain,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
inference(orient,[status(thm)],[t5]) ).
cnf(t67,plain,
greatest_lower_bound(b,a) = a,
inference(step,[status(thm)],[t1,t46]) ).
cnf(t60,plain,
greatest_lower_bound(b,a) = a,
inference(orient,[status(thm)],[t67]) ).
cnf(t7,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t63,plain,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
inference(orient,[status(thm)],[t7]) ).
cnf(t8,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t20,plain,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
inference(orient,[status(thm)],[t8]) ).
cnf(goal_0,negated_conjecture,
least_upper_bound(multiply(c,a),multiply(c,b)) != multiply(c,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(g0_0,plain,
multiply(c,least_upper_bound(a,b)) != multiply(c,b),
inference(rw,[status(thm)],[goal_0,t24]) ).
cnf(g0_1,plain,
multiply(c,least_upper_bound(greatest_lower_bound(b,a),b)) != multiply(c,b),
inference(rw,[status(thm)],[g0_0,t60]) ).
cnf(g0_2,plain,
multiply(c,least_upper_bound(b,greatest_lower_bound(b,a))) != multiply(c,b),
inference(rw,[status(thm)],[g0_1,t63]) ).
cnf(g0_3,plain,
multiply(c,b) != multiply(c,b),
inference(rw,[status(thm)],[g0_2,t20]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP159-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.07/0.35 % Computer : n001.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Wed Sep 23 13:59:05 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.07/0.35 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.57/0.78 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.57/0.78 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------