↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Computer : n008.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:18 PM UTC 2026

% Result   : Unsatisfiable 1.29s 1.73s
% Output   : CNFRefutation 1.29s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   21 (  21 unt;   0 nHn;   3 RR)
%            Number of literals    :   21 (  20 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    5 (   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   :   45 (  21 sgn)

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

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

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

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

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

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

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

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

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

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

cnf(c_0_10,plain,
    meet(X1,X1) = X1,
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,axiom,
    meet(meet(join(X1,X2),join(X2,X3)),X2) = X2,
    mckenzie4 ).

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

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

cnf(c_0_14,plain,
    meet(meet(X1,X2),X1) = meet(X1,X2),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

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

cnf(c_0_16,plain,
    join(meet(X1,X2),X1) = X1,
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,plain,
    meet(meet(X1,X2),meet(X2,X1)) = meet(X2,X1),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_18,negated_conjecture,
    meet(b,a) != meet(a,b),
    prove_commutativity_of_meet ).

cnf(c_0_19,plain,
    meet(X1,X2) = meet(X2,X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_17]),c_0_17]) ).

cnf(c_0_20,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : LAT012-1 : TPTP v9.2.1. Released v2.2.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33  % Computer : n008.cluster.edu
% 0.15/0.33  % Model    : x86_64 x86_64
% 0.15/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33  % Memory   : 8042.1875MB
% 0.15/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33  % CPULimit   : 300
% 0.15/0.33  % WCLimit    : 300
% 0.15/0.33  % DateTime   : Mon May  4 20:47:13 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 1.29/1.73  % Version  : CSE_E---1.7
% 1.29/1.73  % Problem  : theBenchmark.p
% 1.29/1.73  % SZS status Unsatisfiable for theBenchmark.p
% 1.29/1.73  % SZS output start CNFRefutation
% See solution above
% 1.29/1.74  % Total time : 1.371s
%------------------------------------------------------------------------------