↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n013.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:32:05 AM UTC 2026

% Result   : Unsatisfiable 13.20s 4.42s
% Output   : CNFRefutation 13.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    9 (   6 unt;   2 nHn;   7 RR)
%            Number of literals    :   12 (  11 equ;   6 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-2 aty)
%            Number of variables   :    2 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(existence_of_1st_and_2nd_4,axiom,
    ( first(X0) = X0
    | 'ordered$upair'(first(X0),second(X0)) = X0 ) ).

cnf(prove_unique_1st_and_2nd_in_pair_of_non_sets3_1,negated_conjecture,
    'ordered$upair'(first(x),second(x)) != x ).

cnf(prove_unique_1st_in_pair_of_non_sets,negated_conjecture,
    first(x) != x ).

cnf(c64,plain,
    ( first(X0) = X0
    | 'ordered$upair'(first(X0),second(X0)) = X0 ),
    inference(clausification,[status(esa)],[existence_of_1st_and_2nd_4]) ).

cnf(c68,plain,
    'ordered$upair'(first(x),second(x)) != x,
    inference(clausification,[status(esa)],[prove_unique_1st_and_2nd_in_pair_of_non_sets3_1]) ).

cnf(c69,plain,
    first(x) != x,
    inference(clausification,[status(esa)],[prove_unique_1st_in_pair_of_non_sets]) ).

cnf(d0,plain,
    ( first(x) = x
    | x != x ),
    inference(superposition,[status(thm)],[c64,c68]) ).

cnf(d1,plain,
    x != x,
    inference(resolution,[status(thm)],[c69,d0]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET115-7 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.38  % Computer : n013.cluster.edu
% 0.10/0.38  % Model    : x86_64 x86_64
% 0.10/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38  % Memory   : 8046.5625MB
% 0.10/0.38  % OS       : Linux 6.8.0-71-generic
% 0.10/0.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Sat Sep 26 07:09:07 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 13.20/4.42  % SZS status Unsatisfiable for theBenchmark.p
% 13.20/4.42  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------