↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : LCL486+1 : TPTP v9.3.1. Bugfixed v9.2.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 07:54:43 AM UTC 2026

% Result   : Theorem 66.52s 9.92s
% Output   : CNFRefutation 66.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   35 (  21 unt;   0 def)
%            Number of atoms       :   54 (   3 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   34 (  15   ~;  12   |;   1   &)
%                                         (   4 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    8 (   6 usr;   6 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   60 (   0 sgn  13   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(modus_ponens,axiom,
    ( 'modus$uponens'
  <=> ! [X0,X1] :
        ( ( 'is$ua$utheorem'(implies(X0,X1))
          & 'is$ua$utheorem'(X0) )
       => 'is$ua$utheorem'(X1) ) ) ).

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

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

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

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

fof(principia_op_implies_or,axiom,
    'op$uimplies$uor' ).

fof(principia_modus_ponens,axiom,
    'modus$uponens' ).

fof(principia_r4,axiom,
    r4 ).

fof(principia_r5,axiom,
    r5 ).

fof(hilbert_implies_3,conjecture,
    'implies$u3' ).

fof(negated_conjecture,negated_conjecture,
    ~ 'implies$u3',
    inference(negate_conjecture,[status(cth)],[hilbert_implies_3]) ).

cnf(c3,plain,
    ( 'is$ua$utheorem'(X1)
    | ~ 'is$ua$utheorem'(X0)
    | ~ 'is$ua$utheorem'(implies(X0,X1))
    | ~ 'modus$uponens' ),
    inference(clausification,[status(esa)],[modus_ponens]) ).

cnf(c17,plain,
    ( ~ 'is$ua$utheorem'(implies(implies(sK23,sK24),implies(implies(sK24,sK25),implies(sK23,sK25))))
    | 'implies$u3' ),
    inference(clausification,[status(esa)],[implies_3]) ).

cnf(c54,plain,
    ( 'is$ua$utheorem'(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))))
    | ~ r4 ),
    inference(clausification,[status(esa)],[r4]) ).

cnf(c56,plain,
    ( 'is$ua$utheorem'(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1))))
    | ~ r5 ),
    inference(clausification,[status(esa)],[r5]) ).

cnf(c61,plain,
    ( or(not(X0),X1) = implies(X0,X1)
    | ~ 'op$uimplies$uor' ),
    inference(clausification,[status(esa)],[op_implies_or]) ).

cnf(c63,plain,
    'op$uimplies$uor',
    inference(clausification,[status(esa)],[principia_op_implies_or]) ).

cnf(c66,plain,
    'modus$uponens',
    inference(clausification,[status(esa)],[principia_modus_ponens]) ).

cnf(c70,plain,
    r4,
    inference(clausification,[status(esa)],[principia_r4]) ).

cnf(c71,plain,
    r5,
    inference(clausification,[status(esa)],[principia_r5]) ).

cnf(c73,plain,
    ~ 'implies$u3',
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ~ 'is$ua$utheorem'(implies(implies(sK23,sK24),implies(implies(sK24,sK25),implies(sK23,sK25)))),
    inference(resolution,[status(thm)],[c73,c17]) ).

cnf(d1,plain,
    or(not(X0),X1) = implies(X0,X1),
    inference(resolution,[status(thm)],[c63,c61]) ).

cnf(d2,plain,
    'is$ua$utheorem'(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
    inference(resolution,[status(thm)],[c70,c54]) ).

cnf(d3,plain,
    'is$ua$utheorem'(implies(implies(X0,or(X1,X2)),or(X1,or(not(X0),X2)))),
    inference(superposition,[status(thm)],[d1,d2]) ).

cnf(d4,plain,
    'is$ua$utheorem'(implies(implies(X0,or(X2,X1)),or(X2,implies(X0,X1)))),
    inference(demodulation,[status(thm)],[d3,d1]) ).

cnf(d5,plain,
    'is$ua$utheorem'(implies(implies(X2,implies(X0,X1)),or(not(X0),implies(X2,X1)))),
    inference(superposition,[status(thm)],[d1,d4]) ).

cnf(d6,plain,
    'is$ua$utheorem'(implies(implies(X1,implies(X0,X2)),implies(X0,implies(X1,X2)))),
    inference(demodulation,[status(thm)],[d5,d1]) ).

cnf(d7,plain,
    ( ~ 'is$ua$utheorem'(implies(X1,X0))
    | ~ 'is$ua$utheorem'(X1)
    | 'is$ua$utheorem'(X0) ),
    inference(resolution,[status(thm)],[c66,c3]) ).

cnf(d8,plain,
    'is$ua$utheorem'(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
    inference(resolution,[status(thm)],[c71,c56]) ).

cnf(d9,plain,
    ( ~ 'is$ua$utheorem'(implies(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))),X0))
    | 'is$ua$utheorem'(X0) ),
    inference(resolution,[status(thm)],[d8,d7]) ).

cnf(d10,plain,
    ( 'is$ua$utheorem'(X3)
    | ~ 'is$ua$utheorem'(implies(implies(implies(X1,X2),implies(implies(X0,X1),or(not(X0),X2))),X3)) ),
    inference(superposition,[status(thm)],[d1,d9]) ).

cnf(d11,plain,
    ( ~ 'is$ua$utheorem'(implies(implies(implies(X3,X1),implies(implies(X0,X3),implies(X0,X1))),X2))
    | 'is$ua$utheorem'(X2) ),
    inference(demodulation,[status(thm)],[d10,d1]) ).

cnf(d12,plain,
    'is$ua$utheorem'(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
    inference(resolution,[status(thm)],[d11,d6]) ).

cnf(d13,plain,
    $false,
    inference(resolution,[status(thm)],[d12,d0]) ).

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