↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : MGT075+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox2/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 02:11:55 PM UTC 2026

% Result   : Theorem 7.89s 1.54s
% Output   : Proof 7.89s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   50 (  34 unt;   0 def)
%            Number of atoms       :   89 (  27 equ)
%            Maximal formula atoms :    6 (   1 avg)
%            Number of connectives :   87 (  48   ~;  21   |;  15   &)
%                                         (   2 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-4 aty)
%            Number of functors    :   10 (  10 usr;   8 con; 0-4 aty)
%            Number of variables   :   59 (   2 sgn  35   !;   5   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f12,axiom,
    ! [X,A,B] :
      ( in_open(X,A,B)
    <=> ( less(X,B)
        & less(A,X) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',in_open) ).

fof(f12_nnf,plain,
    ! [X,A,B] :
      ( ( ~ less(X,B)
        | ~ less(A,X)
        | in_open(X,A,B) )
      & ( ( less(X,B)
          & less(A,X) )
        | ~ in_open(X,A,B) ) ),
    inference(nnf_transformation,[status(thm)],[f12]) ).

fof(f12_sk,plain,
    ! [X,A,B] :
      ( ( ~ less(X,B)
        | ~ less(A,X)
        | in_open(X,A,B) )
      & ( ( less(X,B)
          & less(A,X) )
        | ~ in_open(X,A,B) ) ),
    inference(skolemisation,[status(esa)],[f12_nnf]) ).

cnf(c21,plain,
    ( less(X0,X2)
    | ~ in_open(X0,X1,X2) ),
    inference(cnf_transformation,[status(esa)],[f12_sk]) ).

cnf(hi20,axiom,
    ifeq(in_open(X0,X1,X2),true,less(X0,X2),true) = true,
    inference(equality_encoding,[status(esa)],[c21]) ).

fof(f31,conjecture,
    ~ ? [X] :
        ( leq(v600,X)
        & in_open(X,v0,v600) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl302) ).

fof(f31_neg,negated_conjecture,
    ~ ~ ? [X] :
          ( leq(v600,X)
          & in_open(X,v0,v600) ),
    inference(negated_conjecture,[status(cth)],[f31]) ).

fof(f31_nnf,plain,
    ? [X] :
      ( leq(v600,X)
      & in_open(X,v0,v600) ),
    inference(nnf_transformation,[status(thm)],[f31_neg]) ).

fof(f31_sk,plain,
    ( leq(v600,sk3)
    & in_open(sk3,v0,v600) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk3])],[f31_nnf]) ).

cnf(c49,plain,
    in_open(sk3,v0,v600),
    inference(cnf_transformation,[status(esa)],[f31_sk]) ).

cnf(hi43,negated_conjecture,
    in_open(sk3,v0,v600) = true,
    inference(equality_encoding,[status(esa)],[c49]) ).

cnf(h64,plain,
    less(sk3,v600) = true,
    inference(hyper_resolution,[status(thm)],[hi20,hi43]) ).

fof(f7,axiom,
    ! [X,Y,Z] :
      ( ( leq(Y,Z)
        & less(X,Y) )
     => less(X,Z) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_leq_trans) ).

fof(f7_nnf,plain,
    ! [X,Y,Z] :
      ( less(X,Z)
      | ~ leq(Y,Z)
      | ~ less(X,Y) ),
    inference(nnf_transformation,[status(thm)],[f7]) ).

fof(f7_sk,plain,
    ! [X,Y,Z] :
      ( less(X,Z)
      | ~ leq(Y,Z)
      | ~ less(X,Y) ),
    inference(skolemisation,[status(esa)],[f7_nnf]) ).

cnf(c9,plain,
    ( less(X0,X2)
    | ~ leq(X1,X2)
    | ~ less(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f7_sk]) ).

cnf(hi8,axiom,
    ifeq(less(X0,X1),true,ifeq(leq(X1,X2),true,less(X0,X2),true),true) = true,
    inference(equality_encoding,[status(esa)],[c9]) ).

cnf(c50,plain,
    leq(v600,sk3),
    inference(cnf_transformation,[status(esa)],[f31_sk]) ).

cnf(hi44,negated_conjecture,
    leq(v600,sk3) = true,
    inference(equality_encoding,[status(esa)],[c50]) ).

cnf(h70,plain,
    less(sk3,sk3) = true,
    inference(hyper_resolution,[status(thm)],[hi8,h64,hi44]) ).

