↑ Up

FindProof---0.1.THM-Prf.s

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

% Computer : n008.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 02:51:38 PM UTC 2026

% Result   : Theorem 30.30s 4.81s
% Output   : Proof 30.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   17 (   9 unt;   0 def)
%            Number of atoms       :   25 (   4 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   15 (   7   ~;   3   |;   2   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   24 (   3 sgn  16   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f15,axiom,
    ! [A,B] : set_intersection2(A,B) = set_intersection2(B,A),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).

fof(f15_nnf,plain,
    ! [A,B] : set_intersection2(A,B) = set_intersection2(B,A),
    inference(nnf_transformation,[status(thm)],[f15]) ).

fof(f15_sk,plain,
    ! [A,B] : set_intersection2(A,B) = set_intersection2(B,A),
    inference(skolemisation,[status(esa)],[f15_nnf]) ).

cnf(c25,plain,
    set_intersection2(X0,X1) = set_intersection2(X1,X0),
    inference(cnf_transformation,[status(esa)],[f15_sk]) ).

fof(f127,axiom,
    ! [A,B] :
      ( finite(B)
     => finite(set_intersection2(A,B)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc10_finset_1) ).

fof(f127_nnf,plain,
    ! [A,B] :
      ( finite(set_intersection2(A,B))
      | ~ finite(B) ),
    inference(nnf_transformation,[status(thm)],[f127]) ).

fof(f127_sk,plain,
    ! [B,A] :
      ( finite(set_intersection2(A,B))
      | ~ finite(B) ),
    inference(skolemisation,[status(esa)],[f127_nnf]) ).

cnf(c441,plain,
    ( finite(set_intersection2(X0,X1))
    | ~ finite(X1) ),
    inference(cnf_transformation,[status(esa)],[f127_sk]) ).

fof(f260,conjecture,
    ! [A,B] :
      ( finite(A)
     => finite(set_intersection2(A,B)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_finset_1) ).

fof(f260_neg,negated_conjecture,
    ~ ! [A,B] :
        ( finite(A)
       => finite(set_intersection2(A,B)) ),
    inference(negated_conjecture,[status(cth)],[f260]) ).

fof(f260_nnf,plain,
    ? [A,B] :
      ( ~ finite(set_intersection2(A,B))
      & finite(A) ),
    inference(nnf_transformation,[status(thm)],[f260_neg]) ).

fof(f260_sk,plain,
    ( ~ finite(set_intersection2(sk232,sk233))
    & finite(sk232) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk232,sk233])],[f260_nnf]) ).

cnf(c1353,plain,
    finite(sk232),
    inference(cnf_transformation,[status(esa)],[f260_sk]) ).

cnf(p1878,plain,
    finite(set_intersection2(X0,sk232)),
    inference(resolution,[status(thm)],[c441,c1353]) ).

cnf(p1880,plain,
    finite(set_intersection2(sk232,X0)),
    inference(superposition,[status(thm)],[c25,p1878]) ).

cnf(c1354,plain,
    ~ finite(set_intersection2(sk232,sk233)),
    inference(cnf_transformation,[status(esa)],[f260_sk]) ).

cnf(p1882,plain,
    $false,
    inference(resolution,[status(thm)],[p1880,c1354]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU295+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.36  % Computer : n008.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Thu Sep 24 13:35:39 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 30.30/4.81  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 30.30/4.81  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------