↑ Up

FindProof---0.1.THM-Prf.s

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

% Computer : n016.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:13:05 PM UTC 2026

% Result   : Theorem 61.87s 13.21s
% Output   : Proof 61.87s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   11 (  11 unt;   0 def)
%            Number of atoms       :   11 (  10 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    5 (   5   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-3 aty)
%            Number of variables   :   20 (   2 sgn  14   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f53,axiom,
    ! [U,V] : i(triple(U,create_slb,V)) = create_pq,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax54) ).

fof(f53_nnf,plain,
    ! [U,V] : i(triple(U,create_slb,V)) = create_pq,
    inference(nnf_transformation,[status(thm)],[f53]) ).

fof(f53_sk,plain,
    ! [U,V] : i(triple(U,create_slb,V)) = create_pq,
    inference(skolemisation,[status(esa)],[f53_nnf]) ).

cnf(c68,plain,
    i(triple(X0,create_slb,X1)) = create_pq,
    inference(cnf_transformation,[status(esa)],[f53_sk]) ).

fof(f62,conjecture,
    ! [U,V,X,Y] : i(triple(U,create_slb,X)) = i(triple(V,create_slb,Y)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l1_co) ).

fof(f62_neg,negated_conjecture,
    ~ ! [U,V,X,Y] : i(triple(U,create_slb,X)) = i(triple(V,create_slb,Y)),
    inference(negated_conjecture,[status(cth)],[f62]) ).

fof(f62_nnf,plain,
    ? [U,V,X,Y] : i(triple(U,create_slb,X)) != i(triple(V,create_slb,Y)),
    inference(nnf_transformation,[status(thm)],[f62_neg]) ).

fof(f62_sk,plain,
    i(triple(sk4,create_slb,sk6)) != i(triple(sk5,create_slb,sk7)),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk4,sk5,sk6,sk7])],[f62_nnf]) ).

cnf(c88,plain,
    i(triple(sk4,create_slb,sk6)) != i(triple(sk5,create_slb,sk7)),
    inference(cnf_transformation,[status(esa)],[f62_sk]) ).

cnf(p89,plain,
    create_pq != create_pq,
    inference(superposition,[status(thm)],[c68,c88]) ).

cnf(p90,plain,
    $false,
    inference(equality_resolution,[status(thm)],[p89]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV365+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.58  % Computer : n016.cluster.edu
% 0.10/0.58  % Model    : x86_64 x86_64
% 0.10/0.58  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.58  % Memory   : 8046.5625MB
% 0.10/0.58  % OS       : Linux 6.8.0-71-generic
% 0.10/0.58  % CPULimit : 300
% 0.10/0.58  % WCLimit  : 300
% 0.10/0.58  % DateTime : Thu Sep 24 19:27:46 UTC 2026
% 0.10/0.58  % CPUTime  : 
% 0.10/0.58  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 61.87/13.21  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 61.87/13.21  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------