↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SYN055-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 : n012.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:35:56 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(clause_5,axiom,
    ( big_q(X1)
    | big_p(b)
    | ~ big_p(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).

cnf(clause_7,negated_conjecture,
    ( ~ big_q(X1)
    | ~ big_p(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).

cnf(clause_6,negated_conjecture,
    ( big_q(X1)
    | big_r(b)
    | ~ big_p(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).

cnf(clause_1,axiom,
    big_p(a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).

cnf(clause_2,axiom,
    ( ~ big_f(X1)
    | ~ big_g(X1)
    | ~ big_r(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).

cnf(clause_4,axiom,
    ( big_g(X1)
    | ~ big_p(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).

cnf(clause_3,axiom,
    ( big_f(X1)
    | ~ big_p(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).

cnf(c_0_7,axiom,
    ( big_q(X1)
    | big_p(b)
    | ~ big_p(X1) ),
    clause_5 ).

cnf(c_0_8,negated_conjecture,
    ( ~ big_q(X1)
    | ~ big_p(X1) ),
    clause_7 ).

cnf(c_0_9,negated_conjecture,
    ( big_q(X1)
    | big_r(b)
    | ~ big_p(X1) ),
    clause_6 ).

cnf(c_0_10,plain,
    ( big_p(b)
    | ~ big_p(X1) ),
    inference(csr,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,axiom,
    big_p(a),
    clause_1 ).

cnf(c_0_12,negated_conjecture,
    ( big_r(b)
    | ~ big_p(X1) ),
    inference(csr,[status(thm)],[c_0_9,c_0_8]) ).

cnf(c_0_13,plain,
    big_p(b),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,axiom,
    ( ~ big_f(X1)
    | ~ big_g(X1)
    | ~ big_r(X1) ),
    clause_2 ).

cnf(c_0_15,negated_conjecture,
    big_r(b),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,negated_conjecture,
    ( ~ big_g(b)
    | ~ big_f(b) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_17,axiom,
    ( big_g(X1)
    | ~ big_p(X1) ),
    clause_4 ).

cnf(c_0_18,negated_conjecture,
    ~ big_f(b),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_13])]) ).

cnf(c_0_19,axiom,
    ( big_f(X1)
    | ~ big_p(X1) ),
    clause_3 ).

cnf(c_0_20,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_13])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06  % Problem    : SYN055-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.07/0.24  % Computer : n012.cluster.edu
% 0.07/0.24  % Model    : x86_64 x86_64
% 0.07/0.24  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.24  % Memory   : 8042.1875MB
% 0.07/0.24  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.07/0.24  % CPULimit   : 300
% 0.07/0.24  % WCLimit    : 300
% 0.07/0.24  % DateTime   : Tue May  5 08:08:16 EDT 2026
% 0.07/0.24  % CPUTime    : 
% 0.07/0.25  % start to proof: theBenchmark
% 1.08/1.61  % Version  : CSE_E---1.7
% 1.08/1.61  % Problem  : theBenchmark.p
% 1.08/1.61  % SZS status Unsatisfiable for theBenchmark.p
% 1.08/1.61  % SZS output start CNFRefutation
% See solution above
% 1.08/1.61  % Total time : 1.362s
%------------------------------------------------------------------------------