%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : GRP192-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 : n009.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:39 PM UTC 2026
% Result : Unsatisfiable 5.25s 6.15s
% Output : CNFRefutation 5.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of clauses : 23 ( 23 unt; 0 nHn; 4 RR)
% Number of literals : 23 ( 22 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 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 : 28 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t15,axiom,
least_upper_bound(multiply(X1,X2),multiply(X3,X2)) = multiply(least_upper_bound(X1,X3),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t30,plain,
least_upper_bound(multiply(X1,X2),multiply(X3,X2)) = multiply(least_upper_bound(X1,X3),X2),
inference(orient,[status(thm)],[t15]) ).
cnf(t3,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t18,plain,
multiply(identity,X1) = X1,
inference(orient,[status(thm)],[t3]) ).
cnf(t31,plain,
multiply(least_upper_bound(identity,X1),X2) = least_upper_bound(X2,multiply(X1,X2)),
inference(cp,[status(thm)],[t30,t18]) ).
cnf(t2,axiom,
least_upper_bound(identity,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t21,plain,
least_upper_bound(identity,X1) = X1,
inference(orient,[status(thm)],[t2]) ).
cnf(t149,plain,
multiply(X1,X2) = least_upper_bound(X2,multiply(X1,X2)),
inference(step,[status(thm)],[t31,t21]) ).
cnf(t114,plain,
least_upper_bound(X1,multiply(X2,X1)) = multiply(X2,X1),
inference(orient,[status(thm)],[t149]) ).
cnf(t4,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t61,plain,
multiply(inverse(X1),X1) = identity,
inference(orient,[status(thm)],[t4]) ).
cnf(t116,plain,
multiply(inverse(X1),X1) = least_upper_bound(X1,identity),
inference(cp,[status(thm)],[t114,t61]) ).
cnf(t150,plain,
identity = least_upper_bound(X1,identity),
inference(step,[status(thm)],[t116,t61]) ).
cnf(t7,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t71,plain,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
inference(orient,[status(thm)],[t7]) ).
cnf(t74,plain,
least_upper_bound(X1,identity) = X1,
inference(cp,[status(thm)],[t71,t21]) ).
cnf(t102,plain,
least_upper_bound(X1,identity) = X1,
inference(orient,[status(thm)],[t74]) ).
cnf(t151,plain,
identity = X1,
inference(step,[status(thm)],[t150,t102]) ).
cnf(t122,plain,
identity = X1,
inference(orient,[status(thm)],[t151]) ).
cnf(goal_0,negated_conjecture,
multiply(b,a) != multiply(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(g0_0,plain,
identity != multiply(a,b),
inference(rw,[status(thm)],[goal_0,t122]) ).
cnf(g0_1,plain,
identity != identity,
inference(rw,[status(thm)],[g0_0,t122]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP192-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/5.39 % Computer : n009.cluster.edu
% 0.10/5.39 % Model : x86_64 x86_64
% 0.10/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.39 % Memory : 8046.5625MB
% 0.10/5.39 % OS : Linux 6.8.0-71-generic
% 0.10/5.39 % CPULimit : 300
% 0.10/5.39 % WCLimit : 300
% 0.10/5.39 % DateTime : Wed Sep 23 14:06:05 UTC 2026
% 0.10/5.39 % CPUTime :
% 0.10/5.39 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 5.25/6.15 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.25/6.15 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------