↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n005.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:02:11 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(ax8,axiom,
    ! [X0] : ~ 'contains$upq'('create$upq',X0) ).

fof(ax20,axiom,
    ! [X0] : ~ 'contains$uslb'('create$uslb',X0) ).

fof(ax39,axiom,
    ! [X0,X1,X2,X3] :
      ( 'contains$ucpq'(triple(X0,X1,X2),X3)
    <=> 'contains$uslb'(X1,X3) ) ).

fof(ax54,axiom,
    ! [X0,X1] : i(triple(X0,'create$uslb',X1)) = 'create$upq' ).

fof(ax56,axiom,
    ! [X0,X1] :
      ( 'pi$usharp$uremove'(X0,X1)
    <=> 'contains$upq'(X0,X1) ) ).

fof(l5_co,conjecture,
    ! [X0,X1,X2] :
      ( 'contains$ucpq'(triple(X0,'create$uslb',X1),X2)
    <=> 'contains$upq'(i(triple(X0,'create$uslb',X1)),X2) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( 'contains$ucpq'(triple(X0,'create$uslb',X1),X2)
      <=> 'contains$upq'(i(triple(X0,'create$uslb',X1)),X2) ),
    inference(negate_conjecture,[status(cth)],[l5_co]) ).

cnf(c9,plain,
    ~ 'contains$upq'('create$upq',X0),
    inference(clausification,[status(esa)],[ax8]) ).

cnf(c25,plain,
    ~ 'contains$uslb'('create$uslb',X0),
    inference(clausification,[status(esa)],[ax20]) ).

cnf(c50,plain,
    ( 'contains$uslb'(X1,X3)
    | ~ 'contains$ucpq'(triple(X0,X1,X2),X3) ),
    inference(clausification,[status(esa)],[ax39]) ).

cnf(c66,plain,
    i(triple(X0,'create$uslb',X1)) = 'create$upq',
    inference(clausification,[status(esa)],[ax54]) ).

cnf(c68,plain,
    ( 'contains$upq'(X0,X1)
    | ~ 'pi$usharp$uremove'(X0,X1) ),
    inference(clausification,[status(esa)],[ax56]) ).

cnf(c69,plain,
    ( ~ 'contains$upq'(X0,X1)
    | 'pi$usharp$uremove'(X0,X1) ),
    inference(clausification,[status(esa)],[ax56]) ).

cnf(c87,plain,
    ( 'contains$upq'(i(triple(sK167,'create$uslb',sK168)),sK169)
    | 'contains$ucpq'(triple(sK167,'create$uslb',sK168),sK169) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( 'contains$ucpq'(triple(sK167,'create$uslb',sK168),sK169)
    | 'pi$usharp$uremove'(i(triple(sK167,'create$uslb',sK168)),sK169) ),
    inference(resolution,[status(thm)],[c69,c87]) ).

cnf(d1,plain,
    ( 'pi$usharp$uremove'('create$upq',sK169)
    | 'contains$ucpq'(triple(sK167,'create$uslb',sK168),sK169) ),
    inference(demodulation,[status(thm)],[d0,c66]) ).

cnf(d2,plain,
    ( 'contains$uslb'('create$uslb',sK169)
    | 'pi$usharp$uremove'('create$upq',sK169) ),
    inference(resolution,[status(thm)],[d1,c50]) ).

cnf(d3,plain,
    'pi$usharp$uremove'('create$upq',sK169),
    inference(resolution,[status(thm)],[c25,d2]) ).

cnf(d4,plain,
    'contains$upq'('create$upq',sK169),
    inference(resolution,[status(thm)],[d3,c68]) ).

cnf(d5,plain,
    $false,
    inference(resolution,[status(thm)],[c9,d4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV369+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n005.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Sat Sep 26 13:38:32 UTC 2026
% 0.12/0.36  % CPUTime  : 
% 0.12/0.37  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.57/2.75  % SZS status Theorem for theBenchmark.p
% 11.57/2.75  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------