↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : CAT007-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 : n012.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:34 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(domain_codomain_composition2,axiom,
    ( 'there$uexists'(compose(X0,X1))
    | ~ equalish(domain(X0),codomain(X1))
    | ~ 'there$uexists'(domain(X0)) ) ).

cnf(domain_of_c2_exists,hypothesis,
    'there$uexists'(domain(c2)) ).

cnf(domain_of_c2_equals_codomain_of_c1,hypothesis,
    equalish(domain(c2),codomain(c1)) ).

cnf(prove_c1_c2_is_defined,negated_conjecture,
    ~ 'there$uexists'(compose(c2,c1)) ).

cnf(c4,plain,
    ( 'there$uexists'(compose(X0,X1))
    | ~ equalish(domain(X0),codomain(X1))
    | ~ 'there$uexists'(domain(X0)) ),
    inference(clausification,[status(esa)],[domain_codomain_composition2]) ).

cnf(c8,plain,
    'there$uexists'(domain(c2)),
    inference(clausification,[status(esa)],[domain_of_c2_exists]) ).

cnf(c10,plain,
    equalish(domain(c2),codomain(c1)),
    inference(clausification,[status(esa)],[domain_of_c2_equals_codomain_of_c1]) ).

cnf(c11,plain,
    ~ 'there$uexists'(compose(c2,c1)),
    inference(clausification,[status(esa)],[prove_c1_c2_is_defined]) ).

cnf(d0,plain,
    ( 'there$uexists'(compose(c2,c1))
    | ~ 'there$uexists'(domain(c2)) ),
    inference(resolution,[status(thm)],[c10,c4]) ).

cnf(d1,plain,
    'there$uexists'(compose(c2,c1)),
    inference(resolution,[status(thm)],[c8,d0]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : CAT007-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.02  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.29  % Computer : n012.cluster.edu
% 0.02/0.29  % Model    : x86_64 x86_64
% 0.02/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.29  % Memory   : 8046.5625MB
% 0.02/0.29  % OS       : Linux 6.8.0-71-generic
% 0.02/0.29  % CPULimit : 300
% 0.02/0.29  % WCLimit  : 300
% 0.02/0.29  % DateTime : Sat Sep 26 22:48:34 UTC 2026
% 0.02/0.29  % CPUTime  : 
% 0.02/0.29  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.98/2.80  % SZS status Unsatisfiable for theBenchmark.p
% 8.98/2.80  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------