↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 1.11s 1.61s
% Output   : CNFRefutation 1.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    8 (   8 unt;   0 nHn;   3 RR)
%            Number of literals    :    8 (   7 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    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   14 (   9 sgn)

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

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

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

cnf(c_0_3,axiom,
    meet(X1,join(X2,join(X1,X3))) = X1,
    mckenzie2 ).

cnf(c_0_4,axiom,
    join(join(meet(X1,X2),meet(X2,X3)),X2) = X2,
    mckenzie3 ).

cnf(c_0_5,negated_conjecture,
    meet(a,join(a,b)) != a,
    prove_absorbtion ).

cnf(c_0_6,plain,
    meet(X1,join(X1,X2)) = X1,
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06  % Problem    : LAT014-1 : TPTP v9.2.1. Released v2.2.0.
% 0.00/0.06  % 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.06/0.24  % Computer : n012.cluster.edu
% 0.06/0.24  % Model    : x86_64 x86_64
% 0.06/0.24  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.24  % Memory   : 8042.1875MB
% 0.06/0.24  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.06/0.24  % CPULimit   : 300
% 0.06/0.24  % WCLimit    : 300
% 0.06/0.24  % DateTime   : Mon May  4 20:47:01 EDT 2026
% 0.06/0.24  % CPUTime    : 
% 0.06/0.25  % start to proof: theBenchmark
% 1.11/1.61  % Version  : CSE_E---1.7
% 1.11/1.61  % Problem  : theBenchmark.p
% 1.11/1.61  % SZS status Unsatisfiable for theBenchmark.p
% 1.11/1.61  % SZS output start CNFRefutation
% See solution above
% 1.11/1.61  % Total time : 1.362s
%------------------------------------------------------------------------------