↑ Up

FindProof---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SET001-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 : n011.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:41:24 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(f0,axiom,
    ( member(Element,Superset)
    | ~ subset(Subset,Superset)
    | ~ member(Element,Subset) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',membership_in_subsets) ).

fof(f0_nnf,plain,
    ! [Element,Subset,Superset] :
      ( member(Element,Superset)
      | ~ subset(Subset,Superset)
      | ~ member(Element,Subset) ),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ! [Element,Subset,Superset] :
      ( member(Element,Superset)
      | ~ subset(Subset,Superset)
      | ~ member(Element,Subset) ),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

cnf(c0,plain,
    ( member(X0,X2)
    | ~ subset(X1,X2)
    | ~ member(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(f7,hypothesis,
    member(element_of_b,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_of_b) ).

fof(f7_nnf,plain,
    member(element_of_b,b),
    inference(nnf_transformation,[status(thm)],[f7]) ).

cnf(c7,plain,
    member(element_of_b,b),
    inference(cnf_transformation,[status(esa)],[f7_nnf]) ).

cnf(p10,plain,
    ( member(element_of_b,X0)
    | ~ subset(b,X0) ),
    inference(resolution,[status(thm)],[c0,c7]) ).

cnf(f3,axiom,
    ( subset(Subset,Superset)
    | ~ equal_sets(Subset,Superset) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',set_equal_sets_are_subsets1) ).

fof(f3_nnf,plain,
    ! [Subset,Superset] :
      ( subset(Subset,Superset)
      | ~ equal_sets(Subset,Superset) ),
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    ! [Subset,Superset] :
      ( subset(Subset,Superset)
      | ~ equal_sets(Subset,Superset) ),
    inference(skolemisation,[status(esa)],[f3_nnf]) ).

cnf(c3,plain,
    ( subset(X0,X1)
    | ~ equal_sets(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(f6,hypothesis,
    equal_sets(b,bb),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_equals_bb) ).

fof(f6_nnf,plain,
    equal_sets(b,bb),
    inference(nnf_transformation,[status(thm)],[f6]) ).

cnf(c6,plain,
    equal_sets(b,bb),
    inference(cnf_transformation,[status(esa)],[f6_nnf]) ).

cnf(p9,plain,
    subset(b,bb),
    inference(resolution,[status(thm)],[c3,c6]) ).

cnf(p12,plain,
    member(element_of_b,bb),
    inference(resolution,[status(thm)],[p10,p9]) ).

cnf(f8,negated_conjecture,
    ~ member(element_of_b,bb),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_element_of_bb) ).

fof(f8_nnf,plain,
    ~ member(element_of_b,bb),
    inference(nnf_transformation,[status(thm)],[f8]) ).

fof(f8_sk,plain,
    ~ member(element_of_b,bb),
    inference(skolemisation,[status(esa)],[f8_nnf]) ).

cnf(c8,plain,
    ~ member(element_of_b,bb),
    inference(cnf_transformation,[status(esa)],[f8_sk]) ).

cnf(p14,plain,
    $false,
    inference(resolution,[status(thm)],[p12,c8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET001-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.36  % Computer : n011.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 09:03:57 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 5.19/1.16  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.19/1.16  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------