↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n008.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:54:39 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(luka_op_or,axiom,
    'op$uor' ).

fof(or_1,axiom,
    ( 'or$u1'
  <=> ! [X0,X1] : 'is$ua$utheorem'(implies(X0,or(X0,X1))) ) ).

fof(cn2,axiom,
    ( cn2
  <=> ! [X0,X1] : 'is$ua$utheorem'(implies(X0,implies(not(X0),X1))) ) ).

fof(op_or,axiom,
    ( 'op$uor'
   => ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ) ).

fof(op_implies_and,axiom,
    ( 'op$uimplies$uand'
   => ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ) ).

fof(hilbert_op_implies_and,axiom,
    'op$uimplies$uand' ).

fof(hilbert_or_1,axiom,
    'or$u1' ).

fof(luka_cn2,conjecture,
    cn2 ).

fof(negated_conjecture,negated_conjecture,
    ~ cn2,
    inference(negate_conjecture,[status(cth)],[luka_cn2]) ).

cnf(c0,plain,
    'op$uor',
    inference(clausification,[status(esa)],[luka_op_or]) ).

cnf(c24,plain,
    ( 'is$ua$utheorem'(implies(X0,or(X0,X1)))
    | ~ 'or$u1' ),
    inference(clausification,[status(esa)],[or_1]) ).

cnf(c45,plain,
    ( ~ 'is$ua$utheorem'(implies(sK84,implies(not(sK84),sK85)))
    | cn2 ),
    inference(clausification,[status(esa)],[cn2]) ).

cnf(c58,plain,
    ( or(X0,X1) = not(and(not(X0),not(X1)))
    | ~ 'op$uor' ),
    inference(clausification,[status(esa)],[op_or]) ).

cnf(c60,plain,
    ( implies(X0,X1) = not(and(X0,not(X1)))
    | ~ 'op$uimplies$uand' ),
    inference(clausification,[status(esa)],[op_implies_and]) ).

cnf(c64,plain,
    'op$uimplies$uand',
    inference(clausification,[status(esa)],[hilbert_op_implies_and]) ).

cnf(c74,plain,
    'or$u1',
    inference(clausification,[status(esa)],[hilbert_or_1]) ).

cnf(c81,plain,
    ~ cn2,
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    implies(X0,X1) = not(and(X0,not(X1))),
    inference(resolution,[status(thm)],[c64,c60]) ).

cnf(d1,plain,
    or(X0,X1) = not(and(not(X0),not(X1))),
    inference(resolution,[status(thm)],[c0,c58]) ).

cnf(d2,plain,
    or(X0,X1) = implies(not(X0),X1),
    inference(demodulation,[status(thm)],[d1,d0]) ).

cnf(d3,plain,
    ~ 'is$ua$utheorem'(implies(sK84,implies(not(sK84),sK85))),
    inference(resolution,[status(thm)],[c81,c45]) ).

cnf(d4,plain,
    ~ 'is$ua$utheorem'(implies(sK84,or(sK84,sK85))),
    inference(demodulation,[status(thm)],[d3,d2]) ).

cnf(d5,plain,
    'is$ua$utheorem'(implies(X0,or(X0,X1))),
    inference(resolution,[status(thm)],[c74,c24]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL452+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.37  % Computer : n008.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Fri Sep 25 22:35:58 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.15/0.37  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.26/2.42  % SZS status Theorem for theBenchmark.p
% 12.26/2.42  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------