↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : FLD068-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 : n020.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:29 PM UTC 2026

% Result   : Unsatisfiable 3.68s 3.15s
% Output   : CNFRefutation 3.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   43 (  19 unt;   2 nHn;  43 RR)
%            Number of literals    :   91 (   0 equ;  48 neg)
%            Maximal clause size   :    4 (   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-1 aty)
%            Number of variables   :   59 (   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(existence_of_inverse_addition,axiom,
    ( sum(additive_inverse(X1),X1,additive_identity)
    | ~ defined(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',existence_of_inverse_addition) ).

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

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

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

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

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

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

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

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

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

cnf(well_definedness_of_additive_identity,axiom,
    defined(additive_identity),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',well_definedness_of_additive_identity) ).

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

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

cnf(c_0_15,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_16,plain,
    ( sum(X1,additive_inverse(X1),additive_identity)
    | ~ defined(X1) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,plain,
    ( less_or_equal(X1,additive_identity)
    | ~ less_or_equal(X2,X3)
    | ~ defined(X3)
    | ~ sum(X2,additive_inverse(X3),X1) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_18,negated_conjecture,
    sum(b,additive_inverse(a),u),
    sum_4 ).

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

cnf(c_0_20,axiom,
    ( sum(X1,X2,X3)
    | ~ sum(X1,X4,X5)
    | ~ sum(X4,X6,X2)
    | ~ sum(X5,X6,X3) ),
    associativity_addition_1 ).

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

cnf(c_0_22,axiom,
    ( sum(additive_identity,X1,X2)
    | ~ less_or_equal(X1,X2)
    | ~ less_or_equal(X2,X1) ),
    antisymmetry_of_order_relation ).

cnf(c_0_23,negated_conjecture,
    less_or_equal(additive_identity,u),
    less_or_equal_5 ).

cnf(c_0_24,negated_conjecture,
    ( less_or_equal(u,additive_identity)
    | ~ less_or_equal(b,a) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).

cnf(c_0_25,axiom,
    ( less_or_equal(X1,X2)
    | less_or_equal(X2,X1)
    | ~ defined(X1)
    | ~ defined(X2) ),
    totality_of_order_relation ).

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

cnf(c_0_27,negated_conjecture,
    ~ less_or_equal(a,b),
    not_less_or_equal_6 ).

cnf(c_0_28,plain,
    ( sum(X1,X2,X3)
    | ~ defined(X3)
    | ~ sum(X1,X4,additive_identity)
    | ~ sum(X4,X3,X2) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_29,negated_conjecture,
    ( sum(additive_identity,u,additive_identity)
    | ~ less_or_equal(u,additive_identity) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_30,negated_conjecture,
    less_or_equal(u,additive_identity),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_19]),c_0_26])]),c_0_27]) ).

cnf(c_0_31,plain,
    ( sum(X1,X2,X3)
    | ~ defined(X3)
    | ~ defined(X1)
    | ~ sum(additive_inverse(X1),X3,X2) ),
    inference(spm,[status(thm)],[c_0_28,c_0_16]) ).

cnf(c_0_32,negated_conjecture,
    sum(additive_inverse(a),b,u),
    inference(spm,[status(thm)],[c_0_13,c_0_18]) ).

cnf(c_0_33,negated_conjecture,
    sum(additive_identity,u,additive_identity),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]) ).

cnf(c_0_34,negated_conjecture,
    sum(a,u,b),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_26]),c_0_19])]) ).

cnf(c_0_35,plain,
    ( less_or_equal(X1,X2)
    | ~ less_or_equal(X3,additive_identity)
    | ~ defined(X2)
    | ~ sum(X3,X2,X1) ),
    inference(spm,[status(thm)],[c_0_15,c_0_21]) ).

cnf(c_0_36,plain,
    ( less_or_equal(X1,X1)
    | ~ defined(X1) ),
    inference(ef,[status(thm)],[c_0_25]) ).

cnf(c_0_37,axiom,
    defined(additive_identity),
    well_definedness_of_additive_identity ).

cnf(c_0_38,negated_conjecture,
    ( sum(additive_identity,X1,X2)
    | ~ defined(X2)
    | ~ sum(u,X2,X1) ),
    inference(spm,[status(thm)],[c_0_28,c_0_33]) ).

cnf(c_0_39,negated_conjecture,
    sum(u,a,b),
    inference(spm,[status(thm)],[c_0_13,c_0_34]) ).

cnf(c_0_40,plain,
    ( less_or_equal(X1,X2)
    | ~ defined(X2)
    | ~ sum(additive_identity,X2,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).

cnf(c_0_41,negated_conjecture,
    sum(additive_identity,b,a),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_19])]) ).

cnf(c_0_42,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_26])]),c_0_27]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : FLD068-4 : 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.16/0.33  % Computer : n020.cluster.edu
% 0.16/0.33  % Model    : x86_64 x86_64
% 0.16/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33  % Memory   : 8042.1875MB
% 0.16/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33  % CPULimit   : 300
% 0.16/0.33  % WCLimit    : 300
% 0.16/0.33  % DateTime   : Mon May  4 17:30:35 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.35  % start to proof: theBenchmark
% 3.68/3.15  % Version  : CSE_E---1.7
% 3.68/3.15  % Problem  : theBenchmark.p
% 3.68/3.15  % SZS status Unsatisfiable for theBenchmark.p
% 3.68/3.15  % SZS output start CNFRefutation
% See solution above
% 3.68/3.16  % Total time : 2.372s
%------------------------------------------------------------------------------