↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 1.94s 1.82s
% Output   : CNFRefutation 1.94s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   30 (  15 unt;   0 nHn;  30 RR)
%            Number of literals    :   64 (   0 equ;  36 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   42 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
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/sandbox/benchmark/Axioms/FLD002-0.ax',compatibility_of_order_relation_and_addition) ).

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

cnf(commutativity_addition,axiom,
    ( sum(X1,X2,X3)
    | ~ sum(X2,X1,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',commutativity_addition) ).

cnf(less_or_equal_6,negated_conjecture,
    less_or_equal(c,d),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_6) ).

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

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

cnf(transitivity_of_order_relation,axiom,
    ( less_or_equal(X1,X2)
    | ~ less_or_equal(X1,X3)
    | ~ less_or_equal(X3,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',transitivity_of_order_relation) ).

cnf(less_or_equal_5,negated_conjecture,
    less_or_equal(a,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_5) ).

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

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

cnf(not_less_or_equal_7,negated_conjecture,
    ~ less_or_equal(add(a,c),add(d,b)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_7) ).

cnf(c_0_11,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_12,axiom,
    ( sum(X1,X2,add(X1,X2))
    | ~ defined(X1)
    | ~ defined(X2) ),
    totality_of_addition ).

cnf(c_0_13,axiom,
    ( sum(X1,X2,X3)
    | ~ sum(X2,X1,X3) ),
    commutativity_addition ).

cnf(c_0_14,plain,
    ( less_or_equal(X1,add(X2,X3))
    | ~ less_or_equal(X4,X2)
    | ~ defined(X3)
    | ~ defined(X2)
    | ~ sum(X4,X3,X1) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

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

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

cnf(c_0_17,negated_conjecture,
    less_or_equal(c,d),
    less_or_equal_6 ).

cnf(c_0_18,hypothesis,
    defined(d),
    d_is_defined ).

cnf(c_0_19,hypothesis,
    defined(c),
    c_is_defined ).

cnf(c_0_20,axiom,
    ( less_or_equal(X1,X2)
    | ~ less_or_equal(X1,X3)
    | ~ less_or_equal(X3,X2) ),
    transitivity_of_order_relation ).

cnf(c_0_21,negated_conjecture,
    ( less_or_equal(add(X1,c),add(d,X1))
    | ~ defined(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19])]) ).

cnf(c_0_22,plain,
    ( less_or_equal(add(X1,X2),add(X3,X2))
    | ~ less_or_equal(X1,X3)
    | ~ defined(X2)
    | ~ defined(X3)
    | ~ defined(X1) ),
    inference(spm,[status(thm)],[c_0_14,c_0_12]) ).

cnf(c_0_23,negated_conjecture,
    less_or_equal(a,b),
    less_or_equal_5 ).

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

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

cnf(c_0_26,negated_conjecture,
    ( less_or_equal(X1,add(d,X2))
    | ~ less_or_equal(X1,add(X2,c))
    | ~ defined(X2) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_27,negated_conjecture,
    ( less_or_equal(add(a,X1),add(b,X1))
    | ~ defined(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25])]) ).

cnf(c_0_28,negated_conjecture,
    ~ less_or_equal(add(a,c),add(d,b)),
    not_less_or_equal_7 ).

cnf(c_0_29,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_24]),c_0_19])]),c_0_28]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06  % Problem    : FLD061-3 : TPTP v9.2.1. Bugfixed v2.1.0.
% 0.00/0.06  % 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.07/0.24  % Computer : n012.cluster.edu
% 0.07/0.24  % Model    : x86_64 x86_64
% 0.07/0.24  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.24  % Memory   : 8042.1875MB
% 0.07/0.24  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.07/0.24  % CPULimit   : 300
% 0.07/0.24  % WCLimit    : 300
% 0.07/0.24  % DateTime   : Mon May  4 17:29:46 EDT 2026
% 0.07/0.24  % CPUTime    : 
% 0.07/0.25  % start to proof: theBenchmark
% 1.94/1.82  % Version  : CSE_E---1.7
% 1.94/1.82  % Problem  : theBenchmark.p
% 1.94/1.82  % SZS status Unsatisfiable for theBenchmark.p
% 1.94/1.82  % SZS output start CNFRefutation
% See solution above
% 1.94/1.83  % Total time : 1.361s
%------------------------------------------------------------------------------