↑ Up

FindProof---0.1.UNS-Prf.s

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

% Result   : Unsatisfiable 8.68s 1.73s
% Output   : Proof 8.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   54 (  36 unt;   0 def)
%            Number of atoms       :   89 (  40 equ)
%            Maximal formula atoms :    6 (   1 avg)
%            Number of connectives :   84 (  49   ~;  17   |;  15   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-4 aty)
%            Number of functors    :   10 (  10 usr;   8 con; 0-4 aty)
%            Number of variables   :   45 (   0 sgn  29   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f5,axiom,
    ! [X,Y] :
      ( less(X,Y)
     => leq(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_implies_leq) ).

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

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

cnf(c7,plain,
    ( leq(X0,X1)
    | ~ less(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f5_sk]) ).

cnf(hi6,axiom,
    ifeq(less(X0,X1),true,leq(X0,X1),true) = true,
    inference(equality_encoding,[status(esa)],[c7]) ).

fof(f33,axiom,
    ( less(v600,v700)
    & less(v700,v600) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',contradiction) ).

fof(f33_nnf,plain,
    ( less(v600,v700)
    & less(v700,v600) ),
    inference(nnf_transformation,[status(thm)],[f33]) ).

fof(f33_sk,plain,
    ( less(v600,v700)
    & less(v700,v600) ),
    inference(skolemisation,[status(esa)],[f33_nnf]) ).

cnf(c53,plain,
    less(v700,v600),
    inference(cnf_transformation,[status(esa)],[f33_sk]) ).

cnf(hi45,axiom,
    less(v700,v600) = true,
    inference(equality_encoding,[status(esa)],[c53]) ).

cnf(h38,plain,
    leq(v700,v600) = true,
    inference(hyper_resolution,[status(thm)],[hi6,hi45]) ).

fof(f31,axiom,
    less(v600,v700),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v600_v700) ).

fof(f31_nnf,plain,
    less(v600,v700),
    inference(nnf_transformation,[status(thm)],[f31]) ).

cnf(c49,plain,
    less(v600,v700),
    inference(cnf_transformation,[status(esa)],[f31_nnf]) ).

cnf(hi44,axiom,
    less(v600,v700) = true,
    inference(equality_encoding,[status(esa)],[c49]) ).

cnf(h32,plain,
    leq(v600,v700) = true,
    inference(hyper_resolution,[status(thm)],[hi6,hi44]) ).

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

fof(f4_nnf,plain,
    ! [X,Y] :
      ( X = Y
      | ~ leq(Y,X)
      | ~ leq(X,Y) ),
    inference(nnf_transformation,[status(thm)],[f4]) ).

fof(f4_sk,plain,
    ! [X,Y] :
      ( X = Y
      | ~ leq(Y,X)
      | ~ leq(X,Y) ),
    inference(skolemisation,[status(esa)],[f4_nnf]) ).

cnf(c6,plain,
    ( X0 = X1
    | ~ leq(X1,X0)
    | ~ leq(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f4_sk]) ).

cnf(hi5,axiom,
    ifeq(leq(X0,X1),true,ifeq(leq(X1,X0),true,X0,X1),X1) = X1,
    inference(equality_encoding,[status(esa)],[c6]) ).

cnf(h89,plain,
    v600 = v700,
    inference(hyper_resolution,[status(thm)],[hi5,h32,h38]) ).

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

fof(f32_nnf,plain,
    ( v600 != v700
    & v0 != v700
    & v0 != v600 ),
    inference(nnf_transformation,[status(thm)],[f32]) ).

fof(f32_sk,plain,
    ( v600 != v700
    & v0 != v700
    & v0 != v600 ),
    inference(skolemisation,[status(esa)],[f32_nnf]) ).

cnf(c52,plain,
    v600 != v700,
    inference(cnf_transformation,[status(esa)],[f32_sk]) ).

cnf(hi54,axiom,
    ifeq(v600,v700,false,true) = true,
    inference(equality_encoding,[status(esa)],[c52]) ).

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

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

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]) ).

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]) ).

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

cnf(c51,plain,
    v0 != v700,
    inference(cnf_transformation,[status(esa)],[f32_sk]) ).

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

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

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

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