↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SYN312-1 : TPTP v9.2.1. Bugfixed v2.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 : n024.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:44 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(clause8,negated_conjecture,
    ~ p(f(g(a)),f(g(d)),f(g(c))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause8) ).

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

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

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

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

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

cnf(clause7,negated_conjecture,
    p(f(b),d,c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause7) ).

cnf(clause6,negated_conjecture,
    p(a,f(b),c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause6) ).

cnf(c_0_8,negated_conjecture,
    ~ p(f(g(a)),f(g(d)),f(g(c))),
    clause8 ).

cnf(c_0_9,negated_conjecture,
    ( p(X1,X2,f(X3))
    | ~ p(X1,X2,X3) ),
    clause4 ).

cnf(c_0_10,negated_conjecture,
    ( p(X1,X2,X3)
    | ~ p(X3,X2,X1) ),
    clause2 ).

cnf(c_0_11,negated_conjecture,
    ( p(g(X1),X2,X3)
    | ~ p(X1,X2,X3) ),
    clause5 ).

cnf(c_0_12,negated_conjecture,
    ~ p(f(g(a)),f(g(d)),g(c)),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,negated_conjecture,
    ( p(X1,X2,g(X3))
    | ~ p(X3,X2,X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,negated_conjecture,
    ( p(X1,X2,X3)
    | ~ p(X2,X1,X3) ),
    clause3 ).

cnf(c_0_15,negated_conjecture,
    ( p(X1,X2,X3)
    | ~ p(X1,X4,X3)
    | ~ p(X4,X2,X3) ),
    clause1 ).

cnf(c_0_16,negated_conjecture,
    p(f(b),d,c),
    clause7 ).

cnf(c_0_17,negated_conjecture,
    ~ p(c,f(g(d)),f(g(a))),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_18,negated_conjecture,
    ( p(X1,X2,f(X3))
    | ~ p(X2,X1,X3) ),
    inference(spm,[status(thm)],[c_0_14,c_0_9]) ).

cnf(c_0_19,negated_conjecture,
    ( p(X1,d,c)
    | ~ p(X1,f(b),c) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_20,negated_conjecture,
    p(a,f(b),c),
    clause6 ).

cnf(c_0_21,negated_conjecture,
    ~ p(f(g(d)),c,g(a)),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,negated_conjecture,
    p(a,d,c),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_23,negated_conjecture,
    ~ p(a,c,f(g(d))),
    inference(spm,[status(thm)],[c_0_21,c_0_13]) ).

cnf(c_0_24,negated_conjecture,
    p(c,d,a),
    inference(spm,[status(thm)],[c_0_10,c_0_22]) ).

cnf(c_0_25,negated_conjecture,
    ~ p(a,c,g(d)),
    inference(spm,[status(thm)],[c_0_23,c_0_9]) ).

cnf(c_0_26,negated_conjecture,
    p(d,c,a),
    inference(spm,[status(thm)],[c_0_14,c_0_24]) ).

cnf(c_0_27,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_13]),c_0_26])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07  % Problem    : SYN312-1 : TPTP v9.2.1. Bugfixed v2.0.0.
% 0.00/0.07  % 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.06/0.25  % Computer : n024.cluster.edu
% 0.06/0.25  % Model    : x86_64 x86_64
% 0.06/0.25  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25  % Memory   : 8042.1875MB
% 0.06/0.25  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25  % CPULimit   : 300
% 0.06/0.25  % WCLimit    : 300
% 0.06/0.25  % DateTime   : Tue May  5 03:26:56 EDT 2026
% 0.06/0.25  % CPUTime    : 
% 0.06/0.25  % start to proof: theBenchmark
% 1.12/1.62  % Version  : CSE_E---1.7
% 1.12/1.62  % Problem  : theBenchmark.p
% 1.12/1.62  % SZS status Unsatisfiable for theBenchmark.p
% 1.12/1.62  % SZS output start CNFRefutation
% See solution above
% 1.12/1.62  % Total time : 1.360s
%------------------------------------------------------------------------------