↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n009.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:35 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(singleton_1,axiom,
    member(X0,'singleton$uset'(X0)) ).

cnf(singleton_2,axiom,
    ( X0 = X1
    | ~ member(X0,'singleton$uset'(X1)) ) ).

cnf(unordered_pair_1,axiom,
    member(X0,'unordered$upair'(X0,X1)) ).

cnf(unordered_pair_3,axiom,
    ( X0 = X2
    | X0 = X1
    | ~ member(X0,'unordered$upair'(X1,X2)) ) ).

cnf(ordered_pair,axiom,
    'ordered$upair'(X0,X1) = 'unordered$upair'('singleton$uset'(X0),'unordered$upair'(X0,X1)) ).

cnf(equal_ordered_pairs,hypothesis,
    'ordered$upair'(m1,r1) = 'ordered$upair'(m2,r2) ).

cnf(prove_first_components_equal,negated_conjecture,
    m1 != m2 ).

cnf(c0,plain,
    member(X0,'singleton$uset'(X0)),
    inference(clausification,[status(esa)],[singleton_1]) ).

cnf(c1,plain,
    ( X0 = X1
    | ~ member(X0,'singleton$uset'(X1)) ),
    inference(clausification,[status(esa)],[singleton_2]) ).

cnf(c2,plain,
    member(X0,'unordered$upair'(X0,X1)),
    inference(clausification,[status(esa)],[unordered_pair_1]) ).

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

cnf(c5,plain,
    'ordered$upair'(X0,X1) = 'unordered$upair'('singleton$uset'(X0),'unordered$upair'(X0,X1)),
    inference(clausification,[status(esa)],[ordered_pair]) ).

cnf(c6,plain,
    'ordered$upair'(m1,r1) = 'ordered$upair'(m2,r2),
    inference(clausification,[status(esa)],[equal_ordered_pairs]) ).

cnf(c7,plain,
    m1 != m2,
    inference(clausification,[status(esa)],[prove_first_components_equal]) ).

cnf(d0,plain,
    member('singleton$uset'(X0),'ordered$upair'(X0,X1)),
    inference(superposition,[status(thm)],[c5,c2]) ).

cnf(d1,plain,
    member('singleton$uset'(m2),'ordered$upair'(m1,r1)),
    inference(superposition,[status(thm)],[c6,d0]) ).

cnf(d2,plain,
    ( X2 = 'singleton$uset'(X0)
    | X2 = 'unordered$upair'(X0,X1)
    | ~ member(X2,'ordered$upair'(X0,X1)) ),
    inference(superposition,[status(thm)],[c5,c4]) ).

cnf(d3,plain,
    ( 'singleton$uset'(m2) = 'unordered$upair'(m1,r1)
    | 'singleton$uset'(m2) = 'singleton$uset'(m1) ),
    inference(resolution,[status(thm)],[d2,d1]) ).

cnf(d4,plain,
    ( 'singleton$uset'(m2) = 'singleton$uset'(m1)
    | member(m1,'singleton$uset'(m2)) ),
    inference(superposition,[status(thm)],[d3,c2]) ).

cnf(d5,plain,
    ( m1 = m2
    | 'singleton$uset'(m2) = 'singleton$uset'(m1) ),
    inference(resolution,[status(thm)],[d4,c1]) ).

cnf(d6,plain,
    'singleton$uset'(m2) = 'singleton$uset'(m1),
    inference(resolution,[status(thm)],[c7,d5]) ).

cnf(d7,plain,
    member(m2,'singleton$uset'(m1)),
    inference(superposition,[status(thm)],[d6,c0]) ).

cnf(d8,plain,
    m2 = m1,
    inference(resolution,[status(thm)],[d7,c1]) ).

cnf(d9,plain,
    m1 != m1,
    inference(demodulation,[status(thm)],[c7,d8]) ).

cnf(d10,plain,
    $false,
    inference(equality_resolution,[status(thm)],[d9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SET016-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44  % Computer : n009.cluster.edu
% 0.18/0.44  % Model    : x86_64 x86_64
% 0.18/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44  % Memory   : 8046.5625MB
% 0.18/0.44  % OS       : Linux 6.8.0-71-generic
% 0.18/0.44  % CPULimit : 300
% 0.18/0.44  % WCLimit  : 300
% 0.18/0.44  % DateTime : Sat Sep 26 06:50:45 UTC 2026
% 0.18/0.44  % CPUTime  : 
% 0.18/0.44  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 16.04/2.52  % SZS status Unsatisfiable for theBenchmark.p
% 16.04/2.52  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------