%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : GRP155-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s

% Computer : n032.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 09:05:04 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_ax_mono1b,negated_conjecture,
    greatest_lower_bound(multiply(a,c),multiply(b,c)) != multiply(a,c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ax_mono1b) ).

cnf(monotony_glb2,axiom,
    multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).

cnf(ax_mono1b,hypothesis,
    greatest_lower_bound(a,b) = a,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_mono1b) ).

cnf(c_0_3,negated_conjecture,
    greatest_lower_bound(multiply(a,c),multiply(b,c)) != multiply(a,c),
    prove_ax_mono1b ).

cnf(c_0_4,axiom,
    multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
    monotony_glb2 ).

cnf(c_0_5,hypothesis,
    greatest_lower_bound(a,b) = a,
    ax_mono1b ).

cnf(c_0_6,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4]),c_0_5])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10  % Problem  : GRP155-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.09/0.10  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.10/0.29  % Computer : n032.cluster.edu
% 0.10/0.29  % Model    : x86_64 x86_64
% 0.10/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29  % Memory   : 8042.1875MB
% 0.10/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29  % CPULimit : 300
% 0.10/0.29  % WCLimit  : 600
% 0.10/0.29  % DateTime : Mon Jun 13 10:46:41 EDT 2022
% 0.10/0.30  % CPUTime  : 
% 0.14/0.31  # No SInE strategy applied
% 0.14/0.31  # Auto-Mode selected heuristic U_____102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.31  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.14/0.31  #
% 0.14/0.31  # Presaturation interreduction done
% 0.14/0.31  
% 0.14/0.31  # Proof found!
% 0.14/0.31  # SZS status Unsatisfiable
% 0.14/0.31  # SZS output start CNFRefutation
% See solution above
% 0.14/0.31  # Training examples: 0 positive, 0 negative
%------------------------------------------------------------------------------