%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : COL052-2 : 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:56:46 AM UTC 2026
% Result : Unsatisfiable 8.99s 1.63s
% Output : CNFRefutation 8.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 19 ( 13 unt; 0 nHn; 12 RR)
% Number of literals : 25 ( 14 equ; 9 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(composer_exists,axiom,
response(compose(X0,X1),X2) = response(X0,response(X1,X2)) ).
cnf(agreeable1,axiom,
( response(X0,'common$ubird'(X1)) = response(X1,'common$ubird'(X1))
| ~ agreeable(X0) ) ).
cnf(agreeable2,axiom,
( agreeable(X0)
| response(X0,X1) != response(compatible(X0),X1) ) ).
cnf(c_is_agreeable,hypothesis,
agreeable(c) ).
cnf(prove_a_is_agreeable,negated_conjecture,
~ agreeable(a) ).
cnf(c_composes_a_with_b,hypothesis,
c = compose(a,b) ).
cnf(c0,plain,
response(compose(X0,X1),X2) = response(X0,response(X1,X2)),
inference(clausification,[status(esa)],[composer_exists]) ).
cnf(c1,plain,
( response(X0,'common$ubird'(X1)) = response(X1,'common$ubird'(X1))
| ~ agreeable(X0) ),
inference(clausification,[status(esa)],[agreeable1]) ).
cnf(c2,plain,
( agreeable(X0)
| response(X0,X1) != response(compatible(X0),X1) ),
inference(clausification,[status(esa)],[agreeable2]) ).
cnf(c3,plain,
agreeable(c),
inference(clausification,[status(esa)],[c_is_agreeable]) ).
cnf(c4,plain,
~ agreeable(a),
inference(clausification,[status(esa)],[prove_a_is_agreeable]) ).
cnf(c5,plain,
c = compose(a,b),
inference(clausification,[status(esa)],[c_composes_a_with_b]) ).
cnf(d0,plain,
response(c,'common$ubird'(X0)) = response(X0,'common$ubird'(X0)),
inference(resolution,[status(thm)],[c1,c3]) ).
cnf(d1,plain,
response(c,'common$ubird'(compose(X0,X1))) = response(X0,response(X1,'common$ubird'(compose(X0,X1)))),
inference(superposition,[status(thm)],[d0,c0]) ).
cnf(d2,plain,
( agreeable(X0)
| response(X0,response(X1,'common$ubird'(compose(compatible(X0),X1)))) != response(c,'common$ubird'(compose(compatible(X0),X1))) ),
inference(superposition,[status(thm)],[d1,c2]) ).
cnf(d3,plain,
response(c,X0) = response(a,response(b,X0)),
inference(superposition,[status(thm)],[c5,c0]) ).
cnf(d4,plain,
( agreeable(a)
| response(c,'common$ubird'(compose(compatible(a),b))) != response(c,'common$ubird'(compose(compatible(a),b))) ),
inference(superposition,[status(thm)],[d3,d2]) ).
cnf(d5,plain,
response(c,'common$ubird'(compose(compatible(a),b))) != response(c,'common$ubird'(compose(compatible(a),b))),
inference(resolution,[status(thm)],[c4,d4]) ).
cnf(d6,plain,
$false,
inference(equality_resolution,[status(thm)],[d5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COL052-2 : 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.09/0.35 % Computer : n018.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 : Sat Sep 26 23:11:23 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.99/1.63 % SZS status Unsatisfiable for theBenchmark.p
% 8.99/1.63 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------