fof(f0,axiom,
    ! [X] : ~ less(X,X),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',irreflexive) ).

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

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

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

cnf(hi45,axiom,
    ifeq(less(X0,X0),true,false,true) = true,
    inference(equality_encoding,[status(esa)],[c0]) ).

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

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

fof(f13,axiom,
    ! [I1lo,I1hi,I2lo,I2hi] :
      ( axis_conflict(I1lo,I1hi,I2lo,I2hi)
    <=> ~ ? [X] :
            ( in_closed(X,I2lo,I2hi)
            & in_closed(X,I1lo,I1hi) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axis_conflict_def) ).

fof(f13_nnf,plain,
    ! [I1lo,I1hi,I2lo,I2hi] :
      ( ( ? [X] :
            ( in_closed(X,I2lo,I2hi)
            & in_closed(X,I1lo,I1hi) )
        | axis_conflict(I1lo,I1hi,I2lo,I2hi) )
      & ( ! [X] :
            ( ~ in_closed(X,I2lo,I2hi)
            | ~ in_closed(X,I1lo,I1hi) )
        | ~ axis_conflict(I1lo,I1hi,I2lo,I2hi) ) ),
    inference(nnf_transformation,[status(thm)],[f13]) ).

fof(f13_sk,plain,
    ! [I1lo,I1hi,I2lo,I2hi,X] :
      ( ( ( in_closed(sk0(I1lo,I1hi,I2lo,I2hi),I2lo,I2hi)
          & in_closed(sk0(I1lo,I1hi,I2lo,I2hi),I1lo,I1hi) )
        | axis_conflict(I1lo,I1hi,I2lo,I2hi) )
      & ( ~ in_closed(X,I2lo,I2hi)
        | ~ in_closed(X,I1lo,I1hi)
        | ~ axis_conflict(I1lo,I1hi,I2lo,I2hi) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f13_nnf]) ).

cnf(c23,plain,
    ( ~ in_closed(X4,X2,X3)
    | ~ in_closed(X4,X0,X1)
    | ~ axis_conflict(X0,X1,X2,X3) ),
    inference(cnf_transformation,[status(esa)],[f13_sk]) ).

fof(f19,axiom,
    conflict != compatible,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verdicts_distinct_cf_cp) ).

fof(f19_nnf,plain,
    conflict != compatible,
    inference(nnf_transformation,[status(thm)],[f19]) ).

fof(f19_sk,plain,
    conflict != compatible,
    inference(skolemisation,[status(esa)],[f19_nnf]) ).

cnf(c35,plain,
    conflict != compatible,
    inference(cnf_transformation,[status(esa)],[f19_sk]) ).

fof(f20,axiom,
    conflict != unknown,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verdicts_distinct_cf_un) ).

fof(f20_nnf,plain,
    conflict != unknown,
    inference(nnf_transformation,[status(thm)],[f20]) ).

fof(f20_sk,plain,
    conflict != unknown,
    inference(skolemisation,[status(esa)],[f20_nnf]) ).

cnf(c36,plain,
    conflict != unknown,
    inference(cnf_transformation,[status(esa)],[f20_sk]) ).

fof(f21,axiom,
    compatible != unknown,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verdicts_distinct_cp_un) ).

fof(f21_nnf,plain,
    compatible != unknown,
    inference(nnf_transformation,[status(thm)],[f21]) ).

fof(f21_sk,plain,
    compatible != unknown,
    inference(skolemisation,[status(esa)],[f21_nnf]) ).

cnf(c37,plain,
    compatible != unknown,
    inference(cnf_transformation,[status(esa)],[f21_sk]) ).

fof(f30,axiom,
    v0 != v600,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distinct) ).

fof(f30_nnf,plain,
    v0 != v600,
    inference(nnf_transformation,[status(thm)],[f30]) ).

fof(f30_sk,plain,
    v0 != v600,
    inference(skolemisation,[status(esa)],[f30_nnf]) ).

cnf(c48,plain,
    v0 != v600,
    inference(cnf_transformation,[status(esa)],[f30_sk]) ).

cnf(goal_0,negated_conjecture,
    true != false,
    inference(equality_encoding,[status(esa)],[c0,c23,c35,c36,c37,c48]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT075+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.36  % Computer : n011.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Thu Sep 24 01:20:13 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 7.89/1.54  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.89/1.54  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------