↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SWV410+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 : n005.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:11 PM UTC 2026

% Result   : Theorem 3.22s 0.89s
% Output   : Proof 3.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   29 (  21 unt;   0 def)
%            Number of atoms       :   46 (   6 equ)
%            Maximal formula atoms :    6 (   1 avg)
%            Number of connectives :   44 (  27   ~;   7   |;   7   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-4 aty)
%            Number of variables   :   29 (   5 sgn  19   !;   3   ?)

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

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

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

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

cnf(hi24,axiom,
    ifeq(contains_slb(create_slb,X0),true,false,true) = true,
    inference(equality_encoding,[status(esa)],[c9]) ).

fof(f18,conjecture,
    ! [U] :
      ( contains_slb(create_slb,U)
     => ? [V] : pair_in_list(create_slb,U,V) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l46_co) ).

fof(f18_neg,negated_conjecture,
    ~ ! [U] :
        ( contains_slb(create_slb,U)
       => ? [V] : pair_in_list(create_slb,U,V) ),
    inference(negated_conjecture,[status(cth)],[f18]) ).

fof(f18_nnf,plain,
    ? [U] :
      ( ! [V] : ~ pair_in_list(create_slb,U,V)
      & contains_slb(create_slb,U) ),
    inference(nnf_transformation,[status(thm)],[f18_neg]) ).

fof(f18_sk,plain,
    ! [V] :
      ( ~ pair_in_list(create_slb,sk0,V)
      & contains_slb(create_slb,sk0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f18_nnf]) ).

cnf(c25,plain,
    contains_slb(create_slb,sk0),
    inference(cnf_transformation,[status(esa)],[f18_sk]) ).

cnf(hi21,negated_conjecture,
    contains_slb(create_slb,sk0) = true,
    inference(equality_encoding,[status(esa)],[c25]) ).

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

cnf(t171,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_slb(create_slb),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax18) ).

fof(f5_nnf,plain,
    ~ isnonempty_slb(create_slb),
    inference(nnf_transformation,[status(thm)],[f5]) ).

fof(f5_sk,plain,
    ~ isnonempty_slb(create_slb),
    inference(skolemisation,[status(esa)],[f5_nnf]) ).

cnf(c7,plain,
    ~ isnonempty_slb(create_slb),
    inference(cnf_transformation,[status(esa)],[f5_sk]) ).

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

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

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

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

cnf(c26,plain,
    ~ pair_in_list(create_slb,sk0,X1),
    inference(cnf_transformation,[status(esa)],[f18_sk]) ).

cnf(goal_0,negated_conjecture,
    true != false,
    inference(equality_encoding,[status(esa)],[c4,c7,c9,c13,c26]) ).

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

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

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