↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : CAT016-4 : 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 : n016.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:37 AM UTC 2026

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

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

cnf(prove_domain_of_a_exists,negated_conjecture,
    ~ 'there$uexists'(domain(a)) ).

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

cnf(compose_domain,axiom,
    compose(X0,domain(X0)) = X0 ).

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

cnf(c1,plain,
    ~ 'there$uexists'(domain(a)),
    inference(clausification,[status(esa)],[prove_domain_of_a_exists]) ).

cnf(c7,plain,
    ( 'there$uexists'(domain(X0))
    | ~ 'there$uexists'(compose(X0,X1)) ),
    inference(clausification,[status(esa)],[composition_implies_domain]) ).

cnf(c11,plain,
    compose(X0,domain(X0)) = X0,
    inference(clausification,[status(esa)],[compose_domain]) ).

cnf(d0,plain,
    ( 'there$uexists'(domain(X0))
    | ~ 'there$uexists'(X0) ),
    inference(superposition,[status(thm)],[c11,c7]) ).

cnf(d1,plain,
    ~ 'there$uexists'(a),
    inference(resolution,[status(thm)],[d0,c1]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CAT016-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n016.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sat Sep 26 22:54:47 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.81/1.60  % SZS status Unsatisfiable for theBenchmark.p
% 8.81/1.60  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------