%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : GRP168-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n019.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:30 PM UTC 2026
% Result : Unsatisfiable 4.47s 11.15s
% Output : CNFRefutation 4.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 15 ( 15 unt; 0 nHn; 9 RR)
% Number of literals : 15 ( 14 equ; 5 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t12,axiom,
greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)) = multiply(X1,greatest_lower_bound(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t22,plain,
greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)) = multiply(X1,greatest_lower_bound(X2,X3)),
inference(orient,[status(thm)],[t12]) ).
cnf(t13,axiom,
greatest_lower_bound(multiply(X1,X2),multiply(X3,X2)) = multiply(greatest_lower_bound(X1,X3),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t25,plain,
greatest_lower_bound(multiply(X1,X2),multiply(X3,X2)) = multiply(greatest_lower_bound(X1,X3),X2),
inference(orient,[status(thm)],[t13]) ).
cnf(t5,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t46,plain,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
inference(orient,[status(thm)],[t5]) ).
cnf(t1,axiom,
greatest_lower_bound(a,b) = a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t63,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)],[t63]) ).
cnf(goal_0,negated_conjecture,
greatest_lower_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))) != multiply(inverse(c),multiply(a,c)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(g0_0,plain,
multiply(inverse(c),greatest_lower_bound(multiply(a,c),multiply(b,c))) != multiply(inverse(c),multiply(a,c)),
inference(rw,[status(thm)],[goal_0,t22]) ).
cnf(g0_1,plain,
multiply(inverse(c),multiply(greatest_lower_bound(a,b),c)) != multiply(inverse(c),multiply(a,c)),
inference(rw,[status(thm)],[g0_0,t25]) ).
cnf(g0_2,plain,
multiply(inverse(c),multiply(greatest_lower_bound(b,a),c)) != multiply(inverse(c),multiply(a,c)),
inference(rw,[status(thm)],[g0_1,t46]) ).
cnf(g0_3,plain,
multiply(inverse(c),multiply(a,c)) != multiply(inverse(c),multiply(a,c)),
inference(rw,[status(thm)],[g0_2,t60]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP168-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.08/10.37 % Computer : n019.cluster.edu
% 0.08/10.37 % Model : x86_64 x86_64
% 0.08/10.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/10.37 % Memory : 8046.5625MB
% 0.08/10.37 % OS : Linux 6.8.0-71-generic
% 0.08/10.37 % CPULimit : 300
% 0.08/10.37 % WCLimit : 300
% 0.08/10.37 % DateTime : Wed Sep 23 13:57:03 UTC 2026
% 0.08/10.38 % CPUTime :
% 0.08/10.38 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.47/11.15 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.47/11.15 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------