↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 1.24s 1.71s
% Output   : CNFRefutation 1.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   17 (  11 unt;   0 nHn;  17 RR)
%            Number of literals    :   30 (   0 equ;  15 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    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   13 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(compatibility_of_order_relation_and_multiplication,axiom,
    ( less_or_equal(additive_identity,X1)
    | ~ less_or_equal(additive_identity,X2)
    | ~ less_or_equal(additive_identity,X3)
    | ~ product(X2,X3,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',compatibility_of_order_relation_and_multiplication) ).

cnf(less_or_equal_4,negated_conjecture,
    less_or_equal(additive_identity,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_4) ).

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

cnf(totality_of_multiplication,axiom,
    ( product(X1,X2,multiply(X1,X2))
    | ~ defined(X1)
    | ~ defined(X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',totality_of_multiplication) ).

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

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

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

cnf(c_0_7,axiom,
    ( less_or_equal(additive_identity,X1)
    | ~ less_or_equal(additive_identity,X2)
    | ~ less_or_equal(additive_identity,X3)
    | ~ product(X2,X3,X1) ),
    compatibility_of_order_relation_and_multiplication ).

cnf(c_0_8,negated_conjecture,
    less_or_equal(additive_identity,b),
    less_or_equal_4 ).

cnf(c_0_9,negated_conjecture,
    ( less_or_equal(additive_identity,X1)
    | ~ less_or_equal(additive_identity,X2)
    | ~ product(X2,b,X1) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_10,negated_conjecture,
    less_or_equal(additive_identity,a),
    less_or_equal_3 ).

cnf(c_0_11,negated_conjecture,
    ( less_or_equal(additive_identity,X1)
    | ~ product(a,b,X1) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_12,axiom,
    ( product(X1,X2,multiply(X1,X2))
    | ~ defined(X1)
    | ~ defined(X2) ),
    totality_of_multiplication ).

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

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

cnf(c_0_15,negated_conjecture,
    ~ less_or_equal(additive_identity,multiply(a,b)),
    not_less_or_equal_5 ).

cnf(c_0_16,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_11,c_0_12]),c_0_13]),c_0_14])]),c_0_15]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : FLD071-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 : n029.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:31:29 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
%------------------------------------------------------------------------------