↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 9.53s 6.19s
% Output   : CNFRefutation 9.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   28 (   9 unt;   0 nHn;  28 RR)
%            Number of literals    :   61 (   0 equ;  38 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   35 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
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_addition,axiom,
    ( equalish(add(additive_identity,X1),X1)
    | ~ defined(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',existence_of_identity_addition) ).

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

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

cnf(add_not_equal_to_a_3,negated_conjecture,
    ~ equalish(add(a,add(b,additive_inverse(b))),a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',add_not_equal_to_a_3) ).

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

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

cnf(b_is_defined,hypothesis,
    defined(b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).

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

cnf(well_definedness_of_additive_inverse,axiom,
    ( defined(additive_inverse(X1))
    | ~ defined(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_inverse) ).

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

cnf(c_0_11,axiom,
    ( equalish(add(additive_identity,X1),X1)
    | ~ defined(X1) ),
    existence_of_identity_addition ).

cnf(c_0_12,plain,
    ( equalish(X1,X2)
    | ~ defined(X2)
    | ~ equalish(X1,add(additive_identity,X2)) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_13,axiom,
    ( equalish(add(X1,X2),add(X3,X2))
    | ~ defined(X2)
    | ~ equalish(X1,X3) ),
    compatibility_of_equality_and_addition ).

cnf(c_0_14,plain,
    ( equalish(add(X1,X2),X2)
    | ~ defined(X2)
    | ~ equalish(X1,additive_identity) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_15,plain,
    ( equalish(X1,X2)
    | ~ defined(X2)
    | ~ equalish(X1,add(X3,X2))
    | ~ equalish(X3,additive_identity) ),
    inference(spm,[status(thm)],[c_0_10,c_0_14]) ).

cnf(c_0_16,axiom,
    ( equalish(add(X1,X2),add(X2,X1))
    | ~ defined(X1)
    | ~ defined(X2) ),
    commutativity_addition ).

cnf(c_0_17,negated_conjecture,
    ~ equalish(add(a,add(b,additive_inverse(b))),a),
    add_not_equal_to_a_3 ).

cnf(c_0_18,plain,
    ( equalish(add(X1,X2),X1)
    | ~ defined(X1)
    | ~ defined(X2)
    | ~ equalish(X2,additive_identity) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

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

cnf(c_0_20,negated_conjecture,
    ( ~ defined(add(b,additive_inverse(b)))
    | ~ equalish(add(b,additive_inverse(b)),additive_identity) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).

cnf(c_0_21,axiom,
    ( equalish(add(X1,additive_inverse(X1)),additive_identity)
    | ~ defined(X1) ),
    existence_of_inverse_addition ).

cnf(c_0_22,hypothesis,
    defined(b),
    b_is_defined ).

cnf(c_0_23,negated_conjecture,
    ~ defined(add(b,additive_inverse(b))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).

cnf(c_0_24,axiom,
    ( defined(add(X1,X2))
    | ~ defined(X1)
    | ~ defined(X2) ),
    well_definedness_of_addition ).

cnf(c_0_25,negated_conjecture,
    ~ defined(additive_inverse(b)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_22])]) ).

cnf(c_0_26,axiom,
    ( defined(additive_inverse(X1))
    | ~ defined(X1) ),
    well_definedness_of_additive_inverse ).

cnf(c_0_27,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_22])]),
    [proof] ).

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