↑ Up

FindProof---0.1.THM-Prf.s

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

% Computer : n018.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:03 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f37,lemma,
    ! [A,B] : set_union2(A,set_difference(B,A)) = set_union2(A,B),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t39_xboole_1) ).

fof(f37_nnf,plain,
    ! [A,B] : set_union2(A,set_difference(B,A)) = set_union2(A,B),
    inference(nnf_transformation,[status(thm)],[f37]) ).

fof(f37_sk,plain,
    ! [A,B] : set_union2(A,set_difference(B,A)) = set_union2(A,B),
    inference(skolemisation,[status(esa)],[f37_nnf]) ).

cnf(c72,plain,
    set_union2(X0,set_difference(X1,X0)) = set_union2(X0,X1),
    inference(cnf_transformation,[status(esa)],[f37_sk]) ).

fof(f42,conjecture,
    ! [A,B] :
      ( subset(A,B)
     => B = set_union2(A,set_difference(B,A)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t45_xboole_1) ).

fof(f42_neg,negated_conjecture,
    ~ ! [A,B] :
        ( subset(A,B)
       => B = set_union2(A,set_difference(B,A)) ),
    inference(negated_conjecture,[status(cth)],[f42]) ).

fof(f42_nnf,plain,
    ? [A,B] :
      ( B != set_union2(A,set_difference(B,A))
      & subset(A,B) ),
    inference(nnf_transformation,[status(thm)],[f42_neg]) ).

fof(f42_sk,plain,
    ( sk10 != set_union2(sk9,set_difference(sk10,sk9))
    & subset(sk9,sk10) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk9,sk10])],[f42_nnf]) ).

cnf(c80,plain,
    sk10 != set_union2(sk9,set_difference(sk10,sk9)),
    inference(cnf_transformation,[status(esa)],[f42_sk]) ).

cnf(p621,plain,
    sk10 != sk10,
    inference(superposition,[status(thm)],[c72,c80]) ).

cnf(p636,plain,
    $false,
    inference(equality_resolution,[status(thm)],[p621]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU137+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.08/0.35  % Computer : n018.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Thu Sep 24 12:55:49 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.36  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 12.55/4.80  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.55/4.80  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------