↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : LCL398-1 : TPTP v9.2.1. Released v2.3.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 : n027.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:40:15 PM UTC 2026

% Result   : Unsatisfiable 1.23s 1.72s
% Output   : CNFRefutation 1.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   17 (  11 unt;   0 nHn;   8 RR)
%            Number of literals    :   26 (   0 equ;  12 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;   2 con; 0-2 aty)
%            Number of variables   :   27 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
    ( is_a_theorem(X2)
    | ~ is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).

cnf(cn_1,axiom,
    is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_1) ).

cnf(cn_3,axiom,
    is_a_theorem(implies(X1,implies(not(X1),X2))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_3) ).

cnf(cn_2,axiom,
    is_a_theorem(implies(implies(not(X1),X1),X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_2) ).

cnf(prove_cn_64,negated_conjecture,
    ~ is_a_theorem(implies(not(implies(x,x)),y)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_64) ).

cnf(c_0_5,axiom,
    ( is_a_theorem(X2)
    | ~ is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(X1) ),
    condensed_detachment ).

cnf(c_0_6,axiom,
    is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
    cn_1 ).

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

cnf(c_0_8,axiom,
    is_a_theorem(implies(X1,implies(not(X1),X2))),
    cn_3 ).

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

cnf(c_0_10,axiom,
    is_a_theorem(implies(implies(not(X1),X1),X1)),
    cn_2 ).

cnf(c_0_11,negated_conjecture,
    ~ is_a_theorem(implies(not(implies(x,x)),y)),
    prove_cn_64 ).

cnf(c_0_12,plain,
    ( is_a_theorem(implies(not(X1),X2))
    | ~ is_a_theorem(X1) ),
    inference(spm,[status(thm)],[c_0_5,c_0_8]) ).

cnf(c_0_13,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(X1,implies(not(X2),X2))) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_14,negated_conjecture,
    ~ is_a_theorem(implies(x,x)),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,plain,
    is_a_theorem(implies(X1,X1)),
    inference(spm,[status(thm)],[c_0_13,c_0_8]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : LCL398-1 : TPTP v9.2.1. Released v2.3.0.
% 0.00/0.12  % 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.15/0.33  % Computer : n027.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   : Mon May  4 22:30:50 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 1.23/1.72  % Version  : CSE_E---1.7
% 1.23/1.72  % Problem  : theBenchmark.p
% 1.23/1.72  % SZS status Unsatisfiable for theBenchmark.p
% 1.23/1.72  % SZS output start CNFRefutation
% See solution above
% 1.23/1.72  % Total time : 1.371s
%------------------------------------------------------------------------------