↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : MSC008-1.002 : TPTP v9.2.1. Released v1.0.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 : n009.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:48:55 PM UTC 2026

% Result   : Unsatisfiable 1.45s 1.77s
% Output   : CNFRefutation 1.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   33 (   5 unt;  16 nHn;  17 RR)
%            Number of literals    :   87 (   0 equ;  35 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   94 (  14 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(no_two_same1,negated_conjecture,
    ( eq(X2,X6)
    | ~ greek(X1,X2,X3)
    | ~ latin(X1,X2,X4)
    | ~ greek(X5,X6,X3)
    | ~ latin(X5,X6,X4) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',no_two_same1) ).

cnf(greek_row_required,axiom,
    ( greek(p_1,X1,X2)
    | greek(p_2,X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',greek_row_required) ).

cnf(greek_row_is_unique,axiom,
    ( eq(X1,X4)
    | ~ greek(X1,X2,X3)
    | ~ greek(X4,X2,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',greek_row_is_unique) ).

cnf(greek_column_required,axiom,
    ( greek(X1,p_1,X2)
    | greek(X1,p_2,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',greek_column_required) ).

cnf(latin_row_is_unique,axiom,
    ( eq(X1,X4)
    | ~ latin(X1,X2,X3)
    | ~ latin(X4,X2,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',latin_row_is_unique) ).

cnf(latin_column_required,axiom,
    ( latin(X1,p_1,X2)
    | latin(X1,p_2,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',latin_column_required) ).

cnf(p_1_is_not_p_2,axiom,
    ~ eq(p_1,p_2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p_1_is_not_p_2) ).

cnf(latin_element_is_unique,axiom,
    ( eq(X3,X4)
    | ~ latin(X1,X2,X3)
    | ~ latin(X1,X2,X4) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',latin_element_is_unique) ).

cnf(greek_element_is_unique,axiom,
    ( eq(X3,X4)
    | ~ greek(X1,X2,X3)
    | ~ greek(X1,X2,X4) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',greek_element_is_unique) ).

cnf(symmetry,axiom,
    ( eq(X2,X1)
    | ~ eq(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry) ).

cnf(c_0_10,negated_conjecture,
    ( eq(X2,X6)
    | ~ greek(X1,X2,X3)
    | ~ latin(X1,X2,X4)
    | ~ greek(X5,X6,X3)
    | ~ latin(X5,X6,X4) ),
    no_two_same1 ).

cnf(c_0_11,axiom,
    ( greek(p_1,X1,X2)
    | greek(p_2,X1,X2) ),
    greek_row_required ).

cnf(c_0_12,axiom,
    ( eq(X1,X4)
    | ~ greek(X1,X2,X3)
    | ~ greek(X4,X2,X3) ),
    greek_row_is_unique ).

cnf(c_0_13,axiom,
    ( greek(X1,p_1,X2)
    | greek(X1,p_2,X2) ),
    greek_column_required ).

cnf(c_0_14,axiom,
    ( eq(X1,X4)
    | ~ latin(X1,X2,X3)
    | ~ latin(X4,X2,X3) ),
    latin_row_is_unique ).

cnf(c_0_15,axiom,
    ( latin(X1,p_1,X2)
    | latin(X1,p_2,X2) ),
    latin_column_required ).

cnf(c_0_16,negated_conjecture,
    ( greek(p_1,X1,X2)
    | eq(X3,X1)
    | ~ greek(X4,X3,X2)
    | ~ latin(p_2,X1,X5)
    | ~ latin(X4,X3,X5) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_17,plain,
    ( greek(X1,p_1,X2)
    | eq(X3,X1)
    | ~ greek(X3,p_2,X2) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_18,plain,
    ( latin(X1,p_1,X2)
    | eq(X3,X1)
    | ~ latin(X3,p_2,X2) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_19,negated_conjecture,
    ( greek(p_1,p_2,X1)
    | latin(p_2,p_1,X2)
    | eq(X3,p_2)
    | ~ greek(X4,X3,X1)
    | ~ latin(X4,X3,X2) ),
    inference(spm,[status(thm)],[c_0_16,c_0_15]) ).

cnf(c_0_20,plain,
    ( greek(p_1,p_2,X1)
    | greek(X2,p_1,X1)
    | eq(p_2,X2) ),
    inference(spm,[status(thm)],[c_0_17,c_0_11]) ).

cnf(c_0_21,axiom,
    ~ eq(p_1,p_2),
    p_1_is_not_p_2 ).

cnf(c_0_22,plain,
    ( latin(X1,p_1,X2)
    | latin(X3,p_1,X2)
    | eq(X1,X3) ),
    inference(spm,[status(thm)],[c_0_18,c_0_15]) ).

cnf(c_0_23,axiom,
    ( eq(X3,X4)
    | ~ latin(X1,X2,X3)
    | ~ latin(X1,X2,X4) ),
    latin_element_is_unique ).

cnf(c_0_24,negated_conjecture,
    ( greek(p_1,p_2,X1)
    | latin(p_2,p_1,X2)
    | eq(p_2,X3) ),
    inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22]) ).

cnf(c_0_25,negated_conjecture,
    ( greek(p_1,p_2,X1)
    | eq(p_2,X2)
    | eq(X3,X4) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_24]) ).

cnf(c_0_26,axiom,
    ( eq(X3,X4)
    | ~ greek(X1,X2,X3)
    | ~ greek(X1,X2,X4) ),
    greek_element_is_unique ).

cnf(c_0_27,negated_conjecture,
    ( greek(p_1,p_2,X1)
    | eq(p_2,X2) ),
    inference(ef,[status(thm)],[c_0_25]) ).

cnf(c_0_28,negated_conjecture,
    ( eq(p_2,X1)
    | eq(X2,X3) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_27]) ).

cnf(c_0_29,axiom,
    ( eq(X2,X1)
    | ~ eq(X1,X2) ),
    symmetry ).

cnf(c_0_30,negated_conjecture,
    eq(p_2,X1),
    inference(ef,[status(thm)],[c_0_28]) ).

cnf(c_0_31,negated_conjecture,
    eq(X1,p_2),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_32,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_31])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : MSC008-1.002 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.11  % 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.14/0.32  % Computer : n009.cluster.edu
% 0.14/0.32  % Model    : x86_64 x86_64
% 0.14/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32  % Memory   : 8042.1875MB
% 0.14/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32  % CPULimit   : 300
% 0.14/0.32  % WCLimit    : 300
% 0.14/0.32  % DateTime   : Mon May  4 23:33:56 EDT 2026
% 0.14/0.32  % CPUTime    : 
% 0.14/0.33  % start to proof: theBenchmark
% 1.45/1.77  % Version  : CSE_E---1.7
% 1.45/1.77  % Problem  : theBenchmark.p
% 1.45/1.77  % SZS status Unsatisfiable for theBenchmark.p
% 1.45/1.77  % SZS output start CNFRefutation
% See solution above
% 1.45/1.77  % Total time : 1.370s
%------------------------------------------------------------------------------