↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : LAT045-1 : TPTP v9.2.1. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n018.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 : Tue May  5 04:37:25 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(modular_law,axiom,
    join(X1,meet(X2,join(X1,X3))) = meet(join(X1,X2),join(X1,X3)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',modular_law) ).

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

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

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

cnf(absorption1,axiom,
    meet(X1,join(X1,X2)) = X1,
    file('/export/starexec/sandbox2/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/sandbox2/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.12  % Problem    : LAT045-1 : TPTP v9.2.1. Released v2.5.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.13/0.33  % Computer : n018.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Mon May  4 20:48:32 EDT 2026
% 0.13/0.33  % CPUTime    : 
% 0.13/0.34  % start to proof: theBenchmark
% 1.35/1.78  % Version  : CSE_E---1.7
% 1.35/1.78  % Problem  : theBenchmark.p
% 1.35/1.78  % SZS status Unsatisfiable for theBenchmark.p
% 1.35/1.78  % SZS output start CNFRefutation
% See solution above
% 1.35/1.78  % Total time : 1.371s
%------------------------------------------------------------------------------