%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : LAT045-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s

% Computer : n014.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 Aug 31 05:59:20 EDT 2023

% Result   : Unsatisfiable 0.19s 0.62s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   25 (  18 unt;   7 typ;   0 def)
%            Number of atoms       :   18 (  17 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    2 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    5 (   3   >;   2   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   31 (   2 sgn;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    meet: ( $i * $i ) > $i ).

tff(decl_23,type,
    join: ( $i * $i ) > $i ).

tff(decl_24,type,
    complement: $i > $i ).

tff(decl_25,type,
    n1: $i ).

tff(decl_26,type,
    n0: $i ).

tff(decl_27,type,
    a: $i ).

tff(decl_28,type,
    b: $i ).

cnf(modular_law,axiom,
    join(X1,meet(X2,join(X1,X3))) = meet(join(X1,X2),join(X1,X3)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',modular_law) ).

cnf(commutativity_of_join,axiom,
    join(X1,X2) = join(X2,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',commutativity_of_join) ).

cnf(invertability1,axiom,
    join(complement(X1),X1) = n1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',invertability1) ).

cnf(commutativity_of_meet,axiom,
    meet(X1,X2) = meet(X2,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',commutativity_of_meet) ).

cnf(absorption1,axiom,
    meet(X1,join(X1,X2)) = X1,
    file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',absorption1) ).

cnf(prove_orthomodular_law,negated_conjecture,
    join(a,meet(complement(a),join(a,b))) != join(a,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_orthomodular_law) ).

cnf(c_0_6,axiom,
    join(X1,meet(X2,join(X1,X3))) = meet(join(X1,X2),join(X1,X3)),
    modular_law ).

cnf(c_0_7,axiom,
    join(X1,X2) = join(X2,X1),
    commutativity_of_join ).

cnf(c_0_8,axiom,
    join(complement(X1),X1) = n1,
    invertability1 ).

cnf(c_0_9,axiom,
    meet(X1,X2) = meet(X2,X1),
    commutativity_of_meet ).

cnf(c_0_10,plain,
    meet(join(X1,X2),join(X3,X1)) = join(X1,meet(X2,join(X3,X1))),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_11,plain,
    meet(join(X1,X2),join(X2,X3)) = join(X2,meet(X1,join(X2,X3))),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_12,axiom,
    meet(X1,join(X1,X2)) = X1,
    absorption1 ).

cnf(c_0_13,plain,
    join(X1,complement(X1)) = n1,
    inference(rw,[status(thm)],[c_0_8,c_0_7]) ).

cnf(c_0_14,negated_conjecture,
    join(a,meet(complement(a),join(a,b))) != join(a,b),
    prove_orthomodular_law ).

cnf(c_0_15,plain,
    join(X1,meet(X2,join(X1,X3))) = join(X1,meet(X3,join(X2,X1))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).

cnf(c_0_16,plain,
    meet(X1,n1) = X1,
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_17,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_7]),c_0_13]),c_0_16])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : LAT045-1 : TPTP v8.1.2. Released v2.5.0.
% 0.00/0.14  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35  % Computer : n014.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    : 300
% 0.14/0.35  % DateTime   : Thu Aug 24 07:44:33 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.19/0.58  start to proof: theBenchmark
% 0.19/0.62  % Version  : CSE_E---1.5
% 0.19/0.62  % Problem  : theBenchmark.p
% 0.19/0.62  % Proof found
% 0.19/0.62  % SZS status Theorem for theBenchmark.p
% 0.19/0.62  % SZS output start Proof
% See solution above
% 0.19/0.62  % Total time : 0.033000 s
% 0.19/0.62  % SZS output end Proof
% 0.19/0.62  % Total time : 0.035000 s
%------------------------------------------------------------------------------