↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : FLD034-1 : TPTP v9.2.1. Bugfixed v2.1.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 : n014.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:18:19 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(existence_of_identity_multiplication,axiom,
    ( equalish(multiply(multiplicative_identity,X1),X1)
    | ~ defined(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',existence_of_identity_multiplication) ).

cnf(a_is_defined,hypothesis,
    defined(a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).

cnf(compatibility_of_equality_and_multiplication,axiom,
    ( equalish(multiply(X1,X2),multiply(X3,X2))
    | ~ defined(X2)
    | ~ equalish(X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_multiplication) ).

cnf(m_equals_multiplicative_identity_3,negated_conjecture,
    equalish(m,multiplicative_identity),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_equals_multiplicative_identity_3) ).

cnf(transitivity_of_equality,axiom,
    ( equalish(X1,X2)
    | ~ equalish(X1,X3)
    | ~ equalish(X3,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',transitivity_of_equality) ).

cnf(multiply_not_equal_to_a_4,negated_conjecture,
    ~ equalish(multiply(m,a),a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply_not_equal_to_a_4) ).

cnf(c_0_6,axiom,
    ( equalish(multiply(multiplicative_identity,X1),X1)
    | ~ defined(X1) ),
    existence_of_identity_multiplication ).

cnf(c_0_7,hypothesis,
    defined(a),
    a_is_defined ).

cnf(c_0_8,axiom,
    ( equalish(multiply(X1,X2),multiply(X3,X2))
    | ~ defined(X2)
    | ~ equalish(X1,X3) ),
    compatibility_of_equality_and_multiplication ).

cnf(c_0_9,negated_conjecture,
    equalish(m,multiplicative_identity),
    m_equals_multiplicative_identity_3 ).

cnf(c_0_10,axiom,
    ( equalish(X1,X2)
    | ~ equalish(X1,X3)
    | ~ equalish(X3,X2) ),
    transitivity_of_equality ).

cnf(c_0_11,hypothesis,
    equalish(multiply(multiplicative_identity,a),a),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_12,negated_conjecture,
    ( equalish(multiply(m,X1),multiply(multiplicative_identity,X1))
    | ~ defined(X1) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,hypothesis,
    ( equalish(X1,a)
    | ~ equalish(X1,multiply(multiplicative_identity,a)) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,hypothesis,
    equalish(multiply(m,a),multiply(multiplicative_identity,a)),
    inference(spm,[status(thm)],[c_0_12,c_0_7]) ).

cnf(c_0_15,negated_conjecture,
    ~ equalish(multiply(m,a),a),
    multiply_not_equal_to_a_4 ).

cnf(c_0_16,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : FLD034-1 : TPTP v9.2.1. Bugfixed v2.1.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.14/0.33  % Computer : n014.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33  % CPULimit   : 300
% 0.14/0.33  % WCLimit    : 300
% 0.14/0.33  % DateTime   : Mon May  4 17:28:07 EDT 2026
% 0.14/0.33  % CPUTime    : 
% 0.14/0.34  % start to proof: theBenchmark
% 1.32/1.74  % Version  : CSE_E---1.7
% 1.32/1.74  % Problem  : theBenchmark.p
% 1.32/1.74  % SZS status Unsatisfiable for theBenchmark.p
% 1.32/1.74  % SZS output start CNFRefutation
% See solution above
% 1.32/1.75  % Total time : 1.370s
%------------------------------------------------------------------------------