↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n015.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 09:22:03 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(kalish203,conjecture,
    ( ~ ! [X0] : f(X0)
  <=> ? [X1] : ~ f(X1) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ( ~ ! [X0] : f(X0)
    <=> ? [X1] : ~ f(X1) ),
    inference(negate_conjecture,[status(cth)],[kalish203]) ).

cnf(c1,plain,
    ( ~ f(sK3)
    | ~ f(sK0) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c2,plain,
    ( f(X1)
    | f(X0) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    f(X0),
    inference(factoring,[status(thm)],[c2]) ).

cnf(d1,plain,
    ~ f(sK3),
    inference(resolution,[status(thm)],[d0,c1]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN396+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n015.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 17:44:15 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.35  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.15/1.48  % SZS status Theorem for theBenchmark.p
% 8.15/1.48  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------