%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : COL010-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n012.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 : Fri Sep 25 01:01:44 PM UTC 2026
% Result : Unsatisfiable 2.65s 0.72s
% Output : CNFRefutation 2.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 6 RR)
% Number of literals : 18 ( 17 equ; 3 neg)
% Maximal clause size : 1 ( 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 : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eg0,negated_conjecture,
Y != apply(combinator,Y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t1,plain,
eq(X1,apply(combinator,X1)) = efalse,
inference(equality_encoding,[status(esa)],[eg0]) ).
cnf(t15,plain,
eq(X1,apply(combinator,X1)) = efalse,
inference(orient,[status(thm)],[t1]) ).
cnf(t3,axiom,
apply(apply(apply(s2,X1),X2),X3) = apply(apply(X1,X3),apply(X2,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t5,plain,
apply(apply(X1,X2),apply(X3,X3)) = apply(apply(apply(s2,X1),X3),X2),
inference(orient,[status(thm)],[t3]) ).
cnf(t2,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t4,plain,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
inference(orient,[status(thm)],[t2]) ).
cnf(t6,plain,
apply(apply(apply(s2,apply(b,X1)),X2),X3) = apply(X1,apply(X3,apply(X2,X2))),
inference(cp,[status(thm)],[t5,t4]) ).
cnf(t31,plain,
apply(apply(apply(s2,apply(b,X1)),X2),X3) = apply(X1,apply(X3,apply(X2,X2))),
inference(orient,[status(thm)],[t6]) ).
cnf(t59,plain,
efalse = eq(apply(X1,apply(X2,X2)),apply(apply(apply(s2,apply(b,combinator)),X2),X1)),
inference(cp,[status(thm)],[t15,t31]) ).
cnf(t90,plain,
eq(apply(X1,apply(X2,X2)),apply(apply(apply(s2,apply(b,combinator)),X2),X1)) = efalse,
inference(orient,[status(thm)],[t59]) ).
cnf(t0,plain,
eq(X1,X1) = etrue,
introduced(definition) ).
cnf(t14,plain,
eq(X1,X1) = etrue,
inference(orient,[status(thm)],[t0]) ).
cnf(t91,plain,
efalse = etrue,
inference(cp,[status(thm)],[t90,t14]) ).
cnf(t110,plain,
efalse = etrue,
inference(orient,[status(thm)],[t91]) ).
cnf(goal_0,negated_conjecture,
etrue != efalse,
introduced(definition) ).
cnf(g0_0,plain,
etrue != etrue,
inference(rw,[status(thm)],[goal_0,t110]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : COL010-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.02 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.03/0.29 % Computer : n012.cluster.edu
% 0.03/0.29 % Model : x86_64 x86_64
% 0.03/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.29 % Memory : 8046.5625MB
% 0.03/0.29 % OS : Linux 6.8.0-71-generic
% 0.03/0.29 % CPULimit : 300
% 0.03/0.29 % WCLimit : 300
% 0.03/0.29 % DateTime : Fri Sep 25 07:12:20 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.65/0.72 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.65/0.72 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------