↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SWW431-1 : TPTP v9.2.1. Released v5.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 : n017.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:32:21 PM UTC 2026

% Result   : Unsatisfiable 1.26s 1.72s
% Output   : CNFRefutation 1.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   16 (  13 unt;   3 nHn;  11 RR)
%            Number of literals    :   22 (  14 equ;   5 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :   14 (   3 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;  13 con; 0-2 aty)
%            Number of variables   :   27 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(associative_commutative,axiom,
    sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV013-0.ax',associative_commutative) ).

cnf(wellformedness_5,axiom,
    ( X1 = X2
    | X1 = X3
    | ~ heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV013-0.ax',wellformedness_5) ).

cnf(premise_13,hypothesis,
    heap(sep(lseg(x5,x3),sep(lseg(x10,x8),sep(lseg(x13,x8),sep(lseg(x1,x11),sep(lseg(x4,x9),sep(lseg(x2,x9),sep(lseg(x12,x7),sep(lseg(x9,x2),sep(lseg(x7,x10),sep(lseg(x11,x12),sep(lseg(x11,x7),sep(lseg(x11,x1),emp))))))))))))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_13) ).

cnf(premise_7,hypothesis,
    x7 != x11,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_7) ).

cnf(normalization,axiom,
    sep(lseg(X1,X1),X2) = X2,
    file('/export/starexec/sandbox/benchmark/Axioms/SWV013-0.ax',normalization) ).

cnf(c_0_5,axiom,
    sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
    associative_commutative ).

cnf(c_0_6,axiom,
    ( X1 = X2
    | X1 = X3
    | ~ heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))) ),
    wellformedness_5 ).

cnf(c_0_7,plain,
    sep(X1,sep(X2,sep(X3,X4))) = sep(X3,sep(X1,sep(X2,X4))),
    inference(spm,[status(thm)],[c_0_5,c_0_5]) ).

cnf(c_0_8,hypothesis,
    heap(sep(lseg(x5,x3),sep(lseg(x10,x8),sep(lseg(x13,x8),sep(lseg(x1,x11),sep(lseg(x4,x9),sep(lseg(x2,x9),sep(lseg(x12,x7),sep(lseg(x9,x2),sep(lseg(x7,x10),sep(lseg(x11,x12),sep(lseg(x11,x7),sep(lseg(x11,x1),emp))))))))))))),
    premise_13 ).

cnf(c_0_9,plain,
    ( X1 = X2
    | X1 = X3
    | ~ heap(sep(X4,sep(lseg(X1,X3),sep(lseg(X1,X2),X5)))) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,hypothesis,
    heap(sep(lseg(x7,x10),sep(lseg(x11,x7),sep(lseg(x11,x12),sep(lseg(x11,x1),sep(lseg(x2,x9),sep(lseg(x9,x2),sep(lseg(x5,x3),sep(lseg(x10,x8),sep(lseg(x12,x7),sep(lseg(x13,x8),sep(lseg(x1,x11),sep(lseg(x4,x9),emp))))))))))))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]) ).

cnf(c_0_11,hypothesis,
    x7 != x11,
    premise_7 ).

cnf(c_0_12,hypothesis,
    x12 = x11,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).

cnf(c_0_13,axiom,
    sep(lseg(X1,X1),X2) = X2,
    normalization ).

cnf(c_0_14,hypothesis,
    heap(sep(lseg(x7,x10),sep(lseg(x11,x7),sep(lseg(x11,x7),sep(lseg(x11,x1),sep(lseg(x2,x9),sep(lseg(x9,x2),sep(lseg(x5,x3),sep(lseg(x10,x8),sep(lseg(x13,x8),sep(lseg(x1,x11),sep(lseg(x4,x9),emp)))))))))))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_12]),c_0_12]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_5]),c_0_13]) ).

cnf(c_0_15,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_14]),c_0_11]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : SWW431-1 : TPTP v9.2.1. Released v5.2.0.
% 0.00/0.12  % 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.16/0.32  % Computer : n017.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   : Tue May  5 06:47:12 EDT 2026
% 0.16/0.32  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 1.26/1.72  % Version  : CSE_E---1.7
% 1.26/1.72  % Problem  : theBenchmark.p
% 1.26/1.72  % SZS status Unsatisfiable for theBenchmark.p
% 1.26/1.72  % SZS output start CNFRefutation
% See solution above
% 1.26/1.72  % Total time : 1.372s
%------------------------------------------------------------------------------