↑ Up

FindProof---0.1.THM-Prf.s

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

% Result   : Theorem 0.14s 5.87s
% Output   : Proof 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   25 (  20 unt;   0 def)
%            Number of atoms       :   38 (  17 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   22 (   9   ~;   3   |;   8   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-4 aty)
%            Number of variables   :   26 (   9 sgn   5   !;   5   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f0,conjecture,
    ( ( ! [X] : b(X)
      & ? [X] : a(X) )
   => ? [X] :
        ( b(X)
        & a(X) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f0_neg,negated_conjecture,
    ~ ( ( ! [X] : b(X)
        & ? [X] : a(X) )
     => ? [X] :
          ( b(X)
          & a(X) ) ),
    inference(negated_conjecture,[status(cth)],[f0]) ).

fof(f0_nnf,plain,
    ( ! [X] :
        ( ~ b(X)
        | ~ a(X) )
    & ! [X] : b(X)
    & ? [X] : a(X) ),
    inference(nnf_transformation,[status(thm)],[f0_neg]) ).

fof(f0_sk,plain,
    ! [X] :
      ( ( ~ b(X)
        | ~ a(X) )
      & b(X)
      & a(sk0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f0_nnf]) ).

cnf(c2,plain,
    ( ~ b(X0)
    | ~ a(X0) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(t3,plain,
    ifeq(a(X1),true,ifeq(b(X1),true,false,true),true) = true,
    inference(equality_encoding,[status(esa)],[c2]) ).

cnf(t5,plain,
    ifeq(a(X1),true,ifeq(b(X1),true,false,true),true) = true,
    inference(orient,[status(thm)],[t3]) ).

cnf(c1,plain,
    b(X0),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(t1,plain,
    b(X1) = true,
    inference(equality_encoding,[status(esa)],[c1]) ).

cnf(t8,plain,
    b(X1) = true,
    inference(orient,[status(thm)],[t1]) ).

cnf(t14,plain,
    ifeq(a(X1),true,ifeq(true,true,false,true),true) = true,
    inference(step,[status(thm)],[t5,t8]) ).

cnf(t2,plain,
    ifeq(X1,X1,X2,X3) = X2,
    introduced(definition) ).

cnf(t4,plain,
    ifeq(X1,X1,X2,X3) = X2,
    inference(orient,[status(thm)],[t2]) ).

cnf(t15,plain,
    ifeq(a(X1),true,false,true) = true,
    inference(step,[status(thm)],[t14,t4]) ).

cnf(t9,plain,
    ifeq(a(X1),true,false,true) = true,
    inference(rw,[status(thm)],[t15]) ).

cnf(t10,plain,
    ifeq(a(X1),true,false,true) = true,
    inference(orient,[status(thm)],[t9]) ).

cnf(c0,plain,
    a(sk0),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(t0,plain,
    a(sk0) = true,
    inference(equality_encoding,[status(esa)],[c0]) ).

cnf(t6,plain,
    a(sk0) = true,
    inference(orient,[status(thm)],[t0]) ).

cnf(t11,plain,
    true = ifeq(true,true,false,true),
    inference(cp,[status(thm)],[t10,t6]) ).

cnf(t16,plain,
    true = false,
    inference(step,[status(thm)],[t11,t4]) ).

cnf(t12,plain,
    false = true,
    inference(orient,[status(thm)],[t16]) ).

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN958+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.03  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.11/5.37  % Computer : n011.cluster.edu
% 0.11/5.37  % Model    : x86_64 x86_64
% 0.11/5.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.37  % Memory   : 8046.5625MB
% 0.11/5.37  % OS       : Linux 6.8.0-71-generic
% 0.11/5.37  % CPULimit : 300
% 0.11/5.37  % WCLimit  : 300
% 0.11/5.37  % DateTime : Fri Sep 25 02:39:33 UTC 2026
% 0.11/5.37  % CPUTime  : 
% 0.11/5.37  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.14/5.87  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/5.87  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------