↑ Up

FindProof---0.1.THM-Prf.s

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

% Computer : n020.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:12:00 PM UTC 2026

% Result   : Theorem 5.29s 1.17s
% Output   : Proof 5.29s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   25 (  21 unt;   0 def)
%            Number of atoms       :   29 (  28 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   16 (  12   ~;   3   |;   0   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-4 aty)
%            Number of variables   :   20 (   2 sgn   6   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f0,axiom,
    ! [A,B] :
      ( issue(A) = issue(B)
     => A = B ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',issue_injective) ).

fof(f0_nnf,plain,
    ! [A,B] :
      ( A = B
      | issue(A) != issue(B) ),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ! [A,B] :
      ( A = B
      | issue(A) != issue(B) ),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

cnf(c0,plain,
    ( X0 = X1
    | issue(X0) != issue(X1) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(t4,plain,
    ifeq(issue(X1),issue(X2),X1,X2) = X2,
    inference(equality_encoding,[status(esa)],[c0]) ).

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

fof(f4,conjecture,
    issue(pi1) != issue(pi2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conjecture) ).

fof(f4_neg,negated_conjecture,
    ~ ( issue(pi1) != issue(pi2) ),
    inference(negated_conjecture,[status(cth)],[f4]) ).

fof(f4_nnf,plain,
    issue(pi1) = issue(pi2),
    inference(nnf_transformation,[status(thm)],[f4_neg]) ).

cnf(c4,plain,
    issue(pi1) = issue(pi2),
    inference(cnf_transformation,[status(esa)],[f4_nnf]) ).

cnf(t2,plain,
    issue(pi2) = issue(pi1),
    inference(equality_encoding,[status(esa)],[c4]) ).

cnf(t7,plain,
    issue(pi1) = issue(pi2),
    inference(orient,[status(thm)],[t2]) ).

cnf(t8,plain,
    X1 = ifeq(issue(pi2),issue(X1),pi1,X1),
    inference(cp,[status(thm)],[t6,t7]) ).

cnf(t12,plain,
    ifeq(issue(pi2),issue(X1),pi1,X1) = X1,
    inference(orient,[status(thm)],[t8]) ).

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

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

cnf(t13,plain,
    pi2 = pi1,
    inference(cp,[status(thm)],[t12,t5]) ).

cnf(t14,plain,
    pi1 = pi2,
    inference(orient,[status(thm)],[t13]) ).

fof(f3,axiom,
    pi1 != pi2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pi1_neq_pi2) ).

fof(f3_nnf,plain,
    pi1 != pi2,
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    pi1 != pi2,
    inference(skolemisation,[status(esa)],[f3_nnf]) ).

cnf(c3,plain,
    pi1 != pi2,
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(goal_0,negated_conjecture,
    pi2 != pi1,
    inference(equality_encoding,[status(esa)],[c3]) ).

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

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

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