↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : LCL506+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300

% Computer : n010.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:02:11 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f16,axiom,
    ( kn2
  <=> ! [P,Q] : is_a_theorem(implies(and(P,Q),P)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kn2) ).

fof(f16_nnf,plain,
    ( ( ? [P,Q] : ~ is_a_theorem(implies(and(P,Q),P))
      | kn2 )
    & ( ! [P,Q] : is_a_theorem(implies(and(P,Q),P))
      | ~ kn2 ) ),
    inference(nnf_transformation,[status(thm)],[f16]) ).

fof(f16_sk,plain,
    ! [P,Q] :
      ( ( ~ is_a_theorem(implies(and(sk33,sk34),sk33))
        | kn2 )
      & ( is_a_theorem(implies(and(P,Q),P))
        | ~ kn2 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk33,sk34])],[f16_nnf]) ).

cnf(c35,plain,
    ( is_a_theorem(implies(and(X0,X1),X0))
    | ~ kn2 ),
    inference(cnf_transformation,[status(esa)],[f16_sk]) ).

fof(f36,axiom,
    kn2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_kn2) ).

fof(f36_nnf,plain,
    kn2,
    inference(nnf_transformation,[status(thm)],[f36]) ).

cnf(c65,plain,
    kn2,
    inference(cnf_transformation,[status(esa)],[f36_nnf]) ).

cnf(p75,plain,
    is_a_theorem(implies(and(X0,X1),X0)),
    inference(resolution,[status(thm)],[c35,c65]) ).

fof(f6,axiom,
    ( and_1
  <=> ! [X,Y] : is_a_theorem(implies(and(X,Y),X)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_1) ).

fof(f6_nnf,plain,
    ( ( ? [X,Y] : ~ is_a_theorem(implies(and(X,Y),X))
      | and_1 )
    & ( ! [X,Y] : is_a_theorem(implies(and(X,Y),X))
      | ~ and_1 ) ),
    inference(nnf_transformation,[status(thm)],[f6]) ).

fof(f6_sk,plain,
    ! [X,Y] :
      ( ( ~ is_a_theorem(implies(and(sk13,sk14),sk13))
        | and_1 )
      & ( is_a_theorem(implies(and(X,Y),X))
        | ~ and_1 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk13,sk14])],[f6_nnf]) ).

cnf(c16,plain,
    ( ~ is_a_theorem(implies(and(sk13,sk14),sk13))
    | and_1 ),
    inference(cnf_transformation,[status(esa)],[f6_sk]) ).

cnf(p76,plain,
    and_1,
    inference(resolution,[status(thm)],[p75,c16]) ).

fof(f42,conjecture,
    and_1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_and_1) ).

fof(f42_neg,negated_conjecture,
    ~ and_1,
    inference(negated_conjecture,[status(cth)],[f42]) ).

fof(f42_nnf,plain,
    ~ and_1,
    inference(nnf_transformation,[status(thm)],[f42_neg]) ).

fof(f42_sk,plain,
    ~ and_1,
    inference(skolemisation,[status(esa)],[f42_nnf]) ).

cnf(c71,plain,
    ~ and_1,
    inference(cnf_transformation,[status(esa)],[f42_sk]) ).

cnf(p77,plain,
    $false,
    inference(resolution,[status(thm)],[p76,c71]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL506+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/1.21  % Computer : n010.cluster.edu
% 0.09/1.21  % Model    : x86_64 x86_64
% 0.09/1.21  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/1.21  % Memory   : 8046.5625MB
% 0.09/1.21  % OS       : Linux 6.8.0-71-generic
% 0.09/1.21  % CPULimit : 300
% 0.09/1.21  % WCLimit  : 300
% 0.09/1.21  % DateTime : Wed Sep 23 23:36:40 UTC 2026
% 0.09/1.22  % CPUTime  : 
% 0.09/1.22  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.14/1.95  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/1.95  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------