↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 1.10s 1.61s
% Output   : CNFRefutation 1.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   15 (   8 unt;   0 nHn;   8 RR)
%            Number of literals    :   26 (   0 equ;  13 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    5 (   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   :   33 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
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(q_3,axiom,
    is_a_theorem(equivalent(X1,equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X3,X2)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',q_3) ).

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

cnf(prove_q_2,negated_conjecture,
    ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,b)),equivalent(a,c))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_q_2) ).

cnf(c_0_4,axiom,
    ( is_a_theorem(X2)
    | ~ is_a_theorem(equivalent(X1,X2))
    | ~ is_a_theorem(X1) ),
    condensed_detachment ).

cnf(c_0_5,axiom,
    is_a_theorem(equivalent(X1,equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X3,X2)))),
    q_3 ).

cnf(c_0_6,plain,
    ( is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X3,X2)))
    | ~ is_a_theorem(X1) ),
    inference(spm,[status(thm)],[c_0_4,c_0_5]) ).

cnf(c_0_7,plain,
    ( is_a_theorem(equivalent(X1,X2))
    | ~ is_a_theorem(equivalent(X3,equivalent(X2,X1)))
    | ~ is_a_theorem(X3) ),
    inference(spm,[status(thm)],[c_0_4,c_0_6]) ).

cnf(c_0_8,plain,
    ( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,equivalent(X2,X1))))
    | ~ is_a_theorem(X3) ),
    inference(spm,[status(thm)],[c_0_7,c_0_5]) ).

cnf(c_0_9,plain,
    ( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
    | ~ is_a_theorem(equivalent(X3,X2))
    | ~ is_a_theorem(X1) ),
    inference(spm,[status(thm)],[c_0_4,c_0_8]) ).

cnf(c_0_10,plain,
    ( is_a_theorem(equivalent(X1,X2))
    | ~ is_a_theorem(equivalent(X2,X1)) ),
    inference(condense,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_9])]) ).

cnf(c_0_11,axiom,
    is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3)))),
    q_4 ).

cnf(c_0_12,negated_conjecture,
    ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,b)),equivalent(a,c))),
    prove_q_2 ).

cnf(c_0_13,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),equivalent(X1,X3))),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06  % Problem    : LCL126-1 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.06  % 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.06/0.24  % Computer : n024.cluster.edu
% 0.06/0.24  % Model    : x86_64 x86_64
% 0.06/0.24  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.24  % Memory   : 8042.1875MB
% 0.06/0.24  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.06/0.24  % CPULimit   : 300
% 0.06/0.24  % WCLimit    : 300
% 0.06/0.24  % DateTime   : Mon May  4 17:01:11 EDT 2026
% 0.06/0.24  % CPUTime    : 
% 0.06/0.25  % start to proof: theBenchmark
% 1.10/1.61  % Version  : CSE_E---1.7
% 1.10/1.61  % Problem  : theBenchmark.p
% 1.10/1.61  % SZS status Unsatisfiable for theBenchmark.p
% 1.10/1.61  % SZS output start CNFRefutation
% See solution above
% 1.10/1.61  % Total time : 1.361s
%------------------------------------------------------------------------------