%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GRP154-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n022.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 : 600s
% DateTime : Sat Jul 16 11:45:57 EDT 2022
% Result : Unsatisfiable 0.21s 0.46s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 5 ( 5 unt; 0 nHn; 5 RR)
% Number of literals : 5 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
equal(least_upper_bound(a,b),b),
file('GRP154-1.p',unknown),
[] ).
cnf(2,axiom,
~ equal(least_upper_bound(multiply(a,c),multiply(b,c)),multiply(b,c)),
file('GRP154-1.p',unknown),
[] ).
cnf(16,axiom,
equal(multiply(least_upper_bound(u,v),w),least_upper_bound(multiply(u,w),multiply(v,w))),
file('GRP154-1.p',unknown),
[] ).
cnf(561,plain,
equal(least_upper_bound(multiply(a,u),multiply(b,u)),multiply(b,u)),
inference(spr,[status(thm),theory(equality)],[1,16]),
[iquote('0:SpR:1.0,16.0')] ).
cnf(575,plain,
$false,
inference(unc,[status(thm)],[561,2]),
[iquote('0:UnC:561.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP154-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.08/0.13 % Command : run_spass %d %s
% 0.14/0.35 % Computer : n022.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jun 13 09:18:03 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.46
% 0.21/0.46 SPASS V 3.9
% 0.21/0.46 SPASS beiseite: Proof found.
% 0.21/0.46 % SZS status Theorem
% 0.21/0.46 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.46 SPASS derived 438 clauses, backtracked 0 clauses, performed 0 splits and kept 111 clauses.
% 0.21/0.46 SPASS allocated 63642 KBytes.
% 0.21/0.46 SPASS spent 0:00:00.09 on the problem.
% 0.21/0.46 0:00:00.03 for the input.
% 0.21/0.46 0:00:00.00 for the FLOTTER CNF translation.
% 0.21/0.46 0:00:00.00 for inferences.
% 0.21/0.46 0:00:00.00 for the backtracking.
% 0.21/0.46 0:00:00.03 for the reduction.
% 0.21/0.46
% 0.21/0.46
% 0.21/0.46 Here is a proof with depth 1, length 5 :
% 0.21/0.46 % SZS output start Refutation
% See solution above
% 0.21/0.46 Formulae used in the proof : ax_mono1a_1 prove_ax_mono1a monotony_lub2
% 0.21/0.46
%------------------------------------------------------------------------------