↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 0.27s 1.62s
% Output   : CNFRefutation 0.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   21 (  17 unt;   0 nHn;  11 RR)
%            Number of literals    :   29 (   0 equ;  10 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    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   29 (   4 sgn)

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

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

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

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(prove_transitivity,negated_conjecture,
    ~ is_a_theorem(implies(a,c)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_transitivity) ).

cnf(b_implies_c,hypothesis,
    is_a_theorem(implies(b,c)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_implies_c) ).

cnf(a_implies_b,hypothesis,
    is_a_theorem(implies(a,b)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_implies_b) ).

cnf(i_0_7,axiom,
    is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))),
    cn_35,
    [final] ).

cnf(i_0_8,axiom,
    is_a_theorem(implies(implies(X1,X2),implies(not(X2),not(X1)))),
    cn_49_reversed,
    [final] ).

cnf(i_0_9,axiom,
    is_a_theorem(implies(X1,implies(X2,X1))),
    cn_18,
    [final] ).

cnf(i_0_10,axiom,
    ( is_a_theorem(X2)
    | ~ is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(X1) ),
    condensed_detachment,
    [final] ).

cnf(i_0_11,negated_conjecture,
    ~ is_a_theorem(implies(a,c)),
    prove_transitivity,
    [final] ).

cnf(i_0_12,hypothesis,
    is_a_theorem(implies(b,c)),
    b_implies_c,
    [final] ).

cnf(i_0_13,hypothesis,
    is_a_theorem(implies(a,b)),
    a_implies_b,
    [final] ).

cnf(i_0_14,plain,
    is_a_theorem(implies(X1,implies(b,c))),
    inference(scs_inference,[],[i_0_12,i_0_9,i_0_10]) ).

cnf(i_0_15,plain,
    is_a_theorem(implies(X1,implies(X2,X1))),
    inference(rename_variables,[],[i_0_9]) ).

cnf(i_0_16,plain,
    ( ~ is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(X1)
    | is_a_theorem(X2) ),
    inference(rename_variables,[],[i_0_10]) ).

cnf(i_0_17,plain,
    is_a_theorem(implies(implies(X1,b),implies(X1,c))),
    inference(scs_inference,[],[i_0_14,i_0_7,i_0_10]) ).

cnf(i_0_18,plain,
    is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))),
    inference(rename_variables,[],[i_0_7]) ).

cnf(i_0_19,plain,
    ( ~ is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(X1)
    | is_a_theorem(X2) ),
    inference(rename_variables,[],[i_0_10]) ).

cnf(i_0_20,plain,
    $false,
    inference(scs_inference,[],[i_0_11,i_0_17,i_0_13,i_0_10]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : LCL079-1 : TPTP v9.2.1. Released v1.0.0.
% 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.16/0.32  % Computer : n021.cluster.edu
% 0.16/0.32  % Model    : x86_64 x86_64
% 0.16/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.32  % Memory   : 8042.1875MB
% 0.16/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.32  % CPULimit   : 300
% 0.16/0.32  % WCLimit    : 300
% 0.16/0.32  % DateTime   : Mon May  4 21:58:10 EDT 2026
% 0.16/0.34  % CPUTime    : 
% 0.16/0.35  % start to proof: theBenchmark
% 0.27/1.62  % Version  : CSE_E---1.7
% 0.27/1.62  % Problem  : theBenchmark.p
% 0.27/1.62  % SZS status Unsatisfiable for theBenchmark.p
% 0.27/1.62  % SZS output start CNFRefutation
% See solution above
% 0.27/1.64  % Total time : 1.270s
%------------------------------------------------------------------------------