↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n002.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 08:31:53 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(unordered_pair_defn,axiom,
    ! [X0,X1,X2] :
      ( member(X0,'unordered$upair'(X1,X2))
    <=> ( ( X0 = X2
          | X0 = X1 )
        & member(X0,'universal$uclass') ) ) ).

fof(regularity,axiom,
    ! [X0] :
      ( X0 != 'null$uclass'
     => ? [X1] :
          ( disjoint(X1,X0)
          & member(X1,X0)
          & member(X1,'universal$uclass') ) ) ).

fof(null_unordered_pair,conjecture,
    ! [X0,X1] :
      ( ( ~ member(X1,'universal$uclass')
        & ~ member(X0,'universal$uclass') )
     => 'unordered$upair'(X0,X1) = 'null$uclass' ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0,X1] :
        ( ( ~ member(X1,'universal$uclass')
          & ~ member(X0,'universal$uclass') )
       => 'unordered$upair'(X0,X1) = 'null$uclass' ),
    inference(negate_conjecture,[status(cth)],[null_unordered_pair]) ).

cnf(c8,plain,
    ( X2 = X0
    | X1 = X0
    | ~ member(X0,'unordered$upair'(X1,X2)) ),
    inference(clausification,[status(esa)],[unordered_pair_defn]) ).

cnf(c83,plain,
    ( member(sK85(X0),'universal$uclass')
    | X0 = 'null$uclass' ),
    inference(clausification,[status(esa)],[regularity]) ).

cnf(c85,plain,
    ( member(sK85(X0),X0)
    | X0 = 'null$uclass' ),
    inference(clausification,[status(esa)],[regularity]) ).

cnf(c89,plain,
    ~ member(sK91,'universal$uclass'),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c90,plain,
    ~ member(sK90,'universal$uclass'),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c91,plain,
    'unordered$upair'(sK90,sK91) != 'null$uclass',
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( X0 = sK85('unordered$upair'(X0,X1))
    | X1 = sK85('unordered$upair'(X0,X1))
    | 'unordered$upair'(X0,X1) = 'null$uclass' ),
    inference(resolution,[status(thm)],[c85,c8]) ).

cnf(d1,plain,
    ( 'unordered$upair'(X0,X1) = 'null$uclass'
    | X0 = sK85('unordered$upair'(X0,X1))
    | 'unordered$upair'(X0,X1) = 'null$uclass'
    | member(X1,'universal$uclass') ),
    inference(superposition,[status(thm)],[d0,c83]) ).

cnf(d2,plain,
    ( 'unordered$upair'(X0,sK91) = 'null$uclass'
    | X0 = sK85('unordered$upair'(X0,sK91)) ),
    inference(resolution,[status(thm)],[d1,c89]) ).

cnf(d3,plain,
    ( 'unordered$upair'(X0,sK91) = 'null$uclass'
    | 'unordered$upair'(X0,sK91) = 'null$uclass'
    | member(X0,'universal$uclass') ),
    inference(superposition,[status(thm)],[d2,c83]) ).

cnf(d4,plain,
    'unordered$upair'(sK90,sK91) = 'null$uclass',
    inference(resolution,[status(thm)],[d3,c90]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET071+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/10.38  % Computer : n002.cluster.edu
% 0.10/10.38  % Model    : x86_64 x86_64
% 0.10/10.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.38  % Memory   : 8046.5625MB
% 0.10/10.38  % OS       : Linux 6.8.0-71-generic
% 0.10/10.38  % CPULimit : 300
% 0.10/10.38  % WCLimit  : 300
% 0.10/10.38  % DateTime : Sat Sep 26 07:05:17 UTC 2026
% 0.10/10.38  % CPUTime  : 
% 0.10/10.38  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 40.90/16.89  % SZS status Theorem for theBenchmark.p
% 40.90/16.89  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------