↑ Up

FindProof---0.1.UNS-Prf.s

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

% Computer : n010.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:04 PM UTC 2026

% Result   : Unsatisfiable 2.20s 0.78s
% Output   : Proof 2.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   24 (  18 unt;   0 def)
%            Number of atoms       :   35 (  16 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   25 (  14   ~;  11   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   32 (   0 sgn  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f0,axiom,
    sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)),
    file('/export/starexec/sandbox/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(f7,axiom,
    ( heap(sep(lseg(X,Z),Sigma))
    | X = Y
    | ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) ),
    file('/export/starexec/sandbox/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(p33,plain,
    ( heap(sep(lseg(X2,X1),X3))
    | X2 = X0
    | ~ heap(sep(lseg(X0,X1),sep(next(X2,X0),X3))) ),
    inference(superposition,[status(thm)],[c0,c7]) ).

cnf(f13,hypothesis,
    heap(sep(lseg(x2,nil),sep(next(x1,x2),emp))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_3) ).

fof(f13_nnf,plain,
    heap(sep(lseg(x2,nil),sep(next(x1,x2),emp))),
    inference(nnf_transformation,[status(thm)],[f13]) ).

cnf(c13,plain,
    heap(sep(lseg(x2,nil),sep(next(x1,x2),emp))),
    inference(cnf_transformation,[status(esa)],[f13_nnf]) ).

cnf(p83,plain,
    ( heap(sep(lseg(x1,nil),emp))
    | x1 = x2 ),
    inference(resolution,[status(thm)],[p33,c13]) ).

cnf(f14,negated_conjecture,
    ~ heap(sep(lseg(x1,nil),emp)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conclusion_1) ).

fof(f14_nnf,plain,
    ~ heap(sep(lseg(x1,nil),emp)),
    inference(nnf_transformation,[status(thm)],[f14]) ).

fof(f14_sk,plain,
    ~ heap(sep(lseg(x1,nil),emp)),
    inference(skolemisation,[status(esa)],[f14_nnf]) ).

cnf(c14,plain,
    ~ heap(sep(lseg(x1,nil),emp)),
    inference(cnf_transformation,[status(esa)],[f14_sk]) ).

cnf(p84,plain,
    x1 = x2,
    inference(resolution,[status(thm)],[p83,c14]) ).

cnf(f12,hypothesis,
    x2 != x1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_2) ).

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

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

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

cnf(p85,plain,
    x1 != x1,
    inference(superposition,[status(thm)],[p84,c12]) ).

cnf(p88,plain,
    $false,
    inference(equality_resolution,[status(thm)],[p85]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWW417-1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.03  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.07/0.35  % Computer : n010.cluster.edu
% 0.07/0.35  % Model    : x86_64 x86_64
% 0.07/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35  % Memory   : 8046.5625MB
% 0.07/0.35  % OS       : Linux 6.8.0-71-generic
% 0.07/0.35  % CPULimit : 300
% 0.07/0.35  % WCLimit  : 300
% 0.07/0.35  % DateTime : Thu Sep 24 22:19:28 UTC 2026
% 0.07/0.36  % CPUTime  : 
% 0.12/0.36  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.20/0.78  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.20/0.78  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------