↑ Up

FindProof---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : CAT013-4 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300

% Computer : n011.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 : Fri Sep 25 01:00:40 PM UTC 2026

% Result   : Unsatisfiable 6.48s 1.49s
% Output   : Proof 6.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   37 (  29 unt;   0 def)
%            Number of atoms       :   45 (  29 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   22 (  14   ~;   8   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-4 aty)
%            Number of variables   :   31 (   2 sgn   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f6,axiom,
    ( domain(X) = codomain(Y)
    | ~ there_exists(compose(X,Y)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain_codomain_composition1) ).

fof(f6_nnf,plain,
    ! [X,Y] :
      ( domain(X) = codomain(Y)
      | ~ there_exists(compose(X,Y)) ),
    inference(nnf_transformation,[status(thm)],[f6]) ).

fof(f6_sk,plain,
    ! [X,Y] :
      ( domain(X) = codomain(Y)
      | ~ there_exists(compose(X,Y)) ),
    inference(skolemisation,[status(esa)],[f6_nnf]) ).

cnf(c6,plain,
    ( domain(X0) = codomain(X1)
    | ~ there_exists(compose(X0,X1)) ),
    inference(cnf_transformation,[status(esa)],[f6_sk]) ).

cnf(t19,plain,
    ifeq(there_exists(compose(X1,X2)),true,domain(X1),codomain(X2)) = codomain(X2),
    inference(equality_encoding,[status(esa)],[c6]) ).

cnf(t48,plain,
    ifeq(there_exists(compose(X1,X2)),true,domain(X1),codomain(X2)) = codomain(X2),
    inference(orient,[status(thm)],[t19]) ).

cnf(f10,axiom,
    compose(codomain(X),X) = X,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',compose_codomain) ).

fof(f10_nnf,plain,
    ! [X] : compose(codomain(X),X) = X,
    inference(nnf_transformation,[status(thm)],[f10]) ).

fof(f10_sk,plain,
    ! [X] : compose(codomain(X),X) = X,
    inference(skolemisation,[status(esa)],[f10_nnf]) ).

cnf(c10,plain,
    compose(codomain(X0),X0) = X0,
    inference(cnf_transformation,[status(esa)],[f10_sk]) ).

cnf(t4,plain,
    compose(codomain(X1),X1) = X1,
    inference(equality_encoding,[status(esa)],[c10]) ).

cnf(t23,plain,
    compose(codomain(X1),X1) = X1,
    inference(orient,[status(thm)],[t4]) ).

cnf(t50,plain,
    codomain(X1) = ifeq(there_exists(X1),true,domain(codomain(X1)),codomain(X1)),
    inference(cp,[status(thm)],[t48,t23]) ).

cnf(t2233,plain,
    ifeq(there_exists(X1),true,domain(codomain(X1)),codomain(X1)) = codomain(X1),
    inference(orient,[status(thm)],[t50]) ).

cnf(f4,axiom,
    ( there_exists(X)
    | ~ there_exists(codomain(X)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',codomain_has_elements) ).

fof(f4_nnf,plain,
    ! [X] :
      ( there_exists(X)
      | ~ there_exists(codomain(X)) ),
    inference(nnf_transformation,[status(thm)],[f4]) ).

fof(f4_sk,plain,
    ! [X] :
      ( there_exists(X)
      | ~ there_exists(codomain(X)) ),
    inference(skolemisation,[status(esa)],[f4_nnf]) ).

cnf(c4,plain,
    ( there_exists(X0)
    | ~ there_exists(codomain(X0)) ),
    inference(cnf_transformation,[status(esa)],[f4_sk]) ).

cnf(hi4,axiom,
    ifeq(there_exists(codomain(X0)),true,there_exists(X0),true) = true,
    inference(equality_encoding,[status(esa)],[c4]) ).

cnf(f11,hypothesis,
    there_exists(codomain(a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',assume_codomain_exists) ).

fof(f11_nnf,plain,
    there_exists(codomain(a)),
    inference(nnf_transformation,[status(thm)],[f11]) ).

cnf(c11,plain,
    there_exists(codomain(a)),
    inference(cnf_transformation,[status(esa)],[f11_nnf]) ).

cnf(hi11,axiom,
    there_exists(codomain(a)) = true,
    inference(equality_encoding,[status(esa)],[c11]) ).

cnf(t0,plain,
    there_exists(a) = true,
    inference(hyper_resolution,[status(thm)],[hi4,hi11]) ).

cnf(t26,plain,
    there_exists(a) = true,
    inference(orient,[status(thm)],[t0]) ).

cnf(t2254,plain,
    codomain(a) = ifeq(true,true,domain(codomain(a)),codomain(a)),
    inference(cp,[status(thm)],[t2233,t26]) ).

cnf(t6,plain,
    ifeq(X1,X1,X2,X3) = X2,
    introduced(definition) ).

cnf(t24,plain,
    ifeq(X1,X1,X2,X3) = X2,
    inference(orient,[status(thm)],[t6]) ).

cnf(t2472,plain,
    codomain(a) = domain(codomain(a)),
    inference(step,[status(thm)],[t2254,t24]) ).

cnf(t2268,plain,
    domain(codomain(a)) = codomain(a),
    inference(orient,[status(thm)],[t2472]) ).

cnf(f12,negated_conjecture,
    domain(codomain(a)) != codomain(a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_domain_of_codomain_is_codomain) ).

fof(f12_nnf,plain,
    domain(codomain(a)) != codomain(a),
    inference(nnf_transformation,[status(thm)],[f12]) ).

fof(f12_sk,plain,
    domain(codomain(a)) != codomain(a),
    inference(skolemisation,[status(esa)],[f12_nnf]) ).

cnf(c12,plain,
    domain(codomain(a)) != codomain(a),
    inference(cnf_transformation,[status(esa)],[f12_sk]) ).

cnf(goal_0,negated_conjecture,
    domain(codomain(a)) != codomain(a),
    inference(equality_encoding,[status(esa)],[c12]) ).

cnf(g0_0,plain,
    codomain(a) != codomain(a),
    inference(rw,[status(thm)],[goal_0,t2268]) ).

cnf(contradiction_0,plain,
    $false,
    inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : CAT013-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.35  % Computer : n011.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Fri Sep 25 06:56:13 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 6.48/1.49  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.48/1.49  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------