↑ Up

LisaST---0.9.THM-CRf.s

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

% 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 : Sun Sep 27 07:04:00 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(ax2_395,axiom,
    ( mtvisible('c$utptp$umember3356$umt')
   => marriagelicensedocument('c$utptpmarriagelicensedocument') ) ).

fof(query151,conjecture,
    ? [X0] :
      ( mtvisible('c$utptp$umember3356$umt')
     => marriagelicensedocument(X0) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ? [X0] :
        ( mtvisible('c$utptp$umember3356$umt')
       => marriagelicensedocument(X0) ),
    inference(negate_conjecture,[status(cth)],[query151]) ).

cnf(c394,plain,
    ( marriagelicensedocument('c$utptpmarriagelicensedocument')
    | ~ mtvisible('c$utptp$umember3356$umt') ),
    inference(clausification,[status(esa)],[ax2_395]) ).

cnf(c8005,plain,
    mtvisible('c$utptp$umember3356$umt'),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c8006,plain,
    ~ marriagelicensedocument(X0),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    marriagelicensedocument('c$utptpmarriagelicensedocument'),
    inference(resolution,[status(thm)],[c8005,c394]) ).

cnf(d1,plain,
    $false,
    inference(resolution,[status(thm)],[c8006,d0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR051+3 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n001.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 : Sun Sep 27 00:25:28 UTC 2026
% 0.13/0.36  % CPUTime  : 
% 0.13/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 39.32/6.51  % SZS status Theorem for theBenchmark.p
% 39.32/6.51  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------