%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : LCL512+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n001.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:10:12 PM UTC 2026
% Result : Theorem 0.09s 5.59s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL512+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/5.57 % Computer : n001.cluster.edu
% 0.09/5.57 % Model : x86_64 x86_64
% 0.09/5.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.57 % Memory : 8046.5625MB
% 0.09/5.57 % OS : Linux 6.8.0-71-generic
% 0.09/5.57 % CPULimit : 300
% 0.09/5.57 % WCLimit : 300
% 0.09/5.57 % DateTime : Mon Sep 21 00:42:20 UTC 2026
% 0.09/5.57 % CPUTime :
% 0.09/5.58 % Drodi V4.1.1
% 0.09/5.59 % Refutation found
% 0.09/5.59 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.09/5.59 % SZS output start CNFRefutation for theBenchmark
% 0.09/5.59 fof(f13,axiom,(
% 0.09/5.59 ( equivalence_1<=> (! [X,Y] : is_a_theorem(implies(equiv(X,Y),implies(X,Y))) )) ),
% 0.09/5.59 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/5.59 fof(f17,axiom,(
% 0.09/5.59 ( kn2<=> (! [P,Q] : is_a_theorem(implies(and(P,Q),P)) )) ),
% 0.09/5.59 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/5.59 fof(f31,axiom,(
% 0.09/5.59 ( op_equiv=> (! [X,Y] : equiv(X,Y) = and(implies(X,Y),implies(Y,X)) )) ),
% 0.09/5.59 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/5.59 fof(f34,axiom,(
% 0.09/5.59 op_equiv ),
% 0.09/5.59 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/5.59 fof(f37,axiom,(
% 0.09/5.59 kn2 ),
% 0.09/5.59 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/5.59 fof(f43,conjecture,(
% 0.09/5.59 equivalence_1 ),
% 0.09/5.59 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.09/5.59 fof(f44,negated_conjecture,(
% 0.09/5.59 ~(equivalence_1 )),
% 0.09/5.59 inference(negated_conjecture,[status(cth)],[f43])).
% 0.09/5.59 fof(f99,plain,(
% 0.09/5.59 (~equivalence_1|(![X,Y]: is_a_theorem(implies(equiv(X,Y),implies(X,Y)))))&(equivalence_1|(?[X,Y]: ~is_a_theorem(implies(equiv(X,Y),implies(X,Y)))))),
% 0.09/5.59 inference(NNF_transformation,[status(thm)],[f13])).
% 0.09/5.59 fof(f100,plain,(
% 0.09/5.59 (~equivalence_1|(![X,Y]: is_a_theorem(implies(equiv(X,Y),implies(X,Y)))))&(equivalence_1|~is_a_theorem(implies(equiv(sK26_skl,sK27_skl),implies(sK26_skl,sK27_skl))))),
% 0.09/5.59 inference(skolemize,[status(esa),new_symbols(skolem,[sK26_skl,sK27_skl]),skolemize(X,sK26_skl),skolemize(Y,sK27_skl)],[f99])).
% 0.09/5.59 fof(f102,plain,(
% 0.09/5.59 equivalence_1|~is_a_theorem(implies(equiv(sK26_skl,sK27_skl),implies(sK26_skl,sK27_skl)))),
% 0.09/5.59 inference(cnf_transformation,[status(thm)],[f100])).
% 0.09/5.59 fof(f115,plain,(
% 0.09/5.59 (~kn2|(![P,Q]: is_a_theorem(implies(and(P,Q),P))))&(kn2|(?[P,Q]: ~is_a_theorem(implies(and(P,Q),P))))),
% 0.09/5.59 inference(NNF_transformation,[status(thm)],[f17])).
% 0.09/5.59 fof(f116,plain,(
% 0.09/5.59 (~kn2|(![P,Q]: is_a_theorem(implies(and(P,Q),P))))&(kn2|~is_a_theorem(implies(and(sK33_skl,sK34_skl),sK33_skl)))),
% 0.09/5.59 inference(skolemize,[status(esa),new_symbols(skolem,[sK33_skl,sK34_skl]),skolemize(P,sK33_skl),skolemize(Q,sK34_skl)],[f115])).
% 0.09/5.59 fof(f117,plain,(
% 0.09/5.59 ![X0,X1]: (~kn2|is_a_theorem(implies(and(X0,X1),X0)))),
% 0.09/5.59 inference(cnf_transformation,[status(thm)],[f116])).
% 0.09/5.59 fof(f163,plain,(
% 0.09/5.59 ~op_equiv|(![X,Y]: equiv(X,Y)=and(implies(X,Y),implies(Y,X)))),
% 0.09/5.59 inference(pre_NNF_transformation,[status(thm)],[f31])).
% 0.09/5.59 fof(f164,plain,(
% 0.09/5.59 ![X0,X1]: (~op_equiv|equiv(X0,X1)=and(implies(X0,X1),implies(X1,X0)))),
% 0.09/5.59 inference(cnf_transformation,[status(thm)],[f163])).
% 0.09/5.59 fof(f167,plain,(
% 0.09/5.59 op_equiv),
% 0.09/5.59 inference(cnf_transformation,[status(thm)],[f34])).
% 0.09/5.59 fof(f170,plain,(
% 0.09/5.59 kn2),
% 0.09/5.59 inference(cnf_transformation,[status(thm)],[f37])).
% 0.09/5.59 fof(f176,plain,(
% 0.09/5.59 ~equivalence_1),
% 0.09/5.59 inference(cnf_transformation,[status(thm)],[f44])).
% 0.09/5.59 fof(f183,plain,(
% 0.09/5.59 ![X0,X1]: (is_a_theorem(implies(and(X0,X1),X0)))),
% 0.09/5.59 inference(forward_subsumption_resolution,[status(thm)],[f117,f170])).
% 0.09/5.59 fof(f184,plain,(
% 0.09/5.59 ~is_a_theorem(implies(equiv(sK26_skl,sK27_skl),implies(sK26_skl,sK27_skl)))),
% 0.09/5.59 inference(forward_subsumption_resolution,[status(thm)],[f102,f176])).
% 0.09/5.59 fof(f208,plain,(
% 0.09/5.59 ![X0,X1]: (equiv(X0,X1)=and(implies(X0,X1),implies(X1,X0)))),
% 0.09/5.59 inference(forward_subsumption_resolution,[status(thm)],[f164,f167])).
% 0.09/5.59 fof(f212,plain,(
% 0.09/5.59 ![X0,X1]: (is_a_theorem(implies(equiv(X0,X1),implies(X0,X1))))),
% 0.09/5.59 inference(paramodulation,[status(thm)],[f208,f183])).
% 0.09/5.59 fof(f215,plain,(
% 0.09/5.59 $false),
% 0.09/5.59 inference(backward_subsumption_resolution,[status(thm)],[f184,f212])).
% 0.09/5.59 % SZS output end CNFRefutation for theBenchmark.p
% 0.14/5.62 % Elapsed time: 0.043785 seconds
% 0.14/5.62 % CPU time: 0.084650 seconds
% 0.14/5.62 % Total memory used: 15.771 MB
% 0.14/5.62 % Net memory used: 15.745 MB
%------------------------------------------------------------------------------