↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SYN392+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox2/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 03:34:35 PM UTC 2026

% Result   : Theorem 0.14s 11.04s
% Output   : Proof 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   21 (   4 unt;   0 def)
%            Number of atoms       :   86 (   0 equ)
%            Maximal formula atoms :   16 (   4 avg)
%            Number of connectives :  105 (  40   ~;  43   |;  18   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of predicates  :    3 (   2 usr;   3 prp; 0-0 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (   0 sgn   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f0,conjecture,
    ( ( p1
    <=> p2 )
  <=> ( ( p1
        | ~ p2 )
      & ( ~ p1
        | p2 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel14) ).

fof(f0_neg,negated_conjecture,
    ~ ( ( p1
      <=> p2 )
    <=> ( ( p1
          | ~ p2 )
        & ( ~ p1
          | p2 ) ) ),
    inference(negated_conjecture,[status(cth)],[f0]) ).

fof(f0_nnf,plain,
    ( ( ( p1
        | ~ p2 )
      & ( ~ p1
        | p2 )
      & ( ( p2
          & ~ p1 )
        | ( ~ p2
          & p1 ) ) )
    | ( ( ( ~ p1
          & p2 )
        | ( p1
          & ~ p2 ) )
      & ( ~ p2
        | p1 )
      & ( p2
        | ~ p1 ) ) ),
    inference(nnf_transformation,[status(thm)],[f0_neg]) ).

fof(f0_sk,plain,
    ( ( ( p1
        | ~ p2 )
      & ( ~ p1
        | p2 )
      & ( ( p2
          & ~ p1 )
        | ( ~ p2
          & p1 ) ) )
    | ( ( ( ~ p1
          & p2 )
        | ( p1
          & ~ p2 ) )
      & ( ~ p2
        | p1 )
      & ( p2
        | ~ p1 ) ) ),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

cnf(c25,plain,
    ( p2
    | p1
    | p2
    | p1 ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p45,plain,
    ( p2
    | p2
    | p1 ),
    inference(factoring,[status(thm)],[c25]) ).

cnf(p47,plain,
    ( p2
    | p1 ),
    inference(factoring,[status(thm)],[p45]) ).

cnf(c11,plain,
    ( p1
    | ~ p2
    | ~ p2
    | p1 ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p39,plain,
    ( ~ p2
    | ~ p2
    | p1 ),
    inference(factoring,[status(thm)],[c11]) ).

cnf(p41,plain,
    ( ~ p2
    | p1 ),
    inference(factoring,[status(thm)],[p39]) ).

cnf(p48,plain,
    ( p1
    | p1 ),
    inference(resolution,[status(thm)],[p47,p41]) ).

cnf(p49,plain,
    p1,
    inference(factoring,[status(thm)],[p48]) ).

cnf(c4,plain,
    ( ~ p1
    | p2
    | p2
    | ~ p1 ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p36,plain,
    ( p2
    | p2
    | ~ p1 ),
    inference(factoring,[status(thm)],[c4]) ).

cnf(p38,plain,
    ( p2
    | ~ p1 ),
    inference(factoring,[status(thm)],[p36]) ).

cnf(p50,plain,
    p2,
    inference(resolution,[status(thm)],[p49,p38]) ).

cnf(c20,plain,
    ( ~ p1
    | ~ p2
    | ~ p1
    | ~ p2 ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p42,plain,
    ( ~ p1
    | ~ p1
    | ~ p2 ),
    inference(factoring,[status(thm)],[c20]) ).

cnf(p44,plain,
    ( ~ p1
    | ~ p2 ),
    inference(factoring,[status(thm)],[p42]) ).

cnf(p51,plain,
    ~ p1,
    inference(resolution,[status(thm)],[p50,p44]) ).

cnf(p52,plain,
    $false,
    inference(resolution,[status(thm)],[p51,p49]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN392+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/10.38  % Computer : n018.cluster.edu
% 0.10/10.38  % Model    : x86_64 x86_64
% 0.10/10.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.38  % Memory   : 8046.5625MB
% 0.10/10.38  % OS       : Linux 6.8.0-71-generic
% 0.10/10.38  % CPULimit : 300
% 0.10/10.38  % WCLimit  : 300
% 0.10/10.38  % DateTime : Fri Sep 25 01:06:45 UTC 2026
% 0.10/10.38  % CPUTime  : 
% 0.10/10.38  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.14/11.04  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/11.04  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------