%------------------------------------------------------------------------------
% File : hopCoP---0.1
% Problem : GRP159-1 : TPTP v9.0.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n021.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Jul 24 06:27:00 PM UTC 2025
% Result : Unsatisfiable 45.35s 6.06s
% Output : CNFRefutation 45.72s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named prove_ax_mono2c)
% Comments :
%------------------------------------------------------------------------------
cnf(16,plain,
least_upper_bound(multiply(c,a),multiply(c,b)) != multiply(c,b),
inference(cnf,[status(esa)],[prove_ax_mono2c]) ).
cnf(l0,plain,
least_upper_bound(multiply(c,a),multiply(c,b)) != multiply(c,b),
inference(instantiation,[status(thm)],[16]) ).
cnf(11,plain,
multiply(X0,least_upper_bound(X1,X2)) = least_upper_bound(multiply(X0,X1),multiply(X0,X2)),
inference(cnf,[status(esa)],[monotony_lub1]) ).
cnf(l4,plain,
multiply(c,least_upper_bound(a,b)) = least_upper_bound(multiply(c,a),multiply(c,b)),
inference(instantiation,[status(thm)],[11]) ).
cnf(4,plain,
least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
inference(cnf,[status(esa)],[symmetry_of_lub]) ).
cnf(l33,plain,
least_upper_bound(greatest_lower_bound(b,a),b) = least_upper_bound(b,greatest_lower_bound(b,a)),
inference(instantiation,[status(thm)],[4]) ).
cnf(15,plain,
greatest_lower_bound(a,b) = a,
inference(cnf,[status(esa)],[ax_mono2c_1]) ).
cnf(l43,plain,
greatest_lower_bound(a,b) = a,
inference(instantiation,[status(thm)],[15]) ).
cnf(9,plain,
least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
inference(cnf,[status(esa)],[lub_absorbtion]) ).
cnf(l34,plain,
least_upper_bound(b,greatest_lower_bound(b,a)) = b,
inference(instantiation,[status(thm)],[9]) ).
cnf(3,plain,
greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
inference(cnf,[status(esa)],[symmetry_of_glb]) ).
cnf(l41,plain,
greatest_lower_bound(b,a) = greatest_lower_bound(a,b),
inference(instantiation,[status(thm)],[3]) ).
cnf(final,plain,
$false,
inference(ground_refutation,[status(thm)],[l0,l4,l33,l43,l34,l41]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP159-1 : TPTP v9.0.0. Bugfixed v1.2.1.
% 0.03/0.13 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun Jul 20 14:10:34 EDT 2025
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % launching worker at depth: 2
% 0.12/0.34 % launching worker at depth: 5
% 0.12/0.34 % launching worker at depth: 3
% 0.12/0.34 % launching worker at depth: 1
% 0.12/0.34 % launching worker at depth: 4
% 0.12/0.34 % launching worker at depth: 6
% 0.12/0.34 % launching worker at depth: 7
% 0.12/0.34 % launching worker at depth: 8
% 0.12/0.34 % launching worker at depth: 9
% 0.12/0.35 % launching worker at depth: 10
% 0.12/0.36 % launching worker at depth: 11
% 45.35/6.06 % SZS status Theorem for theBenchmark
% 45.35/6.06 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------