↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n026.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:36 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(ordered_pair_determines_components1,axiom,
    ( X0 = X2
    | ~ member(X0,'universal$uclass')
    | 'ordered$upair'(X0,X1) != 'ordered$upair'(X2,X3) ) ).

cnf(prove_ordered_pair_determines_components1_1,negated_conjecture,
    'ordered$upair'(w,x) = 'ordered$upair'(y,z) ).

cnf(prove_ordered_pair_determines_components1_2,negated_conjecture,
    member(w,'universal$uclass') ).

cnf(prove_ordered_pair_determines_components1_3,negated_conjecture,
    w != y ).

cnf(c59,plain,
    ( X0 = X2
    | ~ member(X0,'universal$uclass')
    | 'ordered$upair'(X0,X1) != 'ordered$upair'(X2,X3) ),
    inference(clausification,[status(esa)],[ordered_pair_determines_components1]) ).

cnf(c74,plain,
    'ordered$upair'(w,x) = 'ordered$upair'(y,z),
    inference(clausification,[status(esa)],[prove_ordered_pair_determines_components1_1]) ).

cnf(c75,plain,
    member(w,'universal$uclass'),
    inference(clausification,[status(esa)],[prove_ordered_pair_determines_components1_2]) ).

cnf(c76,plain,
    w != y,
    inference(clausification,[status(esa)],[prove_ordered_pair_determines_components1_3]) ).

cnf(d0,plain,
    ( ~ member(X0,'universal$uclass')
    | X0 = y
    | 'ordered$upair'(X0,X1) != 'ordered$upair'(w,x) ),
    inference(superposition,[status(thm)],[c74,c59]) ).

cnf(d1,plain,
    ( ~ member(w,'universal$uclass')
    | w = y ),
    inference(equality_resolution,[status(thm)],[d0]) ).

cnf(d2,plain,
    w = y,
    inference(resolution,[status(thm)],[c75,d1]) ).

cnf(d3,plain,
    $false,
    inference(resolution,[status(thm)],[c76,d2]) ).

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