↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : LAT039-2 : TPTP v9.2.1. Released v2.4.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:24 PM UTC 2026

% Result   : Unsatisfiable 0.21s 1.62s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   11 (  11 unt;   0 nHn;   6 RR)
%            Number of literals    :   11 (  10 equ;   3 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   :   11 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(rhs,negated_conjecture,
    join(xx,meet(yy,zz)) != meet(join(xx,yy),join(xx,zz)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rhs) ).

cnf(lhs,hypothesis,
    join(xx,yy) = yy,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lhs) ).

cnf(dist_join,hypothesis,
    join(X1,meet(X2,X3)) = meet(join(X1,X2),join(X1,X3)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dist_join) ).

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

cnf(c_0_4,negated_conjecture,
    join(xx,meet(yy,zz)) != meet(join(xx,yy),join(xx,zz)),
    rhs ).

cnf(c_0_5,hypothesis,
    join(xx,yy) = yy,
    lhs ).

cnf(c_0_6,hypothesis,
    join(X1,meet(X2,X3)) = meet(join(X1,X2),join(X1,X3)),
    dist_join ).

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

cnf(c_0_8,negated_conjecture,
    meet(yy,join(xx,zz)) != join(xx,meet(yy,zz)),
    inference(rw,[status(thm)],[c_0_4,c_0_5]) ).

cnf(c_0_9,hypothesis,
    meet(yy,join(xx,X1)) = join(xx,meet(X1,yy)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_5]),c_0_7]) ).

cnf(c_0_10,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_7])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : LAT039-2 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.13  % 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.12/0.32  % Computer : n018.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit   : 300
% 0.12/0.32  % WCLimit    : 300
% 0.12/0.32  % DateTime   : Mon May  4 20:49:02 EDT 2026
% 0.12/0.33  % CPUTime    : 
% 0.12/0.34  % start to proof: theBenchmark
% 0.21/1.62  % Version  : CSE_E---1.7
% 0.21/1.62  % Problem  : theBenchmark.p
% 0.21/1.62  % SZS status Unsatisfiable for theBenchmark.p
% 0.21/1.62  % SZS output start CNFRefutation
% See solution above
% 0.21/1.62  % Total time : 1.274s
%------------------------------------------------------------------------------