↑ Up

FindProof---0.1.THM-Prf.s

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

% Computer : n015.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:13:13 PM UTC 2026

% Result   : Theorem 7.78s 1.46s
% Output   : Proof 7.78s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   48 (  36 unt;   0 def)
%            Number of atoms       :   81 (  15 equ)
%            Maximal formula atoms :    6 (   1 avg)
%            Number of connectives :   81 (  48   ~;  20   |;   9   &)
%                                         (   3 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   11 (   9 usr;   1 prp; 0-3 aty)
%            Number of functors    :   12 (  12 usr;   7 con; 0-4 aty)
%            Number of variables   :   65 (  13 sgn  47   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f62,conjecture,
    ! [U] : i(triple(create_pqp,create_slb,U)) = create_pq,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

fof(f62_neg,negated_conjecture,
    ~ ! [U] : i(triple(create_pqp,create_slb,U)) = create_pq,
    inference(negated_conjecture,[status(cth)],[f62]) ).

fof(f62_nnf,plain,
    ? [U] : i(triple(create_pqp,create_slb,U)) != create_pq,
    inference(nnf_transformation,[status(thm)],[f62_neg]) ).

fof(f62_sk,plain,
    i(triple(create_pqp,create_slb,sk4)) != create_pq,
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk4])],[f62_nnf]) ).

cnf(c88,plain,
    i(triple(create_pqp,create_slb,sk4)) != create_pq,
    inference(cnf_transformation,[status(esa)],[f62_sk]) ).

cnf(hi86,negated_conjecture,
    ifeq(i(triple(create_pqp,create_slb,sk4)),create_pq,false,true) = true,
    inference(equality_encoding,[status(esa)],[c88]) ).

fof(f53,axiom,
    ! [U,V] : i(triple(U,create_slb,V)) = create_pq,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax54) ).

fof(f53_nnf,plain,
    ! [U,V] : i(triple(U,create_slb,V)) = create_pq,
    inference(nnf_transformation,[status(thm)],[f53]) ).

fof(f53_sk,plain,
    ! [U,V] : i(triple(U,create_slb,V)) = create_pq,
    inference(skolemisation,[status(esa)],[f53_nnf]) ).

cnf(c68,plain,
    i(triple(X0,create_slb,X1)) = create_pq,
    inference(cnf_transformation,[status(esa)],[f53_sk]) ).

cnf(hi58,axiom,
    i(triple(X0,create_slb,X1)) = create_pq,
    inference(equality_encoding,[status(esa)],[c68]) ).

cnf(t0,plain,
    true = false,
    inference(hyper_resolution,[status(thm)],[hi86,hi58]) ).

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

