↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SEU161+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 : n006.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:10 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f6,axiom,
    ! [A,B] :
      ( in(A,B)
     => set_union2(singleton(A),B) = B ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l23_zfmisc_1) ).

fof(f6_nnf,plain,
    ! [A,B] :
      ( set_union2(singleton(A),B) = B
      | ~ in(A,B) ),
    inference(nnf_transformation,[status(thm)],[f6]) ).

fof(f6_sk,plain,
    ! [A,B] :
      ( set_union2(singleton(A),B) = B
      | ~ in(A,B) ),
    inference(skolemisation,[status(esa)],[f6_nnf]) ).

cnf(c7,plain,
    ( set_union2(singleton(X0),X1) = X1
    | ~ in(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f6_sk]) ).

cnf(hi3,axiom,
    ifeq(in(X0,X1),true,set_union2(singleton(X0),X1),X1) = X1,
    inference(equality_encoding,[status(esa)],[c7]) ).

fof(f5,conjecture,
    ! [A,B] :
      ( in(A,B)
     => set_union2(singleton(A),B) = B ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t46_zfmisc_1) ).

fof(f5_neg,negated_conjecture,
    ~ ! [A,B] :
        ( in(A,B)
       => set_union2(singleton(A),B) = B ),
    inference(negated_conjecture,[status(cth)],[f5]) ).

fof(f5_nnf,plain,
    ? [A,B] :
      ( set_union2(singleton(A),B) != B
      & in(A,B) ),
    inference(nnf_transformation,[status(thm)],[f5_neg]) ).

fof(f5_sk,plain,
    ( set_union2(singleton(sk0),sk1) != sk1
    & in(sk0,sk1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1])],[f5_nnf]) ).

cnf(c5,plain,
    in(sk0,sk1),
    inference(cnf_transformation,[status(esa)],[f5_sk]) ).

cnf(hi2,negated_conjecture,
    in(sk0,sk1) = true,
    inference(equality_encoding,[status(esa)],[c5]) ).

cnf(h0,plain,
    set_union2(singleton(sk0),sk1) = sk1,
    inference(hyper_resolution,[status(thm)],[hi3,hi2]) ).

cnf(c6,plain,
    set_union2(singleton(sk0),sk1) != sk1,
    inference(cnf_transformation,[status(esa)],[f5_sk]) ).

cnf(hi5,negated_conjecture,
    ifeq(set_union2(singleton(sk0),sk1),sk1,false,true) = true,
    inference(equality_encoding,[status(esa)],[c6]) ).

cnf(t0,plain,
    true = false,
    inference(hyper_resolution,[status(thm)],[hi5,h0]) ).

cnf(t19,plain,
    false = true,
    inference(orient,[status(thm)],[t0]) ).

fof(f2,axiom,
    ! [A,B] :
      ( in(A,B)
     => ~ in(B,A) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).

fof(f2_nnf,plain,
    ! [A,B] :
      ( ~ in(B,A)
      | ~ in(A,B) ),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [A,B] :
      ( ~ in(B,A)
      | ~ in(A,B) ),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c2,plain,
    ( ~ in(X1,X0)
    | ~ in(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(goal_0,negated_conjecture,
    true != false,
    inference(equality_encoding,[status(esa)],[c2,c6]) ).

cnf(g0_0,plain,
    true != true,
    inference(rw,[status(thm)],[goal_0,t19]) ).

cnf(contradiction_0,plain,
    $false,
    inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU161+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.35  % Computer : n006.cluster.edu
% 0.10/0.35  % Model    : x86_64 x86_64
% 0.10/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35  % Memory   : 8046.5625MB
% 0.10/0.35  % OS       : Linux 6.8.0-71-generic
% 0.10/0.35  % CPULimit : 300
% 0.10/0.35  % WCLimit  : 300
% 0.10/0.35  % DateTime : Thu Sep 24 12:59:26 UTC 2026
% 0.12/0.36  % CPUTime  : 
% 0.12/0.36  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.36/0.81  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.36/0.81  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------