↑ Up

FindProof---0.1.UNS-Prf.s

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

% Computer : n003.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:54:38 PM UTC 2026

% Result   : Unsatisfiable 0.14s 5.79s
% Output   : Proof 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    9 (   9 unt;   0 def)
%            Number of atoms       :    9 (   0 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   12 (   6 sgn   6   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f112,negated_conjecture,
    ~ element_of_collection(intersection_of_sets(U,V),top_of_basis(f)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_1d_4) ).

fof(f112_nnf,plain,
    ! [U,V] : ~ element_of_collection(intersection_of_sets(U,V),top_of_basis(f)),
    inference(nnf_transformation,[status(thm)],[f112]) ).

fof(f112_sk,plain,
    ! [U,V] : ~ element_of_collection(intersection_of_sets(U,V),top_of_basis(f)),
    inference(skolemisation,[status(esa)],[f112_nnf]) ).

cnf(c112,plain,
    ~ element_of_collection(intersection_of_sets(X0,X1),top_of_basis(f)),
    inference(cnf_transformation,[status(esa)],[f112_sk]) ).

cnf(f110,negated_conjecture,
    element_of_collection(U,top_of_basis(f)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_1d_2) ).

fof(f110_nnf,plain,
    ! [U] : element_of_collection(U,top_of_basis(f)),
    inference(nnf_transformation,[status(thm)],[f110]) ).

fof(f110_sk,plain,
    ! [U] : element_of_collection(U,top_of_basis(f)),
    inference(skolemisation,[status(esa)],[f110_nnf]) ).

cnf(c110,plain,
    element_of_collection(X0,top_of_basis(f)),
    inference(cnf_transformation,[status(esa)],[f110_sk]) ).

cnf(p113,plain,
    $false,
    inference(resolution,[status(thm)],[c112,c110]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : TOP004-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.11/5.36  % Computer : n003.cluster.edu
% 0.11/5.36  % Model    : x86_64 x86_64
% 0.11/5.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.36  % Memory   : 8046.5625MB
% 0.11/5.36  % OS       : Linux 6.8.0-71-generic
% 0.11/5.36  % CPULimit : 300
% 0.11/5.36  % WCLimit  : 300
% 0.11/5.36  % DateTime : Fri Sep 25 04:08:27 UTC 2026
% 0.11/5.36  % CPUTime  : 
% 0.11/5.36  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.14/5.79  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/5.79  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------