↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : FLD065-3 : 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 : n022.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:28 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(existence_of_identity_addition,axiom,
    ( sum(additive_identity,X1,X1)
    | ~ defined(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',existence_of_identity_addition) ).

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

cnf(compatibility_of_order_relation_and_addition,axiom,
    ( less_or_equal(X1,X2)
    | ~ less_or_equal(X3,X4)
    | ~ sum(X3,X5,X1)
    | ~ sum(X4,X5,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',compatibility_of_order_relation_and_addition) ).

cnf(existence_of_inverse_addition,axiom,
    ( sum(additive_inverse(X1),X1,additive_identity)
    | ~ defined(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',existence_of_inverse_addition) ).

cnf(less_or_equal_2,negated_conjecture,
    less_or_equal(additive_inverse(a),additive_identity),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_2) ).

cnf(not_less_or_equal_3,negated_conjecture,
    ~ less_or_equal(additive_identity,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_3) ).

cnf(c_0_6,axiom,
    ( sum(additive_identity,X1,X1)
    | ~ defined(X1) ),
    existence_of_identity_addition ).

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

cnf(c_0_8,axiom,
    ( less_or_equal(X1,X2)
    | ~ less_or_equal(X3,X4)
    | ~ sum(X3,X5,X1)
    | ~ sum(X4,X5,X2) ),
    compatibility_of_order_relation_and_addition ).

cnf(c_0_9,hypothesis,
    sum(additive_identity,a,a),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,axiom,
    ( sum(additive_inverse(X1),X1,additive_identity)
    | ~ defined(X1) ),
    existence_of_inverse_addition ).

cnf(c_0_11,hypothesis,
    ( less_or_equal(X1,a)
    | ~ less_or_equal(X2,additive_identity)
    | ~ sum(X2,a,X1) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,hypothesis,
    sum(additive_inverse(a),a,additive_identity),
    inference(spm,[status(thm)],[c_0_10,c_0_7]) ).

cnf(c_0_13,negated_conjecture,
    less_or_equal(additive_inverse(a),additive_identity),
    less_or_equal_2 ).

cnf(c_0_14,negated_conjecture,
    ~ less_or_equal(additive_identity,a),
    not_less_or_equal_3 ).

cnf(c_0_15,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),c_0_14]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : FLD065-3 : TPTP v9.2.1. Bugfixed v2.1.0.
% 0.00/0.11  % 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.32  % Computer : n022.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 17:30:51 EDT 2026
% 0.14/0.32  % CPUTime    : 
% 0.14/0.33  % start to proof: theBenchmark
% 1.24/1.71  % Version  : CSE_E---1.7
% 1.24/1.71  % Problem  : theBenchmark.p
% 1.24/1.71  % SZS status Unsatisfiable for theBenchmark.p
% 1.24/1.71  % SZS output start CNFRefutation
% See solution above
% 1.24/1.71  % Total time : 1.371s
%------------------------------------------------------------------------------