↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SYN349-1 : TPTP v9.2.1. Released v1.2.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 : n020.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:36:53 PM UTC 2026

% Result   : Unsatisfiable 0.30s 1.63s
% Output   : CNFRefutation 0.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   31 (   4 unt;  16 nHn;  25 RR)
%            Number of literals    :   93 (   0 equ;  45 neg)
%            Maximal clause size   :    4 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   0 con; 1-2 aty)
%            Number of variables   :   54 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(clause10,negated_conjecture,
    ( ~ f(X1,g(X1,X2))
    | ~ f(g(X1,X2),X2)
    | ~ f(X2,g(X1,X2))
    | ~ f(g(X1,X2),w(X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause10) ).

cnf(clause9,negated_conjecture,
    ( f(X1,g(X1,X2))
    | f(g(X1,X2),X2)
    | ~ f(X2,g(X1,X2))
    | ~ f(g(X1,X2),w(X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause9) ).

cnf(clause7,negated_conjecture,
    ( f(g(X1,X2),X2)
    | f(X2,g(X1,X2))
    | ~ f(X1,g(X1,X2))
    | ~ f(g(X1,X2),w(X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause7) ).

cnf(clause8,negated_conjecture,
    ( f(X1,g(X1,X2))
    | f(X2,g(X1,X2))
    | ~ f(g(X1,X2),X2)
    | ~ f(g(X1,X2),w(X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause8) ).

cnf(clause3,negated_conjecture,
    ( f(g(X1,X2),X2)
    | f(g(X1,X2),w(X1))
    | ~ f(X1,g(X1,X2))
    | ~ f(X2,g(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).

cnf(clause4,negated_conjecture,
    ( f(X1,g(X1,X2))
    | f(g(X1,X2),w(X1))
    | ~ f(g(X1,X2),X2)
    | ~ f(X2,g(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause4) ).

cnf(clause6,negated_conjecture,
    ( f(X2,g(X1,X2))
    | f(g(X1,X2),w(X1))
    | ~ f(X1,g(X1,X2))
    | ~ f(g(X1,X2),X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause6) ).

cnf(clause5,negated_conjecture,
    ( f(X1,g(X1,X2))
    | f(g(X1,X2),X2)
    | f(X2,g(X1,X2))
    | f(g(X1,X2),w(X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause5) ).

cnf(clause1,negated_conjecture,
    ( f(X1,g(X1,X2))
    | ~ f(w(X1),g(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause1) ).

cnf(clause2,negated_conjecture,
    ( f(w(X1),g(X1,X2))
    | ~ f(X1,g(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause2) ).

cnf(i_0_10,negated_conjecture,
    ( ~ f(X1,g(X1,X2))
    | ~ f(g(X1,X2),X2)
    | ~ f(X2,g(X1,X2))
    | ~ f(g(X1,X2),w(X1)) ),
    clause10,
    [final] ).

cnf(i_0_11,negated_conjecture,
    ( f(X1,g(X1,X2))
    | f(g(X1,X2),X2)
    | ~ f(X2,g(X1,X2))
    | ~ f(g(X1,X2),w(X1)) ),
    clause9,
    [final] ).

cnf(i_0_12,negated_conjecture,
    ( f(g(X1,X2),X2)
    | f(X2,g(X1,X2))
    | ~ f(X1,g(X1,X2))
    | ~ f(g(X1,X2),w(X1)) ),
    clause7,
    [final] ).

cnf(i_0_13,negated_conjecture,
    ( f(X1,g(X1,X2))
    | f(X2,g(X1,X2))
    | ~ f(g(X1,X2),X2)
    | ~ f(g(X1,X2),w(X1)) ),
    clause8,
    [final] ).

cnf(i_0_14,negated_conjecture,
    ( f(g(X1,X2),X2)
    | f(g(X1,X2),w(X1))
    | ~ f(X1,g(X1,X2))
    | ~ f(X2,g(X1,X2)) ),
    clause3,
    [final] ).

cnf(i_0_15,negated_conjecture,
    ( f(X1,g(X1,X2))
    | f(g(X1,X2),w(X1))
    | ~ f(g(X1,X2),X2)
    | ~ f(X2,g(X1,X2)) ),
    clause4,
    [final] ).

cnf(i_0_16,negated_conjecture,
    ( f(X2,g(X1,X2))
    | f(g(X1,X2),w(X1))
    | ~ f(X1,g(X1,X2))
    | ~ f(g(X1,X2),X2) ),
    clause6,
    [final] ).

cnf(i_0_17,negated_conjecture,
    ( f(X1,g(X1,X2))
    | f(g(X1,X2),X2)
    | f(X2,g(X1,X2))
    | f(g(X1,X2),w(X1)) ),
    clause5,
    [final] ).

cnf(i_0_18,negated_conjecture,
    ( f(X1,g(X1,X2))
    | ~ f(w(X1),g(X1,X2)) ),
    clause1,
    [final] ).

cnf(i_0_19,negated_conjecture,
    ( f(w(X1),g(X1,X2))
    | ~ f(X1,g(X1,X2)) ),
    clause2,
    [final] ).

cnf(i_0_20,plain,
    ( ~ f(w(X1),g(X1,X2))
    | f(w(X1),g(X1,X2)) ),
    inference(scs_inference,[],[i_0_18,i_0_19]) ).

cnf(i_0_21,plain,
    ( f(X1,g(X1,X2))
    | ~ f(X1,g(X1,X2)) ),
    inference(scs_inference,[],[i_0_18,i_0_19]) ).

cnf(i_0_22,plain,
    ( f(X1,g(X1,w(X1)))
    | ~ f(g(X1,w(X1)),w(X1)) ),
    inference(scs_inference,[],[i_0_18,i_0_13]) ).

cnf(i_0_23,plain,
    ( f(X1,g(X1,w(X1)))
    | f(w(X1),g(X1,w(X1)))
    | f(g(X1,w(X1)),w(X1)) ),
    inference(scs_inference,[],[i_0_22,i_0_17]) ).

cnf(i_0_24,plain,
    ( f(g(X1,w(X1)),w(X1))
    | f(X1,g(X1,w(X1))) ),
    inference(scs_inference,[],[i_0_23,i_0_18]) ).

cnf(i_0_25,plain,
    f(X1,g(X1,w(X1))),
    inference(scs_inference,[],[i_0_24,i_0_22]) ).

cnf(i_0_26,plain,
    f(w(X1),g(X1,w(X1))),
    inference(scs_inference,[],[i_0_25,i_0_19]) ).

cnf(i_0_27,plain,
    ( ~ f(X1,g(X1,X2))
    | f(w(X1),g(X1,X2)) ),
    inference(rename_variables,[],[i_0_19]) ).

cnf(i_0_28,plain,
    ~ f(g(X1,w(X1)),w(X1)),
    inference(scs_inference,[],[i_0_25,i_0_19,i_0_10]) ).

cnf(i_0_29,plain,
    ( ~ f(X1,g(X1,X2))
    | ~ f(g(X1,X2),X2)
    | ~ f(X2,g(X1,X2))
    | ~ f(g(X1,X2),w(X1)) ),
    inference(rename_variables,[],[i_0_10]) ).

cnf(i_0_30,plain,
    $false,
    inference(scs_inference,[],[i_0_25,i_0_19,i_0_10,i_0_14]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : SYN349-1 : TPTP v9.2.1. Released v1.2.0.
% 0.12/0.13  % 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.19/0.34  % Computer : n020.cluster.edu
% 0.19/0.34  % Model    : x86_64 x86_64
% 0.19/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.34  % Memory   : 8042.1875MB
% 0.19/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.19/0.34  % CPULimit   : 300
% 0.19/0.34  % WCLimit    : 300
% 0.19/0.34  % DateTime   : Tue May  5 08:29:20 EDT 2026
% 0.19/0.35  % CPUTime    : 
% 0.21/0.36  % start to proof: theBenchmark
% 0.30/1.63  % Version  : CSE_E---1.7
% 0.30/1.63  % Problem  : theBenchmark.p
% 0.30/1.63  % SZS status Unsatisfiable for theBenchmark.p
% 0.30/1.63  % SZS output start CNFRefutation
% See solution above
% 0.30/1.66  % Total time : 1.275s
%------------------------------------------------------------------------------