↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : LCL007-1 : TPTP v9.2.1. Released v1.0.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 : n002.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:39:10 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_ec_2,negated_conjecture,
    ~ is_a_theorem(equivalent(equivalent(a,equivalent(b,c)),equivalent(equivalent(a,b),c))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ec_2) ).

cnf(ec_5,axiom,
    is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(X1,equivalent(X2,X3)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ec_5) ).

cnf(ec_4,axiom,
    is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X2,X1))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ec_4) ).

cnf(condensed_detachment,axiom,
    ( is_a_theorem(X2)
    | ~ is_a_theorem(equivalent(X1,X2))
    | ~ is_a_theorem(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).

cnf(i_0_4,negated_conjecture,
    ~ is_a_theorem(equivalent(equivalent(a,equivalent(b,c)),equivalent(equivalent(a,b),c))),
    prove_ec_2,
    [final] ).

cnf(i_0_5,axiom,
    is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(X1,equivalent(X2,X3)))),
    ec_5,
    [final] ).

cnf(i_0_6,axiom,
    is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X2,X1))),
    ec_4,
    [final] ).

cnf(i_0_7,axiom,
    ( is_a_theorem(X2)
    | ~ is_a_theorem(equivalent(X1,X2))
    | ~ is_a_theorem(X1) ),
    condensed_detachment,
    [final] ).

cnf(i_0_8,plain,
    $false,
    inference(scs_inference,[],[i_0_4,i_0_6,i_0_5,i_0_7]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : LCL007-1 : TPTP v9.2.1. Released v1.0.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.32  % Computer : n002.cluster.edu
% 0.15/0.32  % Model    : x86_64 x86_64
% 0.15/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32  % Memory   : 8042.1875MB
% 0.15/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32  % CPULimit   : 300
% 0.15/0.32  % WCLimit    : 300
% 0.15/0.32  % DateTime   : Mon May  4 21:51:46 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 0.24/1.61  % Version  : CSE_E---1.7
% 0.24/1.61  % Problem  : theBenchmark.p
% 0.24/1.61  % SZS status Unsatisfiable for theBenchmark.p
% 0.24/1.61  % SZS output start CNFRefutation
% See solution above
% 0.24/1.63  % Total time : 1.271s
%------------------------------------------------------------------------------