↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SET883+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox/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:44:13 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f4,axiom,
    ! [A,B] :
      ( subset(singleton(A),singleton(B))
     => A = B ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_zfmisc_1) ).

fof(f4_nnf,plain,
    ! [A,B] :
      ( A = B
      | ~ subset(singleton(A),singleton(B)) ),
    inference(nnf_transformation,[status(thm)],[f4]) ).

fof(f4_sk,plain,
    ! [A,B] :
      ( A = B
      | ~ subset(singleton(A),singleton(B)) ),
    inference(skolemisation,[status(esa)],[f4_nnf]) ).

cnf(c5,plain,
    ( X0 = X1
    | ~ subset(singleton(X0),singleton(X1)) ),
    inference(cnf_transformation,[status(esa)],[f4_sk]) ).

cnf(hi3,axiom,
    ifeq(subset(singleton(X0),singleton(X1)),true,X0,X1) = X1,
    inference(equality_encoding,[status(esa)],[c5]) ).

fof(f3,conjecture,
    ! [A,B] :
      ( subset(singleton(A),singleton(B))
     => A = B ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t24_zfmisc_1) ).

fof(f3_neg,negated_conjecture,
    ~ ! [A,B] :
        ( subset(singleton(A),singleton(B))
       => A = B ),
    inference(negated_conjecture,[status(cth)],[f3]) ).

fof(f3_nnf,plain,
    ? [A,B] :
      ( A != B
      & subset(singleton(A),singleton(B)) ),
    inference(nnf_transformation,[status(thm)],[f3_neg]) ).

fof(f3_sk,plain,
    ( sk2 != sk3
    & subset(singleton(sk2),singleton(sk3)) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk2,sk3])],[f3_nnf]) ).

cnf(c3,plain,
    subset(singleton(sk2),singleton(sk3)),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(hi2,negated_conjecture,
    subset(singleton(sk2),singleton(sk3)) = true,
    inference(equality_encoding,[status(esa)],[c3]) ).

cnf(h0,plain,
    sk2 = sk3,
    inference(hyper_resolution,[status(thm)],[hi3,hi2]) ).

cnf(c4,plain,
    sk2 != sk3,
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(hi5,negated_conjecture,
    ifeq(sk2,sk3,false,true) = true,
    inference(equality_encoding,[status(esa)],[c4]) ).

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

cnf(t13,plain,
    false = true,
    inference(orient,[status(thm)],[t1]) ).

fof(f2,axiom,
    ? [A] : ~ empty(A),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc2_xboole_0) ).

fof(f2_nnf,plain,
    ? [A] : ~ empty(A),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ~ empty(sk1),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk1])],[f2_nnf]) ).

cnf(c2,plain,
    ~ empty(sk1),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET883+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.03  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.08/0.57  % Computer : n008.cluster.edu
% 0.08/0.57  % Model    : x86_64 x86_64
% 0.08/0.57  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.57  % Memory   : 8046.5625MB
% 0.08/0.57  % OS       : Linux 6.8.0-71-generic
% 0.08/0.57  % CPULimit : 300
% 0.08/0.57  % WCLimit  : 300
% 0.08/0.57  % DateTime : Thu Sep 24 12:20:12 UTC 2026
% 0.08/0.57  % CPUTime  : 
% 0.08/0.57  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 5.40/1.38  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.40/1.38  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------