%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : GRP156-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n024.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:58 EDT 2022

% Result   : Unsatisfiable 0.21s 0.46s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    4
% Syntax   : Number of clauses     :    7 (   7 unt;   0 nHn;   7 RR)
%            Number of literals    :    7 (   0 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    equal(least_upper_bound(a,b),b),
    file('GRP156-1.p',unknown),
    [] ).

cnf(2,axiom,
    ~ equal(greatest_lower_bound(multiply(a,c),multiply(b,c)),multiply(a,c)),
    file('GRP156-1.p',unknown),
    [] ).

cnf(13,axiom,
    equal(greatest_lower_bound(u,least_upper_bound(u,v)),u),
    file('GRP156-1.p',unknown),
    [] ).

cnf(17,axiom,
    equal(multiply(greatest_lower_bound(u,v),w),greatest_lower_bound(multiply(u,w),multiply(v,w))),
    file('GRP156-1.p',unknown),
    [] ).

cnf(24,plain,
    equal(greatest_lower_bound(a,b),a),
    inference(spr,[status(thm),theory(equality)],[1,13]),
    [iquote('0:SpR:1.0,13.0')] ).

cnf(392,plain,
    equal(greatest_lower_bound(multiply(a,u),multiply(b,u)),multiply(a,u)),
    inference(spr,[status(thm),theory(equality)],[24,17]),
    [iquote('0:SpR:24.0,17.0')] ).

cnf(402,plain,
    $false,
    inference(unc,[status(thm)],[392,2]),
    [iquote('0:UnC:392.0,2.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : GRP156-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.04/0.14  % Command  : run_spass %d %s
% 0.14/0.36  % Computer : n024.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Tue Jun 14 13:33:33 EDT 2022
% 0.14/0.36  % 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/sandbox/benchmark/theBenchmark.p 
% 0.21/0.46  SPASS derived 312 clauses, backtracked 0 clauses, performed 0 splits and kept 85 clauses.
% 0.21/0.46  SPASS allocated 63481 KBytes.
% 0.21/0.46  SPASS spent	0:00:00.08 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.02 for the reduction.
% 0.21/0.46  
% 0.21/0.46  
% 0.21/0.46  Here is a proof with depth 2, length 7 :
% 0.21/0.46  % SZS output start Refutation
% See solution above
% 0.21/0.46  Formulae used in the proof : ax_mono1c_1 prove_ax_mono1c glb_absorbtion monotony_glb2
% 0.21/0.46  
%------------------------------------------------------------------------------