%------------------------------------------------------------------------------
% File : Toma---0.7
% Problem : COL010-1 : TPTP v9.0.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d THM
% Computer : n002.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:13 AM UTC 2025
% Result : Unsatisfiable 0.21s 0.58s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 12 ( 11 unt; 0 def)
% Number of atoms : 14 ( 13 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 5 ( 3 ~; 0 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 15 ( 0 sgn 1 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,negated_conjecture,
Y != apply(combinator,Y),
file('theBenchmark.p',prove_fixed_point) ).
fof(e,plain,
! [Y] :
( true != false
& eq(Y,Y) = true
& eq(Y,apply(combinator,Y)) = 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,plain,
eq(X,apply(combinator,X)) = false,
inference(split_conjunct,[status(thm)],[e]) ).
cnf(c3,axiom,
apply(apply(apply(b,X),Y),Z) = apply(X,apply(Y,Z)),
file('theBenchmark.p',b_definition) ).
cnf(c4,axiom,
apply(apply(apply(s2,X),Y),Z) = apply(apply(X,Z),apply(Y,Y)),
file('theBenchmark.p',s2_definition) ).
cnf(c5,plain,
apply(apply(apply(s2,apply(b,X)),Y),Z) = apply(X,apply(Z,apply(Y,Y))),
inference(equational,[status(thm)],[c3,c4]) ).
cnf(c6,plain,
eq(apply(X,apply(Y,Y)),apply(apply(apply(s2,apply(b,combinator)),Y),X)) = false,
inference(equational,[status(thm)],[c2,c5]) ).
cnf(c7,plain,
true = false,
inference(equational,[status(thm)],[c1,c6]) ).
cnf(g2,plain,
true = false,
inference(equational,[status(thm)],[c7]) ).
cnf(g3,plain,
$false,
inference(resolution,[status(thm)],[g1,g2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : COL010-1 : TPTP v9.0.0. Released v1.0.0.
% 0.07/0.14 % Command : run_Leo-III %s %d THM
% 0.13/0.35 % Computer : n002.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Jul 14 04:47:49 EDT 2025
% 0.13/0.35 % CPUTime :
% 0.21/0.58 % SZS status Unsatisfiable
% 0.21/0.58 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------