%------------------------------------------------------------------------------
% File : hopCoP---0.1
% Problem : COL052-2 : TPTP v9.0.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Jul 24 10:52:15 AM UTC 2025
% Result : Unsatisfiable 17.74s 2.66s
% Output : CNFRefutation 17.74s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named prove_a_is_agreeable)
% Comments :
%------------------------------------------------------------------------------
cnf(4,plain,
~ agreeable(a),
inference(cnf,[status(esa)],[prove_a_is_agreeable]) ).
cnf(l0,plain,
~ agreeable(a),
inference(instantiation,[status(thm)],[4]) ).
cnf(2,plain,
( response(X0,X1) != response(compatible(X0),X1)
| agreeable(X0) ),
inference(cnf,[status(esa)],[agreeable2]) ).
cnf(l1,plain,
( response(a,response(b,common_bird(compose(compatible(a),b)))) != response(compatible(a),response(b,common_bird(compose(compatible(a),b))))
| agreeable(a) ),
inference(instantiation,[status(thm)],[2]) ).
cnf(0,plain,
response(compose(X0,X1),X2) = response(X0,response(X1,X2)),
inference(cnf,[status(esa)],[composer_exists]) ).
cnf(l6,plain,
response(compose(a,b),common_bird(compose(compatible(a),b))) = response(a,response(b,common_bird(compose(compatible(a),b)))),
inference(instantiation,[status(thm)],[0]) ).
cnf(l53,plain,
response(compose(compatible(a),b),common_bird(compose(compatible(a),b))) = response(compatible(a),response(b,common_bird(compose(compatible(a),b)))),
inference(instantiation,[status(thm)],[0]) ).
cnf(5,plain,
c = compose(a,b),
inference(cnf,[status(esa)],[c_composes_a_with_b]) ).
cnf(l25,plain,
c = compose(a,b),
inference(instantiation,[status(thm)],[5]) ).
cnf(1,plain,
( ~ agreeable(X0)
| response(X0,common_bird(X1)) = response(X1,common_bird(X1)) ),
inference(cnf,[status(esa)],[agreeable1]) ).
cnf(l38,plain,
( ~ agreeable(c)
| response(c,common_bird(compose(compatible(a),b))) = response(compose(compatible(a),b),common_bird(compose(compatible(a),b))) ),
inference(instantiation,[status(thm)],[1]) ).
cnf(3,plain,
agreeable(c),
inference(cnf,[status(esa)],[c_is_agreeable]) ).
cnf(l50,plain,
agreeable(c),
inference(instantiation,[status(thm)],[3]) ).
cnf(final,plain,
$false,
inference(ground_refutation,[status(thm)],[l0,l1,l6,l53,l25,l38,l50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : COL052-2 : TPTP v9.0.0. Released v1.0.0.
% 0.11/0.12 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun Jul 20 05:46:49 EDT 2025
% 0.12/0.33 % CPUTime :
% 0.12/0.33 % launching worker at depth: 4
% 0.12/0.33 % launching worker at depth: 1
% 0.12/0.33 % launching worker at depth: 3
% 0.12/0.33 % launching worker at depth: 2
% 0.12/0.33 % launching worker at depth: 5
% 0.12/0.33 % launching worker at depth: 6
% 0.12/0.33 % launching worker at depth: 7
% 0.12/0.33 % launching worker at depth: 8
% 0.12/0.33 % launching worker at depth: 9
% 0.12/0.34 % launching worker at depth: 10
% 0.12/0.34 % launching worker at depth: 11
% 0.12/0.34 % launching worker at depth: 12
% 0.19/0.54 % launching worker at depth: 13
% 17.74/2.66 % SZS status Theorem for theBenchmark
% 17.74/2.66 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------