%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : COL050-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n007.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:57:31 AM UTC 2026
% Result : Unsatisfiable 0.09s 0.39s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 9 ( 9 unt; 0 def)
% Number of atoms : 9 ( 8 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 13 ( 0 sgn 5 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mocking_bird_exists,axiom,
! [VAR_0] : response(mocking_bird,VAR_0) = response(VAR_0,VAR_0),
file('theBenchmark.p',mocking_bird_exists) ).
cnf(c_1,plain,
response(mocking_bird,A) = response(A,A),
inference(clausify,[status(thm)],[mocking_bird_exists]) ).
fof(composer_exists,axiom,
! [VAR_0,VAR_1,VAR_2] : response(compose(VAR_0,VAR_1),VAR_2) = response(VAR_0,response(VAR_1,VAR_2)),
file('theBenchmark.p',composer_exists) ).
cnf(c_2,plain,
response(compose(A,B),C) = response(A,response(B,C)),
inference(clausify,[status(thm)],[composer_exists]) ).
fof(prove_all_fond_of_another,axiom,
! [VAR_0] : response(a,VAR_0) != VAR_0,
file('theBenchmark.p',prove_all_fond_of_another) ).
cnf(c_3,plain,
response(a,A) != A,
inference(clausify,[status(thm)],[prove_all_fond_of_another]) ).
cnf(c_4,plain,
response(mocking_bird,compose(A,B)) = response(A,response(B,compose(A,B))),
inference(paramod,[status(thm)],[c_2,c_1]) ).
cnf(c_6,plain,
A != response(a,A),
inference(copy,[status(thm)],[c_3]) ).
cnf(c_5,plain,
$false,
inference(resolve,[status(thm)],[c_4,c_6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COL050-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.37 % Computer : n007.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sat Sep 26 23:07:25 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37 % Process 724660 was started by sandbox2 on n007,
% 0.09/0.37 % Sat Sep 26 23:07:25 2026
% 0.09/0.37 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/0.38
% 0.09/0.38 % From the command line: assign(max_seconds, 300).
% 0.09/0.39
% 0.09/0.39 % SZS status Unsatisfiable for theBenchmark
% 0.09/0.39
% 0.09/0.39 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.09/0.39 % Length of proof is 5.
% 0.09/0.39 % Level of proof is 2.
% 0.09/0.39 % Maximum clause weight is 13.000.
% 0.09/0.39 % Given clauses 2.
% 0.09/0.39
% 0.09/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------