TSTP Solution File: LCL459+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : LCL459+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed May 31 12:19:22 EDT 2023
% Result : Theorem 0.13s 0.36s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL459+1 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue May 30 09:32:52 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Drodi V3.5.1
% 0.13/0.36 % Refutation found
% 0.13/0.36 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.36 % SZS output start CNFRefutation for theBenchmark
% 0.13/0.36 fof(f1,axiom,(
% 0.13/0.36 ( modus_ponens<=> (! [X,Y] :( ( is_a_theorem(X)& is_a_theorem(implies(X,Y)) )=> is_a_theorem(Y) ) )) ),
% 0.13/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.36 fof(f5,axiom,(
% 0.13/0.36 ( implies_2<=> (! [X,Y] : is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y))) )) ),
% 0.13/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.36 fof(f9,axiom,(
% 0.13/0.36 ( and_3<=> (! [X,Y] : is_a_theorem(implies(X,implies(Y,and(X,Y)))) )) ),
% 0.13/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.36 fof(f16,axiom,(
% 0.13/0.36 ( kn1<=> (! [P] : is_a_theorem(implies(P,and(P,P))) )) ),
% 0.13/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.36 fof(f35,axiom,(
% 0.13/0.36 modus_ponens ),
% 0.13/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.36 fof(f38,axiom,(
% 0.13/0.36 implies_2 ),
% 0.13/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.36 fof(f42,axiom,(
% 0.13/0.36 and_3 ),
% 0.13/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.36 fof(f53,conjecture,(
% 0.13/0.36 kn1 ),
% 0.13/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.36 fof(f54,negated_conjecture,(
% 0.13/0.36 ~(kn1 )),
% 0.13/0.36 inference(negated_conjecture,[status(cth)],[f53])).
% 0.13/0.36 fof(f55,plain,(
% 0.13/0.36 modus_ponens<=>(![X,Y]: ((~is_a_theorem(X)|~is_a_theorem(implies(X,Y)))|is_a_theorem(Y)))),
% 0.13/0.36 inference(pre_NNF_transformation,[status(esa)],[f1])).
% 0.13/0.36 fof(f56,plain,(
% 0.13/0.36 (~modus_ponens|(![X,Y]: ((~is_a_theorem(X)|~is_a_theorem(implies(X,Y)))|is_a_theorem(Y))))&(modus_ponens|(?[X,Y]: ((is_a_theorem(X)&is_a_theorem(implies(X,Y)))&~is_a_theorem(Y))))),
% 0.13/0.36 inference(NNF_transformation,[status(esa)],[f55])).
% 0.13/0.36 fof(f57,plain,(
% 0.13/0.36 (~modus_ponens|(![Y]: ((![X]: (~is_a_theorem(X)|~is_a_theorem(implies(X,Y))))|is_a_theorem(Y))))&(modus_ponens|(?[Y]: ((?[X]: (is_a_theorem(X)&is_a_theorem(implies(X,Y))))&~is_a_theorem(Y))))),
% 0.13/0.36 inference(miniscoping,[status(esa)],[f56])).
% 0.13/0.36 fof(f58,plain,(
% 0.13/0.36 (~modus_ponens|(![Y]: ((![X]: (~is_a_theorem(X)|~is_a_theorem(implies(X,Y))))|is_a_theorem(Y))))&(modus_ponens|((is_a_theorem(sk0_1)&is_a_theorem(implies(sk0_1,sk0_0)))&~is_a_theorem(sk0_0)))),
% 0.13/0.36 inference(skolemization,[status(esa)],[f57])).
% 0.13/0.36 fof(f59,plain,(
% 0.13/0.36 ![X0,X1]: (~modus_ponens|~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1))),
% 0.13/0.36 inference(cnf_transformation,[status(esa)],[f58])).
% 0.13/0.36 fof(f77,plain,(
% 0.13/0.36 (~implies_2|(![X,Y]: is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y)))))&(implies_2|(?[X,Y]: ~is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y)))))),
% 0.13/0.36 inference(NNF_transformation,[status(esa)],[f5])).
% 0.13/0.36 fof(f78,plain,(
% 0.13/0.36 (~implies_2|(![X,Y]: is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y)))))&(implies_2|~is_a_theorem(implies(implies(sk0_8,implies(sk0_8,sk0_9)),implies(sk0_8,sk0_9))))),
% 0.13/0.36 inference(skolemization,[status(esa)],[f77])).
% 0.13/0.36 fof(f79,plain,(
% 0.13/0.36 ![X0,X1]: (~implies_2|is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))))),
% 0.13/0.36 inference(cnf_transformation,[status(esa)],[f78])).
% 0.13/0.36 fof(f93,plain,(
% 0.13/0.36 (~and_3|(![X,Y]: is_a_theorem(implies(X,implies(Y,and(X,Y))))))&(and_3|(?[X,Y]: ~is_a_theorem(implies(X,implies(Y,and(X,Y))))))),
% 0.13/0.36 inference(NNF_transformation,[status(esa)],[f9])).
% 0.13/0.36 fof(f94,plain,(
% 0.13/0.36 (~and_3|(![X,Y]: is_a_theorem(implies(X,implies(Y,and(X,Y))))))&(and_3|~is_a_theorem(implies(sk0_17,implies(sk0_18,and(sk0_17,sk0_18)))))),
% 0.13/0.36 inference(skolemization,[status(esa)],[f93])).
% 0.13/0.36 fof(f95,plain,(
% 0.13/0.36 ![X0,X1]: (~and_3|is_a_theorem(implies(X0,implies(X1,and(X0,X1)))))),
% 0.13/0.36 inference(cnf_transformation,[status(esa)],[f94])).
% 0.13/0.36 fof(f121,plain,(
% 0.13/0.36 (~kn1|(![P]: is_a_theorem(implies(P,and(P,P)))))&(kn1|(?[P]: ~is_a_theorem(implies(P,and(P,P)))))),
% 0.13/0.36 inference(NNF_transformation,[status(esa)],[f16])).
% 0.13/0.36 fof(f122,plain,(
% 0.13/0.36 (~kn1|(![P]: is_a_theorem(implies(P,and(P,P)))))&(kn1|~is_a_theorem(implies(sk0_32,and(sk0_32,sk0_32))))),
% 0.13/0.36 inference(skolemization,[status(esa)],[f121])).
% 0.13/0.36 fof(f124,plain,(
% 0.13/0.36 kn1|~is_a_theorem(implies(sk0_32,and(sk0_32,sk0_32)))),
% 0.13/0.36 inference(cnf_transformation,[status(esa)],[f122])).
% 0.13/0.36 fof(f178,plain,(
% 0.13/0.36 modus_ponens),
% 0.13/0.36 inference(cnf_transformation,[status(esa)],[f35])).
% 0.13/0.36 fof(f181,plain,(
% 0.13/0.36 implies_2),
% 0.13/0.36 inference(cnf_transformation,[status(esa)],[f38])).
% 0.13/0.36 fof(f185,plain,(
% 0.13/0.36 and_3),
% 0.13/0.36 inference(cnf_transformation,[status(esa)],[f42])).
% 0.13/0.36 fof(f196,plain,(
% 0.13/0.36 ~kn1),
% 0.13/0.36 inference(cnf_transformation,[status(esa)],[f54])).
% 0.13/0.36 fof(f197,plain,(
% 0.13/0.36 spl0_0 <=> modus_ponens),
% 0.13/0.36 introduced(split_symbol_definition)).
% 0.13/0.36 fof(f199,plain,(
% 0.13/0.36 ~modus_ponens|spl0_0),
% 0.13/0.36 inference(component_clause,[status(thm)],[f197])).
% 0.13/0.36 fof(f200,plain,(
% 0.13/0.36 spl0_1 <=> ~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1)),
% 0.13/0.36 introduced(split_symbol_definition)).
% 0.13/0.36 fof(f201,plain,(
% 0.13/0.36 ![X0,X1]: (~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1)|~spl0_1)),
% 0.13/0.36 inference(component_clause,[status(thm)],[f200])).
% 0.13/0.36 fof(f203,plain,(
% 0.13/0.36 ~spl0_0|spl0_1),
% 0.13/0.36 inference(split_clause,[status(thm)],[f59,f197,f200])).
% 0.13/0.36 fof(f253,plain,(
% 0.13/0.36 spl0_15 <=> implies_2),
% 0.13/0.36 introduced(split_symbol_definition)).
% 0.13/0.36 fof(f255,plain,(
% 0.13/0.36 ~implies_2|spl0_15),
% 0.13/0.36 inference(component_clause,[status(thm)],[f253])).
% 0.13/0.36 fof(f256,plain,(
% 0.13/0.36 spl0_16 <=> is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))),
% 0.13/0.36 introduced(split_symbol_definition)).
% 0.13/0.36 fof(f257,plain,(
% 0.13/0.36 ![X0,X1]: (is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))|~spl0_16)),
% 0.13/0.36 inference(component_clause,[status(thm)],[f256])).
% 0.13/0.36 fof(f259,plain,(
% 0.13/0.36 ~spl0_15|spl0_16),
% 0.13/0.36 inference(split_clause,[status(thm)],[f79,f253,f256])).
% 0.13/0.36 fof(f297,plain,(
% 0.13/0.36 spl0_27 <=> and_3),
% 0.13/0.36 introduced(split_symbol_definition)).
% 0.13/0.36 fof(f299,plain,(
% 0.13/0.36 ~and_3|spl0_27),
% 0.13/0.36 inference(component_clause,[status(thm)],[f297])).
% 0.13/0.36 fof(f300,plain,(
% 0.13/0.36 spl0_28 <=> is_a_theorem(implies(X0,implies(X1,and(X0,X1))))),
% 0.13/0.36 introduced(split_symbol_definition)).
% 0.13/0.36 fof(f301,plain,(
% 0.13/0.36 ![X0,X1]: (is_a_theorem(implies(X0,implies(X1,and(X0,X1))))|~spl0_28)),
% 0.13/0.36 inference(component_clause,[status(thm)],[f300])).
% 0.13/0.36 fof(f303,plain,(
% 0.13/0.36 ~spl0_27|spl0_28),
% 0.13/0.36 inference(split_clause,[status(thm)],[f95,f297,f300])).
% 0.13/0.36 fof(f374,plain,(
% 0.13/0.36 spl0_48 <=> kn1),
% 0.13/0.36 introduced(split_symbol_definition)).
% 0.13/0.36 fof(f375,plain,(
% 0.13/0.36 kn1|~spl0_48),
% 0.13/0.36 inference(component_clause,[status(thm)],[f374])).
% 0.13/0.36 fof(f377,plain,(
% 0.13/0.36 spl0_49 <=> is_a_theorem(implies(X0,and(X0,X0)))),
% 0.13/0.36 introduced(split_symbol_definition)).
% 0.13/0.36 fof(f378,plain,(
% 0.13/0.36 ![X0]: (is_a_theorem(implies(X0,and(X0,X0)))|~spl0_49)),
% 0.13/0.36 inference(component_clause,[status(thm)],[f377])).
% 0.13/0.36 fof(f381,plain,(
% 0.13/0.36 spl0_50 <=> is_a_theorem(implies(sk0_32,and(sk0_32,sk0_32)))),
% 0.13/0.36 introduced(split_symbol_definition)).
% 0.13/0.36 fof(f383,plain,(
% 0.13/0.36 ~is_a_theorem(implies(sk0_32,and(sk0_32,sk0_32)))|spl0_50),
% 0.13/0.36 inference(component_clause,[status(thm)],[f381])).
% 0.13/0.36 fof(f384,plain,(
% 0.13/0.36 spl0_48|~spl0_50),
% 0.13/0.36 inference(split_clause,[status(thm)],[f124,f374,f381])).
% 0.13/0.36 fof(f521,plain,(
% 0.13/0.36 $false|~spl0_49|spl0_50),
% 0.13/0.36 inference(forward_subsumption_resolution,[status(thm)],[f383,f378])).
% 0.13/0.36 fof(f522,plain,(
% 0.13/0.36 ~spl0_49|spl0_50),
% 0.13/0.36 inference(contradiction_clause,[status(thm)],[f521])).
% 0.13/0.36 fof(f523,plain,(
% 0.13/0.36 $false|spl0_0),
% 0.13/0.36 inference(forward_subsumption_resolution,[status(thm)],[f199,f178])).
% 0.13/0.36 fof(f524,plain,(
% 0.13/0.36 spl0_0),
% 0.13/0.36 inference(contradiction_clause,[status(thm)],[f523])).
% 0.13/0.36 fof(f633,plain,(
% 0.13/0.36 $false|spl0_27),
% 0.13/0.36 inference(forward_subsumption_resolution,[status(thm)],[f299,f185])).
% 0.13/0.36 fof(f634,plain,(
% 0.13/0.36 spl0_27),
% 0.13/0.36 inference(contradiction_clause,[status(thm)],[f633])).
% 0.13/0.36 fof(f677,plain,(
% 0.13/0.36 $false|spl0_15),
% 0.13/0.36 inference(forward_subsumption_resolution,[status(thm)],[f255,f181])).
% 0.13/0.36 fof(f678,plain,(
% 0.13/0.36 spl0_15),
% 0.13/0.36 inference(contradiction_clause,[status(thm)],[f677])).
% 0.13/0.36 fof(f679,plain,(
% 0.13/0.36 ![X0,X1]: (~is_a_theorem(implies(X0,implies(X0,X1)))|is_a_theorem(implies(X0,X1))|~spl0_16|~spl0_1)),
% 0.13/0.36 inference(resolution,[status(thm)],[f257,f201])).
% 0.13/0.36 fof(f699,plain,(
% 0.13/0.36 ![X0]: (is_a_theorem(implies(X0,and(X0,X0)))|~spl0_16|~spl0_1|~spl0_28)),
% 0.13/0.36 inference(resolution,[status(thm)],[f679,f301])).
% 0.13/0.36 fof(f700,plain,(
% 0.13/0.36 spl0_49|~spl0_16|~spl0_1|~spl0_28),
% 0.13/0.36 inference(split_clause,[status(thm)],[f699,f377,f256,f200,f300])).
% 0.13/0.36 fof(f708,plain,(
% 0.13/0.36 $false|~spl0_48),
% 0.13/0.36 inference(forward_subsumption_resolution,[status(thm)],[f375,f196])).
% 0.13/0.36 fof(f709,plain,(
% 0.13/0.36 ~spl0_48),
% 0.13/0.36 inference(contradiction_clause,[status(thm)],[f708])).
% 0.20/0.59 fof(f710,plain,(
% 0.20/0.59 $false),
% 0.20/0.59 inference(sat_refutation,[status(thm)],[f203,f259,f303,f384,f522,f524,f634,f678,f700,f709])).
% 0.20/0.59 % SZS output end CNFRefutation for theBenchmark.p
% 0.20/0.59 % Elapsed time: 0.026427 seconds
% 0.20/0.59 % CPU time: 0.065149 seconds
% 0.20/0.59 % Memory used: 14.450 MB
%------------------------------------------------------------------------------