%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : COL031-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n013.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 : Thu Sep 24 08:14:22 AM UTC 2026
% Result : Unsatisfiable 0.10s 0.40s
% Output : Proof 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 25 ( 18 unt; 0 nHn; 22 RR)
% Number of literals : 37 ( 29 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 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 : 15 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(l_definition,axiom,
apply(apply(l,X),Y) = apply(X,apply(Y,Y)),
file('theBenchmark.p',l_definition) ).
cnf(o_definition,axiom,
apply(apply(o,X),Y) = apply(Y,apply(X,Y)),
file('theBenchmark.p',o_definition) ).
cnf(prove_fixed_point,negated_conjecture,
apply(Y,f(Y)) != apply(f(Y),apply(Y,f(Y))),
file('theBenchmark.p',prove_fixed_point) ).
cnf(equality_1,axiom,
Eq_x_0 = Eq_x_0,
theory(equality,[reflexivity]) ).
cnf(equality_3,axiom,
( Eq_x_0 = Eq_x_2
| Eq_x_1 != Eq_x_2
| Eq_x_0 != Eq_x_1 ),
theory(equality,[transitivity]) ).
cnf(equality_4,axiom,
( apply(Eq_x_0,Eq_x_1) = apply(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_5,axiom,
( f(Eq_x_0) = f(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(t1,plain,
apply(apply(o,apply(apply(l,o),apply(l,o))),f(apply(o,apply(apply(l,o),apply(l,o))))) != apply(f(apply(o,apply(apply(l,o),apply(l,o)))),apply(apply(o,apply(apply(l,o),apply(l,o))),f(apply(o,apply(apply(l,o),apply(l,o)))))),
inference(start,[status(thm),parent(0:0)],[prove_fixed_point]) ).
cnf(t2,plain,
( apply(f(apply(o,apply(apply(l,o),apply(l,o)))),apply(apply(apply(l,o),apply(l,o)),f(apply(o,apply(apply(l,o),apply(l,o)))))) != apply(f(apply(o,apply(apply(l,o),apply(l,o)))),apply(apply(o,apply(apply(l,o),apply(l,o))),f(apply(o,apply(apply(l,o),apply(l,o))))))
| apply(apply(o,apply(apply(l,o),apply(l,o))),f(apply(o,apply(apply(l,o),apply(l,o))))) != apply(f(apply(o,apply(apply(l,o),apply(l,o)))),apply(apply(apply(l,o),apply(l,o)),f(apply(o,apply(apply(l,o),apply(l,o))))))
| apply(apply(o,apply(apply(l,o),apply(l,o))),f(apply(o,apply(apply(l,o),apply(l,o))))) = apply(f(apply(o,apply(apply(l,o),apply(l,o)))),apply(apply(o,apply(apply(l,o),apply(l,o))),f(apply(o,apply(apply(l,o),apply(l,o)))))) ),
inference(extension,[status(thm),parent(t1:1)],[equality_3]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
apply(apply(o,apply(apply(l,o),apply(l,o))),f(apply(o,apply(apply(l,o),apply(l,o))))) = apply(f(apply(o,apply(apply(l,o),apply(l,o)))),apply(apply(apply(l,o),apply(l,o)),f(apply(o,apply(apply(l,o),apply(l,o)))))),
inference(extension,[status(thm),parent(t2:2)],[o_definition]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
( apply(apply(apply(l,o),apply(l,o)),f(apply(o,apply(apply(l,o),apply(l,o))))) != apply(apply(o,apply(apply(l,o),apply(l,o))),f(apply(o,apply(apply(l,o),apply(l,o)))))
| f(apply(o,apply(apply(l,o),apply(l,o)))) != f(apply(o,apply(apply(l,o),apply(l,o))))
| apply(f(apply(o,apply(apply(l,o),apply(l,o)))),apply(apply(apply(l,o),apply(l,o)),f(apply(o,apply(apply(l,o),apply(l,o)))))) = apply(f(apply(o,apply(apply(l,o),apply(l,o)))),apply(apply(o,apply(apply(l,o),apply(l,o))),f(apply(o,apply(apply(l,o),apply(l,o)))))) ),
inference(extension,[status(thm),parent(t2:3)],[equality_4]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
cnf(t8,plain,
( apply(o,apply(apply(l,o),apply(l,o))) != apply(o,apply(apply(l,o),apply(l,o)))
| f(apply(o,apply(apply(l,o),apply(l,o)))) = f(apply(o,apply(apply(l,o),apply(l,o)))) ),
inference(extension,[status(thm),parent(t6:2)],[equality_5]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).
cnf(t10,plain,
apply(o,apply(apply(l,o),apply(l,o))) = apply(o,apply(apply(l,o),apply(l,o))),
inference(extension,[status(thm),parent(t8:2)],[equality_1]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
cnf(l4,lemma,
f(apply(o,apply(apply(l,o),apply(l,o)))) = f(apply(o,apply(apply(l,o),apply(l,o)))),
inference(lemma,[status(cth),parent(t6:2),below(t2:3)],[t6:2]) ).
cnf(t12,plain,
( f(apply(o,apply(apply(l,o),apply(l,o)))) != f(apply(o,apply(apply(l,o),apply(l,o))))
| apply(apply(l,o),apply(l,o)) != apply(o,apply(apply(l,o),apply(l,o)))
| apply(apply(apply(l,o),apply(l,o)),f(apply(o,apply(apply(l,o),apply(l,o))))) = apply(apply(o,apply(apply(l,o),apply(l,o))),f(apply(o,apply(apply(l,o),apply(l,o))))) ),
inference(extension,[status(thm),parent(t6:3)],[equality_4]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t6:3]) ).
cnf(t14,plain,
apply(apply(l,o),apply(l,o)) = apply(o,apply(apply(l,o),apply(l,o))),
inference(extension,[status(thm),parent(t12:2)],[l_definition]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t12:2]) ).
cnf(t16,plain,
f(apply(o,apply(apply(l,o),apply(l,o)))) = f(apply(o,apply(apply(l,o),apply(l,o)))),
inference(lemma_extension,[status(thm),parent(t12:3)],[l4:1]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t12:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COL031-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 This is a CNF_UNS_RFO_PEQ_UEQ problem
% 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37 % Computer : n013.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 20 14:34:08 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.40 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.40 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------