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