↑ Up

FindProof---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SWW407-1 : TPTP v9.3.1. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300

% Computer : n017.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri Sep 25 03:27:03 PM UTC 2026

% Result   : Unsatisfiable 6.16s 11.57s
% Output   : Proof 6.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   35 (  22 unt;   0 def)
%            Number of atoms       :   53 (  20 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   38 (  20   ~;  18   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-2 aty)
%            Number of variables   :   70 (   0 sgn  28   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f0,axiom,
    sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associative_commutative) ).

fof(f0_nnf,plain,
    ! [S,T,Sigma] : sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ! [S,T,Sigma] : sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

cnf(c0,plain,
    sep(X0,sep(X1,X2)) = sep(X1,sep(X0,X2)),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(f9,axiom,
    ( heap(sep(lseg(X,Z),sep(next(Z,W),Sigma)))
    | ~ heap(sep(lseg(X,Y),sep(lseg(Y,Z),sep(next(Z,W),Sigma)))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unfolding_4) ).

fof(f9_nnf,plain,
    ! [X,Y,Z,W,Sigma] :
      ( heap(sep(lseg(X,Z),sep(next(Z,W),Sigma)))
      | ~ heap(sep(lseg(X,Y),sep(lseg(Y,Z),sep(next(Z,W),Sigma)))) ),
    inference(nnf_transformation,[status(thm)],[f9]) ).

fof(f9_sk,plain,
    ! [X,Y,Z,W,Sigma] :
      ( heap(sep(lseg(X,Z),sep(next(Z,W),Sigma)))
      | ~ heap(sep(lseg(X,Y),sep(lseg(Y,Z),sep(next(Z,W),Sigma)))) ),
    inference(skolemisation,[status(esa)],[f9_nnf]) ).

cnf(c9,plain,
    ( heap(sep(lseg(X0,X2),sep(next(X2,X3),X4)))
    | ~ heap(sep(lseg(X0,X1),sep(lseg(X1,X2),sep(next(X2,X3),X4)))) ),
    inference(cnf_transformation,[status(esa)],[f9_sk]) ).

cnf(p61,plain,
    ( heap(sep(lseg(X2,X1),sep(next(X1,X3),X4)))
    | ~ heap(sep(lseg(X0,X1),sep(lseg(X2,X0),sep(next(X1,X3),X4)))) ),
    inference(superposition,[status(thm)],[c0,c9]) ).

cnf(p111,plain,
    ( heap(sep(lseg(X2,X1),sep(next(X1,X4),sep(X3,X5))))
    | ~ heap(sep(lseg(X0,X1),sep(lseg(X2,X0),sep(X3,sep(next(X1,X4),X5))))) ),
    inference(superposition,[status(thm)],[c0,p61]) ).

cnf(f19,hypothesis,
    heap(sep(next(x1,x2),sep(lseg(x3,x1),sep(lseg(x4,nil),sep(next(x2,x4),emp))))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_9) ).

fof(f19_nnf,plain,
    heap(sep(next(x1,x2),sep(lseg(x3,x1),sep(lseg(x4,nil),sep(next(x2,x4),emp))))),
    inference(nnf_transformation,[status(thm)],[f19]) ).

cnf(c19,plain,
    heap(sep(next(x1,x2),sep(lseg(x3,x1),sep(lseg(x4,nil),sep(next(x2,x4),emp))))),
    inference(cnf_transformation,[status(esa)],[f19_nnf]) ).

cnf(f1,axiom,
    sep(lseg(X,X),Sigma) = Sigma,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',normalization) ).

fof(f1_nnf,plain,
    ! [X,Sigma] : sep(lseg(X,X),Sigma) = Sigma,
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [X,Sigma] : sep(lseg(X,X),Sigma) = Sigma,
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

cnf(c1,plain,
    sep(lseg(X0,X0),X1) = X1,
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(f7,axiom,
    ( heap(sep(lseg(X,Z),Sigma))
    | X = Y
    | ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unfolding_2) ).

fof(f7_nnf,plain,
    ! [X,Y,Z,Sigma] :
      ( heap(sep(lseg(X,Z),Sigma))
      | X = Y
      | ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) ),
    inference(nnf_transformation,[status(thm)],[f7]) ).

fof(f7_sk,plain,
    ! [X,Y,Z,Sigma] :
      ( heap(sep(lseg(X,Z),Sigma))
      | X = Y
      | ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) ),
    inference(skolemisation,[status(esa)],[f7_nnf]) ).

cnf(c7,plain,
    ( heap(sep(lseg(X0,X2),X3))
    | X0 = X1
    | ~ heap(sep(next(X0,X1),sep(lseg(X1,X2),X3))) ),
    inference(cnf_transformation,[status(esa)],[f7_sk]) ).

cnf(p47,plain,
    ( heap(sep(lseg(X0,X1),X2))
    | X0 = X1
    | ~ heap(sep(next(X0,X1),X2)) ),
    inference(superposition,[status(thm)],[c1,c7]) ).

cnf(p76,plain,
    ( heap(sep(lseg(x1,x2),sep(lseg(x3,x1),sep(lseg(x4,nil),sep(next(x2,x4),emp)))))
    | x1 = x2 ),
    inference(resolution,[status(thm)],[c19,p47]) ).

cnf(p227,plain,
    ( x1 = x2
    | heap(sep(lseg(x3,x2),sep(lseg(x4,nil),sep(next(x2,x4),emp)))) ),
    inference(resolution,[status(thm)],[p111,p76]) ).

cnf(f20,negated_conjecture,
    ~ heap(sep(lseg(x4,nil),sep(next(x2,x4),sep(lseg(x3,x2),emp)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conclusion_1) ).

fof(f20_nnf,plain,
    ~ heap(sep(lseg(x4,nil),sep(next(x2,x4),sep(lseg(x3,x2),emp)))),
    inference(nnf_transformation,[status(thm)],[f20]) ).

fof(f20_sk,plain,
    ~ heap(sep(lseg(x4,nil),sep(next(x2,x4),sep(lseg(x3,x2),emp)))),
    inference(skolemisation,[status(esa)],[f20_nnf]) ).

cnf(c20,plain,
    ~ heap(sep(lseg(x4,nil),sep(next(x2,x4),sep(lseg(x3,x2),emp)))),
    inference(cnf_transformation,[status(esa)],[f20_sk]) ).

cnf(p21,plain,
    ~ heap(sep(lseg(x3,x2),sep(lseg(x4,nil),sep(next(x2,x4),emp)))),
    inference(superposition,[status(thm)],[c0,c20]) ).

cnf(p228,plain,
    x1 = x2,
    inference(resolution,[status(thm)],[p227,p21]) ).

cnf(f15,hypothesis,
    x1 != x2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_5) ).

fof(f15_nnf,plain,
    x1 != x2,
    inference(nnf_transformation,[status(thm)],[f15]) ).

fof(f15_sk,plain,
    x1 != x2,
    inference(skolemisation,[status(esa)],[f15_nnf]) ).

cnf(c15,plain,
    x1 != x2,
    inference(cnf_transformation,[status(esa)],[f15_sk]) ).

cnf(p231,plain,
    $false,
    inference(resolution,[status(thm)],[p228,c15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWW407-1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.11/10.39  % Computer : n017.cluster.edu
% 0.11/10.39  % Model    : x86_64 x86_64
% 0.11/10.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.39  % Memory   : 8046.5625MB
% 0.11/10.39  % OS       : Linux 6.8.0-71-generic
% 0.11/10.39  % CPULimit : 300
% 0.11/10.39  % WCLimit  : 300
% 0.11/10.39  % DateTime : Thu Sep 24 22:13:41 UTC 2026
% 0.11/10.39  % CPUTime  : 
% 0.11/10.39  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 6.16/11.57  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.16/11.57  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------