↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 1.25s 1.71s
% Output   : CNFRefutation 1.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   23 (   9 unt;   7 nHn;  23 RR)
%            Number of literals    :   44 (   0 equ;  19 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   18 (   0 sgn)

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

cnf(well_definedness_of_multiplicative_identity,axiom,
    defined(multiplicative_identity),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',well_definedness_of_multiplicative_identity) ).

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

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

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

cnf(multiplicative_inv_not_equal_to_multiplicative_id_2,negated_conjecture,
    ~ equalish(multiplicative_inverse(multiplicative_identity),multiplicative_identity),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_inv_not_equal_to_multiplicative_id_2) ).

cnf(well_definedness_of_multiplicative_inverse,axiom,
    ( defined(multiplicative_inverse(X1))
    | equalish(X1,additive_identity)
    | ~ defined(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',well_definedness_of_multiplicative_inverse) ).

cnf(different_identities,axiom,
    ~ equalish(additive_identity,multiplicative_identity),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',different_identities) ).

cnf(c_0_8,axiom,
    ( equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity)
    | equalish(X1,additive_identity)
    | ~ defined(X1) ),
    existence_of_inverse_multiplication ).

cnf(c_0_9,axiom,
    defined(multiplicative_identity),
    well_definedness_of_multiplicative_identity ).

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

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

cnf(c_0_12,axiom,
    ( equalish(X1,X2)
    | ~ equalish(X2,X1) ),
    symmetry_of_equality ).

cnf(c_0_13,plain,
    ( equalish(multiply(multiplicative_identity,multiplicative_inverse(multiplicative_identity)),multiplicative_identity)
    | equalish(multiplicative_identity,additive_identity) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_14,negated_conjecture,
    ~ equalish(multiplicative_inverse(multiplicative_identity),multiplicative_identity),
    multiplicative_inv_not_equal_to_multiplicative_id_2 ).

cnf(c_0_15,axiom,
    ( defined(multiplicative_inverse(X1))
    | equalish(X1,additive_identity)
    | ~ defined(X1) ),
    well_definedness_of_multiplicative_inverse ).

cnf(c_0_16,plain,
    ( equalish(X1,X2)
    | ~ defined(X2)
    | ~ equalish(X1,multiply(multiplicative_identity,X2)) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_17,plain,
    ( equalish(multiplicative_identity,multiply(multiplicative_identity,multiplicative_inverse(multiplicative_identity)))
    | equalish(multiplicative_identity,additive_identity) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_18,negated_conjecture,
    ~ equalish(multiplicative_identity,multiplicative_inverse(multiplicative_identity)),
    inference(spm,[status(thm)],[c_0_14,c_0_12]) ).

cnf(c_0_19,plain,
    ( defined(multiplicative_inverse(multiplicative_identity))
    | equalish(multiplicative_identity,additive_identity) ),
    inference(spm,[status(thm)],[c_0_15,c_0_9]) ).

cnf(c_0_20,plain,
    equalish(multiplicative_identity,additive_identity),
    inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19]) ).

cnf(c_0_21,axiom,
    ~ equalish(additive_identity,multiplicative_identity),
    different_identities ).

cnf(c_0_22,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_20]),c_0_21]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : FLD010-1 : TPTP v9.2.1. Bugfixed v2.7.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.15/0.32  % Computer : n009.cluster.edu
% 0.15/0.32  % Model    : x86_64 x86_64
% 0.15/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32  % Memory   : 8042.1875MB
% 0.15/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32  % CPULimit   : 300
% 0.15/0.32  % WCLimit    : 300
% 0.15/0.32  % DateTime   : Mon May  4 17:26:26 EDT 2026
% 0.15/0.32  % CPUTime    : 
% 0.15/0.33  % start to proof: theBenchmark
% 1.25/1.71  % Version  : CSE_E---1.7
% 1.25/1.71  % Problem  : theBenchmark.p
% 1.25/1.71  % SZS status Unsatisfiable for theBenchmark.p
% 1.25/1.71  % SZS output start CNFRefutation
% See solution above
% 1.25/1.71  % Total time : 1.371s
%------------------------------------------------------------------------------