%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : CAT014-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 : n018.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.62s 2.07s
% Output : CNFRefutation 11.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 21 ( 15 unt; 0 nHn; 17 RR)
% Number of literals : 27 ( 15 equ; 9 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 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 : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(assume_codomain_exists,hypothesis,
'there$uexists'(codomain(a)) ).
cnf(prove_codomain_is_idempotent,negated_conjecture,
codomain(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_domain,axiom,
compose(X0,domain(X0)) = X0 ).
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,
codomain(codomain(a)) != codomain(a),
inference(clausification,[status(esa)],[prove_codomain_is_idempotent]) ).
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(c11,plain,
compose(X0,domain(X0)) = X0,
inference(clausification,[status(esa)],[compose_domain]) ).
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,
( domain(X0) = codomain(domain(X0))
| ~ 'there$uexists'(X0) ),
inference(superposition,[status(thm)],[c11,c8]) ).
cnf(d4,plain,
domain(codomain(a)) = codomain(domain(codomain(a))),
inference(resolution,[status(thm)],[d3,c0]) ).
cnf(d5,plain,
codomain(a) = codomain(domain(codomain(a))),
inference(demodulation,[status(thm)],[d4,d2]) ).
cnf(d6,plain,
codomain(a) = codomain(codomain(a)),
inference(demodulation,[status(thm)],[d5,d2]) ).
cnf(d7,plain,
codomain(a) != codomain(a),
inference(demodulation,[status(thm)],[c1,d6]) ).
cnf(d8,plain,
$false,
inference(equality_resolution,[status(thm)],[d7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CAT014-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.10/0.35 % Computer : n018.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Sat Sep 26 22:51:54 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.62/2.07 % SZS status Unsatisfiable for theBenchmark.p
% 11.62/2.07 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------