↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : RNG010-2 : TPTP v9.2.1. Bugfixed v1.2.1.
% 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 : n010.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 05:04:59 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(middle_law,axiom,
    multiply(multiply(X1,X2),X1) != multiply(X1,multiply(X2,X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',middle_law) ).

cnf(right_multiplicative_zero,axiom,
    multiply(X1,additive_identity) = additive_identity,
    file('/export/starexec/sandbox2/benchmark/Axioms/RNG004-0.ax',right_multiplicative_zero) ).

cnf(c_0_2,axiom,
    multiply(multiply(X1,X2),X1) != multiply(X1,multiply(X2,X1)),
    middle_law ).

cnf(c_0_3,axiom,
    multiply(X1,additive_identity) = additive_identity,
    right_multiplicative_zero ).

cnf(c_0_4,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_3]),c_0_3]),c_0_3])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : RNG010-2 : TPTP v9.2.1. Bugfixed v1.2.1.
% 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.13/0.31  % Computer : n010.cluster.edu
% 0.13/0.31  % Model    : x86_64 x86_64
% 0.13/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.31  % Memory   : 8042.1875MB
% 0.13/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.31  % CPULimit   : 300
% 0.13/0.31  % WCLimit    : 300
% 0.13/0.31  % DateTime   : Tue May  5 01:45:21 EDT 2026
% 0.13/0.31  % CPUTime    : 
% 0.13/0.32  % start to proof: theBenchmark
% 0.24/1.59  % Version  : CSE_E---1.7
% 0.24/1.59  % Problem  : theBenchmark.p
% 0.24/1.59  % SZS status Unsatisfiable for theBenchmark.p
% 0.24/1.59  % SZS output start CNFRefutation
% See solution above
% 0.24/1.59  % Total time : 1.270s
%------------------------------------------------------------------------------