↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n001.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 16.66s 12.60s
% Output   : CNFRefutation 16.66s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   26 (  12 unt;   6 nHn;  24 RR)
%            Number of literals    :   44 (  19 equ;  15 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    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   27 (  10 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_left_cancellation_1,negated_conjecture,
    'unordered$upair'(x,y) = 'unordered$upair'(x,z) ).

cnf(prove_left_cancellation_2,negated_conjecture,
    member('ordered$upair'(y,z),'cross$uproduct'('universal$uclass','universal$uclass')) ).

cnf(prove_left_cancellation_3,negated_conjecture,
    y != z ).

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

cnf(unordered_pair3,axiom,
    ( member(X0,'unordered$upair'(X1,X0))
    | ~ member(X0,'universal$uclass') ) ).

cnf(cartesian_product1,axiom,
    ( member(X0,X2)
    | ~ member('ordered$upair'(X0,X1),'cross$uproduct'(X2,X3)) ) ).

cnf(cartesian_product2,axiom,
    ( member(X1,X3)
    | ~ member('ordered$upair'(X0,X1),'cross$uproduct'(X2,X3)) ) ).

cnf(c0,plain,
    'unordered$upair'(x,y) = 'unordered$upair'(x,z),
    inference(clausification,[status(esa)],[prove_left_cancellation_1]) ).

cnf(c1,plain,
    member('ordered$upair'(y,z),'cross$uproduct'('universal$uclass','universal$uclass')),
    inference(clausification,[status(esa)],[prove_left_cancellation_2]) ).

cnf(c2,plain,
    y != z,
    inference(clausification,[status(esa)],[prove_left_cancellation_3]) ).

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

cnf(c12,plain,
    ( member(X0,'unordered$upair'(X1,X0))
    | ~ member(X0,'universal$uclass') ),
    inference(clausification,[status(esa)],[unordered_pair3]) ).

cnf(c16,plain,
    ( member(X0,X2)
    | ~ member('ordered$upair'(X0,X1),'cross$uproduct'(X2,X3)) ),
    inference(clausification,[status(esa)],[cartesian_product1]) ).

cnf(c17,plain,
    ( member(X1,X3)
    | ~ member('ordered$upair'(X0,X1),'cross$uproduct'(X2,X3)) ),
    inference(clausification,[status(esa)],[cartesian_product2]) ).

cnf(d0,plain,
    ( X0 = x
    | X0 = z
    | ~ member(X0,'unordered$upair'(x,y)) ),
    inference(superposition,[status(thm)],[c0,c10]) ).

cnf(d1,plain,
    ( ~ member(y,'universal$uclass')
    | y = z
    | y = x ),
    inference(resolution,[status(thm)],[d0,c12]) ).

cnf(d2,plain,
    ( ~ member(y,'universal$uclass')
    | y = x ),
    inference(resolution,[status(thm)],[c2,d1]) ).

cnf(d3,plain,
    member(y,'universal$uclass'),
    inference(resolution,[status(thm)],[c16,c1]) ).

cnf(d4,plain,
    y = x,
    inference(resolution,[status(thm)],[d3,d2]) ).

cnf(d5,plain,
    ( ~ member(z,'universal$uclass')
    | member(z,'unordered$upair'(x,y)) ),
    inference(superposition,[status(thm)],[c0,c12]) ).

cnf(d6,plain,
    member(z,'universal$uclass'),
    inference(resolution,[status(thm)],[c17,c1]) ).

cnf(d7,plain,
    member(z,'unordered$upair'(x,y)),
    inference(resolution,[status(thm)],[d6,d5]) ).

cnf(d8,plain,
    ( z = x
    | z = y ),
    inference(resolution,[status(thm)],[d7,c10]) ).

cnf(d9,plain,
    ( z = y
    | z = y ),
    inference(demodulation,[status(thm)],[d8,d4]) ).

cnf(d10,plain,
    y != y,
    inference(demodulation,[status(thm)],[c2,d9]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET017-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/10.38  % Computer : n001.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 06:58:08 UTC 2026
% 0.10/10.39  % CPUTime  : 
% 0.10/10.39  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 16.66/12.60  % SZS status Unsatisfiable for theBenchmark.p
% 16.66/12.60  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------