↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SET025-8 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/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:40 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(ordered_pairs_are_small1,axiom,
    'little$uset'('ordered$upair'(X0,X1)) ).

cnf(an_ordered_pair_predicate,hypothesis,
    'ordered$upair$upredicate'(a) ).

cnf(prove_predicate_is_small,negated_conjecture,
    ~ 'little$uset'(a) ).

cnf(ordered_pair_predicate3,axiom,
    ( X0 = 'ordered$upair'(f2(X0),f3(X0))
    | ~ 'ordered$upair$upredicate'(X0) ) ).

cnf(c9,plain,
    'little$uset'('ordered$upair'(X0,X1)),
    inference(clausification,[status(esa)],[ordered_pairs_are_small1]) ).

cnf(c10,plain,
    'ordered$upair$upredicate'(a),
    inference(clausification,[status(esa)],[an_ordered_pair_predicate]) ).

cnf(c11,plain,
    ~ 'little$uset'(a),
    inference(clausification,[status(esa)],[prove_predicate_is_small]) ).

cnf(c24,plain,
    ( X0 = 'ordered$upair'(f2(X0),f3(X0))
    | ~ 'ordered$upair$upredicate'(X0) ),
    inference(clausification,[status(esa)],[ordered_pair_predicate3]) ).

cnf(d0,plain,
    a = 'ordered$upair'(f2(a),f3(a)),
    inference(resolution,[status(thm)],[c24,c10]) ).

cnf(d1,plain,
    'little$uset'(a),
    inference(superposition,[status(thm)],[d0,c9]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET025-8 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/15.59  % Computer : n001.cluster.edu
% 0.10/15.59  % Model    : x86_64 x86_64
% 0.10/15.59  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/15.59  % Memory   : 8046.5625MB
% 0.10/15.59  % OS       : Linux 6.8.0-71-generic
% 0.10/15.59  % CPULimit : 300
% 0.10/15.59  % WCLimit  : 300
% 0.10/15.59  % DateTime : Sat Sep 26 07:00:12 UTC 2026
% 0.10/15.59  % CPUTime  : 
% 0.10/15.59  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 17.85/18.18  % SZS status Unsatisfiable for theBenchmark.p
% 17.85/18.18  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------