%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : LCL112-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n017.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 01:09:23 PM UTC 2026
% Result : Unsatisfiable 1.27s 0.59s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL112-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 % Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.34 % Computer : n017.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Mon Sep 21 00:01:11 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.36 % Drodi V4.1.1
% 1.27/0.59 % Refutation found
% 1.27/0.59 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 1.27/0.59 % SZS output start CNFRefutation for theBenchmark
% 1.27/0.59 fof(f1,axiom,(
% 1.27/0.59 (![X,Y]: (( ~ is_a_theorem(implies(X,Y))| ~ is_a_theorem(X)| is_a_theorem(Y) ) ))),
% 1.27/0.59 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 1.27/0.59 fof(f2,axiom,(
% 1.27/0.59 (![X,Y]: (is_a_theorem(implies(X,implies(Y,X))) ))),
% 1.27/0.59 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 1.27/0.59 fof(f3,axiom,(
% 1.27/0.59 (![X,Y,Z]: (is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))) ))),
% 1.27/0.59 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 1.27/0.59 fof(f4,axiom,(
% 1.27/0.59 (![X,Y]: (is_a_theorem(implies(implies(implies(X,Y),Y),implies(implies(Y,X),X))) ))),
% 1.27/0.59 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 1.27/0.59 fof(f5,axiom,(
% 1.27/0.59 (![X,Y]: (is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))) ))),
% 1.27/0.59 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 1.27/0.59 fof(f6,negated_conjecture,(
% 1.27/0.59 ~ is_a_theorem(implies(a,not(not(a)))) ),
% 1.27/0.59 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 1.27/0.59 fof(f7,plain,(
% 1.27/0.59 ![Y]: ((![X]: (~is_a_theorem(implies(X,Y))|~is_a_theorem(X)))|is_a_theorem(Y))),
% 1.27/0.59 inference(miniscoping,[status(thm)],[f1])).
% 1.27/0.59 fof(f8,plain,(
% 1.27/0.59 ![X0,X1]: (~is_a_theorem(implies(X0,X1))|~is_a_theorem(X0)|is_a_theorem(X1))),
% 1.27/0.59 inference(cnf_transformation,[status(thm)],[f7])).
% 1.27/0.59 fof(f9,plain,(
% 1.27/0.59 ![X0,X1]: (is_a_theorem(implies(X0,implies(X1,X0))))),
% 1.27/0.59 inference(cnf_transformation,[status(thm)],[f2])).
% 1.27/0.59 fof(f10,plain,(
% 1.27/0.59 ![X0,X1,X2]: (is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))))),
% 1.27/0.59 inference(cnf_transformation,[status(thm)],[f3])).
% 1.27/0.59 fof(f11,plain,(
% 1.27/0.59 ![X0,X1]: (is_a_theorem(implies(implies(implies(X0,X1),X1),implies(implies(X1,X0),X0))))),
% 1.27/0.59 inference(cnf_transformation,[status(thm)],[f4])).
% 1.27/0.59 fof(f12,plain,(
% 1.27/0.59 ![X0,X1]: (is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))))),
% 1.27/0.59 inference(cnf_transformation,[status(thm)],[f5])).
% 1.27/0.59 fof(f13,plain,(
% 1.27/0.59 ~is_a_theorem(implies(a,not(not(a))))),
% 1.27/0.59 inference(cnf_transformation,[status(thm)],[f6])).
% 1.27/0.59 fof(f14,plain,(
% 1.27/0.59 ![X0,X1]: (~is_a_theorem(X0)|is_a_theorem(implies(X1,X0)))),
% 1.27/0.59 inference(resolution,[status(thm)],[f8,f9])).
% 1.27/0.59 fof(f19,definition,(
% 1.27/0.59 ![X1]: (sQ1_spl <=> (~is_a_theorem(X1)))),
% 1.27/0.59 introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition])).
% 1.27/0.59 fof(f20,plain,(
% 1.27/0.59 ![X0]: (~is_a_theorem(X0)|~sQ1_spl)),
% 1.27/0.59 inference(component_clause,[status(thm)],[f19])).
% 1.27/0.59 fof(f24,plain,(
% 1.27/0.59 ![X0,X1,X2]: (~is_a_theorem(implies(X0,X1))|is_a_theorem(implies(implies(X1,X2),implies(X0,X2))))),
% 1.27/0.59 inference(resolution,[status(thm)],[f10,f8])).
% 1.27/0.59 fof(f25,plain,(
% 1.27/0.59 ![X0,X1]: (~is_a_theorem(implies(not(X0),not(X1)))|is_a_theorem(implies(X1,X0)))),
% 1.27/0.59 inference(resolution,[status(thm)],[f12,f8])).
% 1.27/0.59 fof(f27,plain,(
% 1.27/0.59 ![X0,X1]: (~is_a_theorem(implies(implies(X0,X1),X1))|is_a_theorem(implies(implies(X1,X0),X0)))),
% 1.27/0.59 inference(resolution,[status(thm)],[f11,f8])).
% 1.27/0.59 fof(f28,plain,(
% 1.27/0.59 ![X0,X1,X2]: (~is_a_theorem(implies(X0,X1))|~is_a_theorem(implies(X1,X2))|is_a_theorem(implies(X0,X2)))),
% 1.27/0.59 inference(resolution,[status(thm)],[f24,f8])).
% 1.27/0.59 fof(f46,plain,(
% 1.27/0.59 $false|~sQ1_spl),
% 1.27/0.59 inference(backward_subsumption_resolution,[status(thm)],[f11,f20])).
% 1.27/0.59 fof(f50,plain,(
% 1.27/0.59 ~sQ1_spl),
% 1.27/0.59 inference(contradiction_clause,[status(thm)],[f46])).
% 1.27/0.59 fof(f97,plain,(
% 1.27/0.59 ![X0,X1]: (is_a_theorem(implies(implies(X0,X1),X1))|~is_a_theorem(X0))),
% 1.27/0.59 inference(resolution,[status(thm)],[f27,f14])).
% 1.27/0.59 fof(f113,plain,(
% 1.27/0.59 ![X0,X1,X2]: (~is_a_theorem(implies(X0,implies(not(X1),not(X2))))|is_a_theorem(implies(X0,implies(X2,X1))))),
% 1.27/0.59 inference(resolution,[status(thm)],[f28,f12])).
% 1.27/0.59 fof(f116,plain,(
% 1.27/0.59 ![X0,X1,X2]: (~is_a_theorem(implies(X0,implies(X1,X2)))|is_a_theorem(implies(X0,X2))|~is_a_theorem(X1))),
% 1.27/0.59 inference(resolution,[status(thm)],[f28,f97])).
% 1.27/0.59 fof(f374,plain,(
% 1.27/0.59 ![X0,X1]: (is_a_theorem(implies(not(X0),implies(X0,X1))))),
% 1.27/0.59 inference(resolution,[status(thm)],[f113,f9])).
% 1.27/0.59 fof(f380,plain,(
% 1.27/0.59 ![X0,X1]: (is_a_theorem(implies(not(not(X0)),implies(X1,X0))))),
% 1.27/0.59 inference(resolution,[status(thm)],[f374,f113])).
% 1.27/0.59 fof(f417,plain,(
% 1.27/0.59 ![X0,X1]: (is_a_theorem(implies(not(not(X0)),X0))|~is_a_theorem(X1))),
% 1.27/0.60 inference(resolution,[status(thm)],[f380,f116])).
% 1.27/0.60 fof(f424,definition,(
% 1.27/0.60 ![X0]: (sQ19_spl <=> (is_a_theorem(implies(not(not(X0)),X0))))),
% 1.27/0.60 introduced(definition,[new_symbols(definition,[sQ19_spl])],[split_symbol_definition])).
% 1.27/0.60 fof(f425,plain,(
% 1.27/0.60 ![X0]: (is_a_theorem(implies(not(not(X0)),X0))|~sQ19_spl)),
% 1.27/0.60 inference(component_clause,[status(thm)],[f424])).
% 1.27/0.60 fof(f427,plain,(
% 1.27/0.60 sQ19_spl|sQ1_spl),
% 1.27/0.60 inference(split_clause,[status(thm)],[f417,f424,f19])).
% 1.27/0.60 fof(f439,plain,(
% 1.27/0.60 ![X0]: (is_a_theorem(implies(X0,not(not(X0))))|~sQ19_spl)),
% 1.27/0.60 inference(resolution,[status(thm)],[f425,f25])).
% 1.27/0.60 fof(f453,plain,(
% 1.27/0.60 $false|~sQ19_spl),
% 1.27/0.60 inference(backward_subsumption_resolution,[status(thm)],[f13,f439])).
% 1.27/0.60 fof(f465,plain,(
% 1.27/0.60 ~sQ19_spl),
% 1.27/0.60 inference(contradiction_clause,[status(thm)],[f453])).
% 1.27/0.60 fof(f466,plain,(
% 1.27/0.60 $false),
% 1.27/0.60 inference(sat_refutation,[status(thm)],[f50,f427,f465])).
% 1.27/0.60 % SZS output end CNFRefutation for theBenchmark.p
% 1.27/0.63 % Elapsed time: 0.265798 seconds
% 1.27/0.63 % CPU time: 1.728683 seconds
% 1.27/0.63 % Total memory used: 76.235 MB
% 1.27/0.63 % Net memory used: 71.933 MB
%------------------------------------------------------------------------------