↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : MGT115+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n014.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 : Sun Sep 27 08:01:32 AM UTC 2026

% Result   : Theorem 9.43s 1.73s
% Output   : CNFRefutation 9.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   11 (   8 unt;   0 def)
%            Number of atoms       :   14 (  13 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   11 (   8   ~;   2   |;   0   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :    5 (   0 sgn   2   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(issue_injective,axiom,
    ! [X0,X1] :
      ( issue(X0) = issue(X1)
     => X0 = X1 ) ).

fof(pi1_neq_pi2,axiom,
    pi1 != pi2 ).

fof(conjecture,conjecture,
    issue(pi1) != issue(pi2) ).

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

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

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

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

cnf(d0,plain,
    ( pi2 = X0
    | issue(pi1) != issue(X0) ),
    inference(superposition,[status(thm)],[c4,c0]) ).

cnf(d1,plain,
    pi2 = pi1,
    inference(equality_resolution,[status(thm)],[d0]) ).

cnf(d2,plain,
    pi1 != pi1,
    inference(demodulation,[status(thm)],[c3,d1]) ).

cnf(d3,plain,
    $false,
    inference(equality_resolution,[status(thm)],[d2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : MGT115+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n014.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Sat Sep 26 00:14:04 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.43/1.73  % SZS status Theorem for theBenchmark.p
% 9.43/1.73  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------