fof(f3,axiom,
    ! [U,V] :
      ( strictly_less_than(U,V)
    <=> ( ~ less_than(V,U)
        & less_than(U,V) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',stricly_smaller_definition) ).

fof(f3_nnf,plain,
    ! [U,V] :
      ( ( less_than(V,U)
        | ~ less_than(U,V)
        | strictly_less_than(U,V) )
      & ( ( ~ less_than(V,U)
          & less_than(U,V) )
        | ~ strictly_less_than(U,V) ) ),
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    ! [U,V] :
      ( ( less_than(V,U)
        | ~ less_than(U,V)
        | strictly_less_than(U,V) )
      & ( ( ~ less_than(V,U)
          & less_than(U,V) )
        | ~ strictly_less_than(U,V) ) ),
    inference(skolemisation,[status(esa)],[f3_nnf]) ).

cnf(c4,plain,
    ( ~ less_than(X1,X0)
    | ~ strictly_less_than(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

fof(f5,axiom,
    ~ isnonempty_pq(create_pq),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax6) ).

fof(f5_nnf,plain,
    ~ isnonempty_pq(create_pq),
    inference(nnf_transformation,[status(thm)],[f5]) ).

fof(f5_sk,plain,
    ~ isnonempty_pq(create_pq),
    inference(skolemisation,[status(esa)],[f5_nnf]) ).

cnf(c7,plain,
    ~ isnonempty_pq(create_pq),
    inference(cnf_transformation,[status(esa)],[f5_sk]) ).

fof(f7,axiom,
    ! [U] : ~ contains_pq(create_pq,U),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax8) ).

fof(f7_nnf,plain,
    ! [U] : ~ contains_pq(create_pq,U),
    inference(nnf_transformation,[status(thm)],[f7]) ).

fof(f7_sk,plain,
    ! [U] : ~ contains_pq(create_pq,U),
    inference(skolemisation,[status(esa)],[f7_nnf]) ).

cnf(c9,plain,
    ~ contains_pq(create_pq,X0),
    inference(cnf_transformation,[status(esa)],[f7_sk]) ).

fof(f17,axiom,
    ~ isnonempty_slb(create_slb),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax18) ).

fof(f17_nnf,plain,
    ~ isnonempty_slb(create_slb),
    inference(nnf_transformation,[status(thm)],[f17]) ).

fof(f17_sk,plain,
    ~ isnonempty_slb(create_slb),
    inference(skolemisation,[status(esa)],[f17_nnf]) ).

cnf(c23,plain,
    ~ isnonempty_slb(create_slb),
    inference(cnf_transformation,[status(esa)],[f17_sk]) ).

fof(f19,axiom,
    ! [U] : ~ contains_slb(create_slb,U),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax20) ).

fof(f19_nnf,plain,
    ! [U] : ~ contains_slb(create_slb,U),
    inference(nnf_transformation,[status(thm)],[f19]) ).

fof(f19_sk,plain,
    ! [U] : ~ contains_slb(create_slb,U),
    inference(skolemisation,[status(esa)],[f19_nnf]) ).

cnf(c25,plain,
    ~ contains_slb(create_slb,X0),
    inference(cnf_transformation,[status(esa)],[f19_sk]) ).

fof(f21,axiom,
    ! [U,V] : ~ pair_in_list(create_slb,U,V),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax22) ).

fof(f21_nnf,plain,
    ! [U,V] : ~ pair_in_list(create_slb,U,V),
    inference(nnf_transformation,[status(thm)],[f21]) ).

fof(f21_sk,plain,
    ! [U,V] : ~ pair_in_list(create_slb,U,V),
    inference(skolemisation,[status(esa)],[f21_nnf]) ).

cnf(c29,plain,
    ~ pair_in_list(create_slb,X0,X1),
    inference(cnf_transformation,[status(esa)],[f21_sk]) ).

fof(f37,axiom,
    ! [U,V,W,X,Y] :
      ( strictly_less_than(X,Y)
     => ( check_cpq(triple(U,insert_slb(V,pair(X,Y)),W))
      <=> $false ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax38) ).

fof(f37_nnf,plain,
    ! [U,V,W,X,Y] :
      ( ( ( ~ $false
          | check_cpq(triple(U,insert_slb(V,pair(X,Y)),W)) )
        & ( $false
          | ~ check_cpq(triple(U,insert_slb(V,pair(X,Y)),W)) ) )
      | ~ strictly_less_than(X,Y) ),
    inference(nnf_transformation,[status(thm)],[f37]) ).

fof(f37_sk,plain,
    ! [X,Y,U,V,W] :
      ( ( ( ~ $false
          | check_cpq(triple(U,insert_slb(V,pair(X,Y)),W)) )
        & ( $false
          | ~ check_cpq(triple(U,insert_slb(V,pair(X,Y)),W)) ) )
      | ~ strictly_less_than(X,Y) ),
    inference(skolemisation,[status(esa)],[f37_nnf]) ).

cnf(c49,plain,
    ( $false
    | ~ check_cpq(triple(X0,insert_slb(X1,pair(X3,X4)),X2))
    | ~ strictly_less_than(X3,X4) ),
    inference(cnf_transformation,[status(esa)],[f37_sk]) ).

fof(f39,axiom,
    ! [U,V] :
      ( ok(triple(U,V,bad))
    <=> $false ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax40) ).

fof(f39_nnf,plain,
    ! [U,V] :
      ( ( ~ $false
        | ok(triple(U,V,bad)) )
      & ( $false
        | ~ ok(triple(U,V,bad)) ) ),
    inference(nnf_transformation,[status(thm)],[f39]) ).

fof(f39_sk,plain,
    ! [U,V] :
      ( ( ~ $false
        | ok(triple(U,V,bad)) )
      & ( $false
        | ~ ok(triple(U,V,bad)) ) ),
    inference(skolemisation,[status(esa)],[f39_nnf]) ).

cnf(c53,plain,
    ( $false
    | ~ ok(triple(X0,X1,bad)) ),
    inference(cnf_transformation,[status(esa)],[f39_sk]) ).

cnf(goal_0,negated_conjecture,
    true != false,
    inference(equality_encoding,[status(esa)],[c4,c7,c9,c23,c25,c29,c49,c53,c88]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV414+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.11/0.35  % Computer : n015.cluster.edu
% 0.11/0.35  % Model    : x86_64 x86_64
% 0.11/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35  % Memory   : 8046.5625MB
% 0.11/0.35  % OS       : Linux 6.8.0-71-generic
% 0.11/0.35  % CPULimit : 300
% 0.11/0.35  % WCLimit  : 300
% 0.11/0.35  % DateTime : Thu Sep 24 19:34:41 UTC 2026
% 0.11/0.36  % CPUTime  : 
% 0.11/0.36  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 7.78/1.46  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.78/1.46  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------