↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : LCL666+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300

% Computer : n017.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:33 PM UTC 2026

% Result   : Theorem 3.33s 0.83s
% Output   : Proof 3.33s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   20 (  15 unt;   0 def)
%            Number of atoms       :   38 (   8 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   42 (  24   ~;  10   |;   8   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-4 aty)
%            Number of variables   :   14 (   0 sgn   7   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ~ ? [X] :
        ~ ( ~ ( p101(X)
              & p201(X) )
          | ~ ! [Y] :
                ( ~ ( p101(Y)
                    & p201(Y) )
                | ~ r1(X,Y) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).

fof(f1_neg,negated_conjecture,
    ~ ~ ? [X] :
          ~ ( ~ ( p101(X)
                & p201(X) )
            | ~ ! [Y] :
                  ( ~ ( p101(Y)
                      & p201(Y) )
                  | ~ r1(X,Y) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f1_nnf,plain,
    ? [X] :
      ( p101(X)
      & p201(X)
      & ! [Y] :
          ( ~ p101(Y)
          | ~ p201(Y)
          | ~ r1(X,Y) ) ),
    inference(nnf_transformation,[status(thm)],[f1_neg]) ).

fof(f1_sk,plain,
    ! [Y] :
      ( p101(sk0)
      & p201(sk0)
      & ( ~ p101(Y)
        | ~ p201(Y)
        | ~ r1(sk0,Y) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f1_nnf]) ).

cnf(c1,plain,
    ( ~ p101(X1)
    | ~ p201(X1)
    | ~ r1(sk0,X1) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(hi3,negated_conjecture,
    ifeq(r1(sk0,X0),true,ifeq(p201(X0),true,ifeq(p101(X0),true,false,true),true),true) = true,
    inference(equality_encoding,[status(esa)],[c1]) ).

fof(f0,axiom,
    ! [X] : r1(X,X),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity) ).

fof(f0_nnf,plain,
    ! [X] : r1(X,X),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ! [X] : r1(X,X),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

cnf(c0,plain,
    r1(X0,X0),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(hi0,axiom,
    r1(X0,X0) = true,
    inference(equality_encoding,[status(esa)],[c0]) ).

cnf(c2,plain,
    p201(sk0),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(hi1,negated_conjecture,
    p201(sk0) = true,
    inference(equality_encoding,[status(esa)],[c2]) ).

cnf(c3,plain,
    p101(sk0),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(hi2,negated_conjecture,
    p101(sk0) = true,
    inference(equality_encoding,[status(esa)],[c3]) ).

cnf(t0,plain,
    true = false,
    inference(hyper_resolution,[status(thm)],[hi3,hi0,hi1,hi2]) ).

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL666+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.07/0.33  % Computer : n017.cluster.edu
% 0.07/0.33  % Model    : x86_64 x86_64
% 0.07/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.33  % Memory   : 8046.5625MB
% 0.07/0.33  % OS       : Linux 6.8.0-71-generic
% 0.07/0.33  % CPULimit : 300
% 0.07/0.33  % WCLimit  : 300
% 0.07/0.33  % DateTime : Thu Sep 24 00:03:45 UTC 2026
% 0.07/0.34  % CPUTime  : 
% 0.07/0.34  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.33/0.83  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.33/0.83  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------