↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : FLD061-4 : 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 : n017.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.20s 1.90s
% Output   : CNFRefutation 1.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   33 (  19 unt;   0 nHn;  33 RR)
%            Number of literals    :   61 (   0 equ;  30 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   37 (   0 sgn)

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

cnf(sum_10,negated_conjecture,
    sum(d,b,v),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_10) ).

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(less_or_equal_7,negated_conjecture,
    less_or_equal(a,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_7) ).

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(sum_9,negated_conjecture,
    sum(a,c,u),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_9) ).

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

cnf(d_is_defined,hypothesis,
    defined(d),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d_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_8,negated_conjecture,
    less_or_equal(c,d),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_8) ).

cnf(not_less_or_equal_11,negated_conjecture,
    ~ less_or_equal(u,v),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_11) ).

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

cnf(c_0_12,negated_conjecture,
    sum(d,b,v),
    sum_10 ).

cnf(c_0_13,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_14,negated_conjecture,
    sum(b,d,v),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,negated_conjecture,
    ( less_or_equal(X1,v)
    | ~ less_or_equal(X2,b)
    | ~ sum(X2,d,X1) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_16,negated_conjecture,
    less_or_equal(a,b),
    less_or_equal_7 ).

cnf(c_0_17,axiom,
    ( sum(X1,X2,add(X1,X2))
    | ~ defined(X1)
    | ~ defined(X2) ),
    totality_of_addition ).

cnf(c_0_18,negated_conjecture,
    sum(a,c,u),
    sum_9 ).

cnf(c_0_19,negated_conjecture,
    ( less_or_equal(X1,v)
    | ~ sum(a,d,X1) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_20,plain,
    ( sum(X1,X2,add(X2,X1))
    | ~ defined(X1)
    | ~ defined(X2) ),
    inference(spm,[status(thm)],[c_0_11,c_0_17]) ).

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

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

cnf(c_0_23,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_13,c_0_17]) ).

cnf(c_0_24,negated_conjecture,
    sum(c,a,u),
    inference(spm,[status(thm)],[c_0_11,c_0_18]) ).

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

cnf(c_0_26,negated_conjecture,
    less_or_equal(add(d,a),v),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).

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

cnf(c_0_28,negated_conjecture,
    less_or_equal(c,d),
    less_or_equal_8 ).

cnf(c_0_29,negated_conjecture,
    ( less_or_equal(X1,v)
    | ~ less_or_equal(X1,add(d,a)) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_30,negated_conjecture,
    less_or_equal(u,add(d,a)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_22])]) ).

cnf(c_0_31,negated_conjecture,
    ~ less_or_equal(u,v),
    not_less_or_equal_11 ).

cnf(c_0_32,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.25  % Problem    : FLD061-4 : TPTP v9.2.1. Bugfixed v2.1.0.
% 0.03/0.25  % 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.12/0.49  % Computer : n017.cluster.edu
% 0.12/0.49  % Model    : x86_64 x86_64
% 0.12/0.49  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.49  % Memory   : 8042.1875MB
% 0.12/0.49  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.49  % CPULimit   : 300
% 0.12/0.49  % WCLimit    : 300
% 0.12/0.49  % DateTime   : Mon May  4 17:28:27 EDT 2026
% 0.12/0.49  % CPUTime    : 
% 0.12/0.50  % start to proof: theBenchmark
% 1.20/1.90  % Version  : CSE_E---1.7
% 1.20/1.90  % Problem  : theBenchmark.p
% 1.20/1.90  % SZS status Unsatisfiable for theBenchmark.p
% 1.20/1.90  % SZS output start CNFRefutation
% See solution above
% 1.20/1.90  % Total time : 1.380s
%------------------------------------------------------------------------------