↑ Up

CSE_E---1.7.UNS-CRf.s

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

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

% Comments : 
%------------------------------------------------------------------------------
cnf(clause_6,negated_conjecture,
    ~ q4(f(f(X1)),f(g(f(X2)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).

cnf(clause_4,negated_conjecture,
    ( q3(f(X1),X2)
    | q4(X1,f(X2))
    | ~ p2(X1,f(X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).

cnf(clause_1,negated_conjecture,
    ( q1(f(X1),X2)
    | q2(X1,f(X2))
    | ~ p1(X1,f(X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).

cnf(clause_7,negated_conjecture,
    ( p2(f(X1),X2)
    | ~ q1(X1,f(X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).

cnf(clause_5,negated_conjecture,
    ~ q3(X1,g(X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).

cnf(clause_3,negated_conjecture,
    ~ q2(X1,f(X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).

cnf(clause_2,negated_conjecture,
    p1(a,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).

cnf(i_0_7,negated_conjecture,
    ~ q4(f(f(X1)),f(g(f(X2)))),
    clause_6,
    [final] ).

cnf(i_0_8,negated_conjecture,
    ( q3(f(X1),X2)
    | q4(X1,f(X2))
    | ~ p2(X1,f(X2)) ),
    clause_4,
    [final] ).

cnf(i_0_9,negated_conjecture,
    ( q1(f(X1),X2)
    | q2(X1,f(X2))
    | ~ p1(X1,f(X2)) ),
    clause_1,
    [final] ).

cnf(i_0_10,negated_conjecture,
    ( p2(f(X1),X2)
    | ~ q1(X1,f(X2)) ),
    clause_7,
    [final] ).

cnf(i_0_11,negated_conjecture,
    ~ q3(X1,g(X2)),
    clause_5,
    [final] ).

cnf(i_0_12,negated_conjecture,
    ~ q2(X1,f(X2)),
    clause_3,
    [final] ).

cnf(i_0_13,negated_conjecture,
    p1(a,X1),
    clause_2,
    [final] ).

cnf(i_0_14,plain,
    ~ p2(f(f(X1)),f(g(f(X2)))),
    inference(scs_inference,[],[i_0_7,i_0_11,i_0_8]) ).

cnf(i_0_15,plain,
    ~ q3(X1,g(X2)),
    inference(rename_variables,[],[i_0_11]) ).

cnf(i_0_16,plain,
    ( q4(X1,f(X2))
    | ~ p2(X1,f(X2))
    | q3(f(X1),X2) ),
    inference(rename_variables,[],[i_0_8]) ).

cnf(i_0_17,plain,
    q1(f(a),X1),
    inference(scs_inference,[],[i_0_7,i_0_13,i_0_11,i_0_12,i_0_8,i_0_9]) ).

cnf(i_0_18,plain,
    ~ q2(X1,f(X2)),
    inference(rename_variables,[],[i_0_12]) ).

cnf(i_0_19,plain,
    p1(a,X1),
    inference(rename_variables,[],[i_0_13]) ).

cnf(i_0_20,plain,
    ( q2(X1,f(X2))
    | ~ p1(X1,f(X2))
    | q1(f(X1),X2) ),
    inference(rename_variables,[],[i_0_9]) ).

cnf(i_0_21,plain,
    $false,
    inference(scs_inference,[],[i_0_7,i_0_13,i_0_11,i_0_12,i_0_8,i_0_9,i_0_10]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN006-1 : TPTP v9.2.1. Released v1.0.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.14/0.33  % Computer : n015.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33  % CPULimit   : 300
% 0.14/0.33  % WCLimit    : 300
% 0.14/0.33  % DateTime   : Tue May  5 08:04:02 EDT 2026
% 0.14/0.33  % CPUTime    : 
% 0.14/0.34  % start to proof: theBenchmark
% 0.22/1.62  % Version  : CSE_E---1.7
% 0.22/1.62  % Problem  : theBenchmark.p
% 0.22/1.62  % SZS status Unsatisfiable for theBenchmark.p
% 0.22/1.62  % SZS output start CNFRefutation
% See solution above
% 0.22/1.64  % Total time : 1.272s
%------------------------------------------------------------------------------