%------------------------------------------------------------------------------
% File : Toma---0.7
% Problem : COL056-1 : TPTP v9.0.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d THM
% Computer : n013.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 : Tue Jul 15 06:17:19 AM UTC 2025
% Result : Unsatisfiable 0.21s 0.45s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 13 ( 12 unt; 0 def)
% Number of atoms : 15 ( 14 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 5 ( 3 ~; 0 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 14 ( 5 sgn 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,negated_conjecture,
response(W,V) != V,
file('theBenchmark.p',prove_there_exists_a_happy_bird) ).
fof(e,plain,
! [V,W] :
( true != false
& eq(V,V) = true
& eq(response(W,V),V) = false ),
inference(encode_existential,[status(esa)],[g0]) ).
cnf(g1,plain,
true != false,
inference(split_conjunct,[status(thm)],[e]) ).
cnf(c1,plain,
eq(X,X) = true,
inference(split_conjunct,[status(thm)],[e]) ).
cnf(c2,axiom,
response(a,b) = c,
file('theBenchmark.p',a_to_b_responds_c) ).
cnf(c3,axiom,
response(a,c) = b,
file('theBenchmark.p',a_to_c_responds_b) ).
cnf(c4,plain,
eq(response(X,Y),Y) = false,
inference(split_conjunct,[status(thm)],[e]) ).
cnf(c7,axiom,
response(compose(X,Y),Z) = response(X,response(Y,Z)),
file('theBenchmark.p',composer_exists) ).
cnf(c8,plain,
eq(response(X,response(Y,Z)),Z) = false,
inference(equational,[status(thm)],[c4,c7]) ).
cnf(c9,plain,
eq(response(X,c),b) = false,
inference(equational,[status(thm)],[c2,c8]) ).
cnf(c10,plain,
true = false,
inference(equational,[status(thm)],[c1,c3,c9]) ).
cnf(g2,plain,
true = false,
inference(equational,[status(thm)],[c10]) ).
cnf(g3,plain,
$false,
inference(resolution,[status(thm)],[g1,g2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COL056-1 : TPTP v9.0.0. Released v1.0.0.
% 0.07/0.12 % Command : run_Leo-III %s %d THM
% 0.12/0.33 % Computer : n013.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 : Mon Jul 14 04:54:04 EDT 2025
% 0.12/0.33 % CPUTime :
% 0.21/0.45 % SZS status Unsatisfiable
% 0.21/0.45 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------