%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL042-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n026.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 02:00:45 PM UTC 2026
% Result : Unsatisfiable 6.99s 1.40s
% Output : CNFRefutation 6.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 20 unt; 0 nHn; 14 RR)
% Number of literals : 20 ( 19 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-4 aty)
% Number of variables : 14 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(hi1,axiom,
is_a_theorem(implies(X,implies(not(X),Y))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(h1,plain,
is_a_theorem(implies(a,implies(not(a),c))) = true,
inference(hyper_resolution,[status(thm)],[hi1]) ).
cnf(hi0,axiom,
ifeq(is_a_theorem(implies(X,Y)),true,ifeq(is_a_theorem(X),true,is_a_theorem(Y),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(hi3,axiom,
is_a_theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(h2,plain,
is_a_theorem(implies(not(a),implies(a,c))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi3,h1]) ).
cnf(hi2,axiom,
is_a_theorem(implies(X,implies(Y,X))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(h5,plain,
is_a_theorem(implies(implies(a,b),implies(not(a),implies(a,c)))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi2,h2]) ).
cnf(h6,plain,
is_a_theorem(implies(not(a),implies(implies(a,b),implies(a,c)))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi3,h5]) ).
cnf(hi4,axiom,
is_a_theorem(implies(implies(Y,Z),implies(implies(X,Y),implies(X,Z)))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(h0,plain,
is_a_theorem(implies(implies(b,c),implies(implies(a,b),implies(a,c)))) = true,
inference(hyper_resolution,[status(thm)],[hi4]) ).
cnf(h8,plain,
is_a_theorem(implies(implies(a,implies(b,c)),implies(a,implies(implies(a,b),implies(a,c))))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi4,h0]) ).
cnf(hi5,axiom,
is_a_theorem(implies(implies(X,Y),implies(implies(not(X),Y),Y))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(h7,plain,
is_a_theorem(implies(implies(implies(a,implies(b,c)),implies(a,implies(implies(a,b),implies(a,c)))),implies(implies(a,implies(b,c)),implies(implies(not(a),implies(implies(a,b),implies(a,c))),implies(implies(a,b),implies(a,c)))))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi4,hi5]) ).
cnf(h9,plain,
is_a_theorem(implies(implies(a,implies(b,c)),implies(implies(not(a),implies(implies(a,b),implies(a,c))),implies(implies(a,b),implies(a,c))))) = true,
inference(hyper_resolution,[status(thm)],[hi0,h7,h8]) ).
cnf(h10,plain,
is_a_theorem(implies(implies(not(a),implies(implies(a,b),implies(a,c))),implies(implies(a,implies(b,c)),implies(implies(a,b),implies(a,c))))) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi3,h9]) ).
cnf(t7,plain,
is_a_theorem(implies(implies(a,implies(b,c)),implies(implies(a,b),implies(a,c)))) = true,
inference(hyper_resolution,[status(thm)],[hi0,h10,h6]) ).
cnf(t14,plain,
is_a_theorem(implies(implies(a,implies(b,c)),implies(implies(a,b),implies(a,c)))) = true,
inference(orient,[status(thm)],[t7]) ).
cnf(goal_0,negated_conjecture,
is_a_theorem(implies(implies(a,implies(b,c)),implies(implies(a,b),implies(a,c)))) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t14]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL042-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.37 % Computer : n026.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Wed Sep 23 21:45:08 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 6.99/1.40 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.99/1.40 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------