↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SET054-6 : 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 : n004.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:07:02 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(equal_implies_subclass2,axiom,
    ( subclass(X2,X1)
    | X1 != X2 ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',equal_implies_subclass2) ).

cnf(prove_subclass_is_reflexive_1,negated_conjecture,
    ~ subclass(x,x),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_subclass_is_reflexive_1) ).

cnf(c_0_2,axiom,
    ( subclass(X2,X1)
    | X1 != X2 ),
    equal_implies_subclass2 ).

cnf(c_0_3,negated_conjecture,
    ~ subclass(x,x),
    prove_subclass_is_reflexive_1 ).

cnf(c_0_4,plain,
    subclass(X1,X1),
    inference(er,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SET054-6 : 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.15/0.33  % Computer : n004.cluster.edu
% 0.15/0.33  % Model    : x86_64 x86_64
% 0.15/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33  % Memory   : 8042.1875MB
% 0.15/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33  % CPULimit   : 300
% 0.15/0.33  % WCLimit    : 300
% 0.15/0.33  % DateTime   : Tue May  5 02:06:47 EDT 2026
% 0.15/0.34  % CPUTime    : 
% 0.15/0.35  % start to proof: theBenchmark
% 0.29/1.63  % Version  : CSE_E---1.7
% 0.29/1.63  % Problem  : theBenchmark.p
% 0.29/1.63  % SZS status Unsatisfiable for theBenchmark.p
% 0.29/1.63  % SZS output start CNFRefutation
% See solution above
% 0.29/1.63  % Total time : 1.270s
%------------------------------------------------------------------------------