↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : CAT013-3 : 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 06:55:36 AM UTC 2026

% Result   : Unsatisfiable 11.10s 2.14s
% Output   : CNFRefutation 11.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   14 (   9 unt;   0 nHn;  12 RR)
%            Number of literals    :   19 (   8 equ;   7 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    :    4 (   4 usr;   1 con; 0-2 aty)
%            Number of variables   :    9 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(assume_codomain_exists,hypothesis,
    'there$uexists'(codomain(a)) ).

cnf(prove_domain_of_codomain_is_codomain,negated_conjecture,
    domain(codomain(a)) != codomain(a) ).

cnf(codomain_has_elements,axiom,
    ( 'there$uexists'(X0)
    | ~ 'there$uexists'(codomain(X0)) ) ).

cnf(domain_codomain_composition1,axiom,
    ( domain(X0) = codomain(X1)
    | ~ 'there$uexists'(compose(X0,X1)) ) ).

cnf(compose_codomain,axiom,
    compose(codomain(X0),X0) = X0 ).

cnf(c0,plain,
    'there$uexists'(codomain(a)),
    inference(clausification,[status(esa)],[assume_codomain_exists]) ).

cnf(c1,plain,
    domain(codomain(a)) != codomain(a),
    inference(clausification,[status(esa)],[prove_domain_of_codomain_is_codomain]) ).

cnf(c6,plain,
    ( 'there$uexists'(X0)
    | ~ 'there$uexists'(codomain(X0)) ),
    inference(clausification,[status(esa)],[codomain_has_elements]) ).

cnf(c8,plain,
    ( domain(X0) = codomain(X1)
    | ~ 'there$uexists'(compose(X0,X1)) ),
    inference(clausification,[status(esa)],[domain_codomain_composition1]) ).

cnf(c12,plain,
    compose(codomain(X0),X0) = X0,
    inference(clausification,[status(esa)],[compose_codomain]) ).

cnf(d0,plain,
    'there$uexists'(a),
    inference(resolution,[status(thm)],[c6,c0]) ).

cnf(d1,plain,
    ( domain(codomain(X0)) = codomain(X0)
    | ~ 'there$uexists'(X0) ),
    inference(superposition,[status(thm)],[c12,c8]) ).

cnf(d2,plain,
    domain(codomain(a)) = codomain(a),
    inference(resolution,[status(thm)],[d1,d0]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CAT013-3 : 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.08/0.36  % Computer : n001.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Sat Sep 26 22:55:31 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.10/2.14  % SZS status Unsatisfiable for theBenchmark.p
% 11.10/2.14  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------