↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SET114-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 : 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 08:32:05 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(existence_of_1st_and_2nd_3,axiom,
    ( second(X0) = X0
    | member('ordered$upair'(first(X0),second(X0)),'cross$uproduct'('universal$uclass','universal$uclass')) ) ).

cnf(prove_unique_1st_and_2nd_in_pair_of_non_sets2_1,negated_conjecture,
    ~ member('ordered$upair'(first(x),second(x)),'cross$uproduct'('universal$uclass','universal$uclass')) ).

cnf(prove_unique_2nd_in_pair_of_non_sets,negated_conjecture,
    second(x) != x ).

cnf(c63,plain,
    ( second(X0) = X0
    | member('ordered$upair'(first(X0),second(X0)),'cross$uproduct'('universal$uclass','universal$uclass')) ),
    inference(clausification,[status(esa)],[existence_of_1st_and_2nd_3]) ).

cnf(c68,plain,
    ~ member('ordered$upair'(first(x),second(x)),'cross$uproduct'('universal$uclass','universal$uclass')),
    inference(clausification,[status(esa)],[prove_unique_1st_and_2nd_in_pair_of_non_sets2_1]) ).

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

cnf(d0,plain,
    second(x) = x,
    inference(resolution,[status(thm)],[c68,c63]) ).

cnf(d1,plain,
    $false,
    inference(resolution,[status(thm)],[c69,d0]) ).

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