↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : FLD063-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 : n031.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 4.15s 3.23s
% Output   : CNFRefutation 4.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   43 (  18 unt;   0 nHn;  43 RR)
%            Number of literals    :   84 (   0 equ;  43 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   57 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
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(b_is_defined,hypothesis,
    defined(b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_defined) ).

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

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(totality_of_addition,axiom,
    ( sum(X1,X2,add(X1,X2))
    | ~ defined(X1)
    | ~ defined(X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',totality_of_addition) ).

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

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

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

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

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

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

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

cnf(c_0_14,hypothesis,
    sum(additive_inverse(b),b,additive_identity),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

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

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

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

cnf(c_0_18,axiom,
    ( sum(X1,X2,X3)
    | ~ sum(X4,X5,X1)
    | ~ sum(X5,X2,X6)
    | ~ sum(X4,X6,X3) ),
    associativity_addition_2 ).

cnf(c_0_19,hypothesis,
    sum(b,additive_inverse(b),additive_identity),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_20,hypothesis,
    sum(additive_identity,a,a),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_21,hypothesis,
    ( sum(X1,b,add(X1,b))
    | ~ defined(X1) ),
    inference(spm,[status(thm)],[c_0_17,c_0_12]) ).

cnf(c_0_22,hypothesis,
    ( sum(X1,additive_inverse(b),X2)
    | ~ sum(X3,additive_identity,X2)
    | ~ sum(X3,b,X1) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_23,hypothesis,
    sum(a,additive_identity,a),
    inference(spm,[status(thm)],[c_0_13,c_0_20]) ).

cnf(c_0_24,hypothesis,
    sum(a,b,add(a,b)),
    inference(spm,[status(thm)],[c_0_21,c_0_16]) ).

cnf(c_0_25,hypothesis,
    ( sum(X1,additive_inverse(b),a)
    | ~ sum(a,b,X1) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

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

cnf(c_0_27,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_28,hypothesis,
    sum(additive_inverse(a),a,additive_identity),
    inference(spm,[status(thm)],[c_0_11,c_0_16]) ).

cnf(c_0_29,hypothesis,
    ( sum(X1,b,X2)
    | ~ sum(X3,add(a,b),X2)
    | ~ sum(X3,a,X1) ),
    inference(spm,[status(thm)],[c_0_18,c_0_24]) ).

cnf(c_0_30,hypothesis,
    ( sum(additive_inverse(b),X1,a)
    | ~ sum(a,b,X1) ),
    inference(spm,[status(thm)],[c_0_13,c_0_25]) ).

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

cnf(c_0_32,hypothesis,
    ( less_or_equal(X1,additive_identity)
    | ~ less_or_equal(X2,additive_inverse(a))
    | ~ sum(X2,a,X1) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_33,negated_conjecture,
    less_or_equal(additive_inverse(b),additive_inverse(a)),
    less_or_equal_3 ).

cnf(c_0_34,hypothesis,
    sum(additive_identity,b,b),
    inference(spm,[status(thm)],[c_0_15,c_0_12]) ).

cnf(c_0_35,hypothesis,
    ( sum(X1,b,a)
    | ~ sum(additive_inverse(b),a,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_24])]) ).

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

cnf(c_0_37,negated_conjecture,
    ( less_or_equal(X1,additive_identity)
    | ~ sum(additive_inverse(b),a,X1) ),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_38,hypothesis,
    ( less_or_equal(X1,b)
    | ~ less_or_equal(X2,additive_identity)
    | ~ sum(X2,b,X1) ),
    inference(spm,[status(thm)],[c_0_27,c_0_34]) ).

cnf(c_0_39,hypothesis,
    sum(add(a,additive_inverse(b)),b,a),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_16]),c_0_12])]) ).

cnf(c_0_40,negated_conjecture,
    less_or_equal(add(a,additive_inverse(b)),additive_identity),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_36]),c_0_16]),c_0_12])]) ).

cnf(c_0_41,negated_conjecture,
    ~ less_or_equal(a,b),
    not_less_or_equal_4 ).

cnf(c_0_42,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]),c_0_41]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : FLD063-3 : TPTP v9.2.1. Bugfixed v2.1.0.
% 0.00/0.12  % 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.16/0.33  % Computer : n031.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:33:08 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 4.15/3.23  % Version  : CSE_E---1.7
% 4.15/3.23  % Problem  : theBenchmark.p
% 4.15/3.23  % SZS status Unsatisfiable for theBenchmark.p
% 4.15/3.23  % SZS output start CNFRefutation
% See solution above
% 4.15/3.24  % Total time : 2.371s
%------------------------------------------------------------------------------