TSTP Solution File: LCL499+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : LCL499+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n017.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:27 EDT 2023
% Result : Theorem 0.11s 0.34s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : LCL499+1 : TPTP v8.1.2. Released v3.3.0.
% 0.09/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.11/0.31 % Computer : n017.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Tue May 30 09:06:25 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.11/0.32 % Drodi V3.5.1
% 0.11/0.34 % Refutation found
% 0.11/0.34 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.11/0.34 % SZS output start CNFRefutation for theBenchmark
% 0.11/0.34 fof(f1,axiom,(
% 0.11/0.34 ( modus_ponens<=> (! [X,Y] :( ( is_a_theorem(X)& is_a_theorem(implies(X,Y)) )=> is_a_theorem(Y) ) )) ),
% 0.11/0.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.11/0.34 fof(f16,axiom,(
% 0.11/0.34 ( kn1<=> (! [P] : is_a_theorem(implies(P,and(P,P))) )) ),
% 0.11/0.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.11/0.34 fof(f22,axiom,(
% 0.11/0.34 ( r1<=> (! [P] : is_a_theorem(implies(or(P,P),P)) )) ),
% 0.11/0.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.11/0.34 fof(f24,axiom,(
% 0.11/0.34 ( r3<=> (! [P,Q] : is_a_theorem(implies(or(P,Q),or(Q,P))) )) ),
% 0.11/0.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.11/0.34 fof(f28,axiom,(
% 0.11/0.34 ( op_and=> (! [X,Y] : and(X,Y) = not(or(not(X),not(Y))) )) ),
% 0.11/0.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.11/0.34 fof(f30,axiom,(
% 0.11/0.34 ( op_implies_or=> (! [X,Y] : implies(X,Y) = or(not(X),Y) )) ),
% 0.11/0.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.11/0.34 fof(f32,axiom,(
% 0.11/0.34 op_implies_or ),
% 0.11/0.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.11/0.34 fof(f33,axiom,(
% 0.11/0.34 op_and ),
% 0.11/0.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.11/0.34 fof(f35,axiom,(
% 0.11/0.34 modus_ponens ),
% 0.11/0.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.11/0.34 fof(f36,axiom,(
% 0.11/0.34 r1 ),
% 0.11/0.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.11/0.34 fof(f38,axiom,(
% 0.11/0.34 r3 ),
% 0.11/0.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.11/0.34 fof(f45,conjecture,(
% 0.11/0.34 kn1 ),
% 0.11/0.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.11/0.34 fof(f46,negated_conjecture,(
% 0.11/0.34 ~(kn1 )),
% 0.11/0.34 inference(negated_conjecture,[status(cth)],[f45])).
% 0.11/0.34 fof(f47,plain,(
% 0.11/0.34 modus_ponens<=>(![X,Y]: ((~is_a_theorem(X)|~is_a_theorem(implies(X,Y)))|is_a_theorem(Y)))),
% 0.11/0.34 inference(pre_NNF_transformation,[status(esa)],[f1])).
% 0.11/0.34 fof(f48,plain,(
% 0.11/0.34 (~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.11/0.34 inference(NNF_transformation,[status(esa)],[f47])).
% 0.11/0.34 fof(f49,plain,(
% 0.11/0.34 (~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.11/0.34 inference(miniscoping,[status(esa)],[f48])).
% 0.11/0.34 fof(f50,plain,(
% 0.11/0.34 (~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.11/0.34 inference(skolemization,[status(esa)],[f49])).
% 0.11/0.34 fof(f51,plain,(
% 0.11/0.34 ![X0,X1]: (~modus_ponens|~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1))),
% 0.11/0.34 inference(cnf_transformation,[status(esa)],[f50])).
% 0.11/0.34 fof(f113,plain,(
% 0.11/0.34 (~kn1|(![P]: is_a_theorem(implies(P,and(P,P)))))&(kn1|(?[P]: ~is_a_theorem(implies(P,and(P,P)))))),
% 0.11/0.34 inference(NNF_transformation,[status(esa)],[f16])).
% 0.11/0.34 fof(f114,plain,(
% 0.11/0.34 (~kn1|(![P]: is_a_theorem(implies(P,and(P,P)))))&(kn1|~is_a_theorem(implies(sk0_32,and(sk0_32,sk0_32))))),
% 0.11/0.34 inference(skolemization,[status(esa)],[f113])).
% 0.11/0.34 fof(f116,plain,(
% 0.11/0.34 kn1|~is_a_theorem(implies(sk0_32,and(sk0_32,sk0_32)))),
% 0.11/0.34 inference(cnf_transformation,[status(esa)],[f114])).
% 0.11/0.34 fof(f137,plain,(
% 0.11/0.34 (~r1|(![P]: is_a_theorem(implies(or(P,P),P))))&(r1|(?[P]: ~is_a_theorem(implies(or(P,P),P))))),
% 0.11/0.34 inference(NNF_transformation,[status(esa)],[f22])).
% 0.11/0.34 fof(f138,plain,(
% 0.11/0.34 (~r1|(![P]: is_a_theorem(implies(or(P,P),P))))&(r1|~is_a_theorem(implies(or(sk0_44,sk0_44),sk0_44)))),
% 0.11/0.34 inference(skolemization,[status(esa)],[f137])).
% 0.11/0.34 fof(f139,plain,(
% 0.11/0.34 ![X0]: (~r1|is_a_theorem(implies(or(X0,X0),X0)))),
% 0.11/0.34 inference(cnf_transformation,[status(esa)],[f138])).
% 0.11/0.34 fof(f145,plain,(
% 0.11/0.34 (~r3|(![P,Q]: is_a_theorem(implies(or(P,Q),or(Q,P)))))&(r3|(?[P,Q]: ~is_a_theorem(implies(or(P,Q),or(Q,P)))))),
% 0.11/0.34 inference(NNF_transformation,[status(esa)],[f24])).
% 0.11/0.34 fof(f146,plain,(
% 0.11/0.34 (~r3|(![P,Q]: is_a_theorem(implies(or(P,Q),or(Q,P)))))&(r3|~is_a_theorem(implies(or(sk0_47,sk0_48),or(sk0_48,sk0_47))))),
% 0.11/0.34 inference(skolemization,[status(esa)],[f145])).
% 0.11/0.34 fof(f147,plain,(
% 0.11/0.34 ![X0,X1]: (~r3|is_a_theorem(implies(or(X0,X1),or(X1,X0))))),
% 0.11/0.34 inference(cnf_transformation,[status(esa)],[f146])).
% 0.11/0.34 fof(f159,plain,(
% 0.11/0.34 ~op_and|(![X,Y]: and(X,Y)=not(or(not(X),not(Y))))),
% 0.11/0.34 inference(pre_NNF_transformation,[status(esa)],[f28])).
% 0.11/0.34 fof(f160,plain,(
% 0.11/0.34 ![X0,X1]: (~op_and|and(X0,X1)=not(or(not(X0),not(X1))))),
% 0.11/0.34 inference(cnf_transformation,[status(esa)],[f159])).
% 0.11/0.34 fof(f163,plain,(
% 0.11/0.34 ~op_implies_or|(![X,Y]: implies(X,Y)=or(not(X),Y))),
% 0.11/0.34 inference(pre_NNF_transformation,[status(esa)],[f30])).
% 0.11/0.34 fof(f164,plain,(
% 0.11/0.34 ![X0,X1]: (~op_implies_or|implies(X0,X1)=or(not(X0),X1))),
% 0.11/0.34 inference(cnf_transformation,[status(esa)],[f163])).
% 0.11/0.34 fof(f167,plain,(
% 0.11/0.34 op_implies_or),
% 0.11/0.34 inference(cnf_transformation,[status(esa)],[f32])).
% 0.11/0.34 fof(f168,plain,(
% 0.11/0.34 op_and),
% 0.11/0.34 inference(cnf_transformation,[status(esa)],[f33])).
% 0.11/0.34 fof(f170,plain,(
% 0.11/0.34 modus_ponens),
% 0.11/0.34 inference(cnf_transformation,[status(esa)],[f35])).
% 0.11/0.34 fof(f171,plain,(
% 0.11/0.34 r1),
% 0.11/0.34 inference(cnf_transformation,[status(esa)],[f36])).
% 0.11/0.34 fof(f173,plain,(
% 0.11/0.34 r3),
% 0.11/0.34 inference(cnf_transformation,[status(esa)],[f38])).
% 0.11/0.34 fof(f180,plain,(
% 0.11/0.34 ~kn1),
% 0.11/0.34 inference(cnf_transformation,[status(esa)],[f46])).
% 0.11/0.34 fof(f181,plain,(
% 0.11/0.34 spl0_0 <=> modus_ponens),
% 0.11/0.34 introduced(split_symbol_definition)).
% 0.11/0.34 fof(f183,plain,(
% 0.11/0.34 ~modus_ponens|spl0_0),
% 0.11/0.34 inference(component_clause,[status(thm)],[f181])).
% 0.11/0.34 fof(f184,plain,(
% 0.11/0.34 spl0_1 <=> ~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1)),
% 0.11/0.34 introduced(split_symbol_definition)).
% 0.11/0.34 fof(f185,plain,(
% 0.11/0.34 ![X0,X1]: (~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1)|~spl0_1)),
% 0.11/0.34 inference(component_clause,[status(thm)],[f184])).
% 0.11/0.34 fof(f187,plain,(
% 0.11/0.34 ~spl0_0|spl0_1),
% 0.11/0.34 inference(split_clause,[status(thm)],[f51,f181,f184])).
% 0.11/0.34 fof(f358,plain,(
% 0.11/0.34 spl0_48 <=> kn1),
% 0.11/0.34 introduced(split_symbol_definition)).
% 0.11/0.34 fof(f359,plain,(
% 0.11/0.34 kn1|~spl0_48),
% 0.11/0.34 inference(component_clause,[status(thm)],[f358])).
% 0.11/0.34 fof(f361,plain,(
% 0.11/0.34 spl0_49 <=> is_a_theorem(implies(X0,and(X0,X0)))),
% 0.11/0.34 introduced(split_symbol_definition)).
% 0.11/0.34 fof(f362,plain,(
% 0.11/0.34 ![X0]: (is_a_theorem(implies(X0,and(X0,X0)))|~spl0_49)),
% 0.11/0.34 inference(component_clause,[status(thm)],[f361])).
% 0.11/0.34 fof(f365,plain,(
% 0.11/0.34 spl0_50 <=> is_a_theorem(implies(sk0_32,and(sk0_32,sk0_32)))),
% 0.11/0.34 introduced(split_symbol_definition)).
% 0.11/0.34 fof(f367,plain,(
% 0.11/0.34 ~is_a_theorem(implies(sk0_32,and(sk0_32,sk0_32)))|spl0_50),
% 0.11/0.34 inference(component_clause,[status(thm)],[f365])).
% 0.11/0.34 fof(f368,plain,(
% 0.11/0.34 spl0_48|~spl0_50),
% 0.11/0.34 inference(split_clause,[status(thm)],[f116,f358,f365])).
% 0.11/0.34 fof(f418,plain,(
% 0.11/0.34 spl0_64 <=> r1),
% 0.11/0.34 introduced(split_symbol_definition)).
% 0.11/0.34 fof(f420,plain,(
% 0.11/0.34 ~r1|spl0_64),
% 0.11/0.34 inference(component_clause,[status(thm)],[f418])).
% 0.11/0.34 fof(f421,plain,(
% 0.11/0.34 spl0_65 <=> is_a_theorem(implies(or(X0,X0),X0))),
% 0.11/0.34 introduced(split_symbol_definition)).
% 0.11/0.34 fof(f422,plain,(
% 0.11/0.34 ![X0]: (is_a_theorem(implies(or(X0,X0),X0))|~spl0_65)),
% 0.11/0.34 inference(component_clause,[status(thm)],[f421])).
% 0.11/0.34 fof(f424,plain,(
% 0.11/0.34 ~spl0_64|spl0_65),
% 0.11/0.34 inference(split_clause,[status(thm)],[f139,f418,f421])).
% 0.11/0.34 fof(f437,plain,(
% 0.11/0.34 spl0_69 <=> r3),
% 0.11/0.34 introduced(split_symbol_definition)).
% 0.11/0.34 fof(f439,plain,(
% 0.11/0.34 ~r3|spl0_69),
% 0.11/0.34 inference(component_clause,[status(thm)],[f437])).
% 0.11/0.34 fof(f440,plain,(
% 0.11/0.34 spl0_70 <=> is_a_theorem(implies(or(X0,X1),or(X1,X0)))),
% 0.11/0.34 introduced(split_symbol_definition)).
% 0.11/0.34 fof(f441,plain,(
% 0.11/0.34 ![X0,X1]: (is_a_theorem(implies(or(X0,X1),or(X1,X0)))|~spl0_70)),
% 0.11/0.34 inference(component_clause,[status(thm)],[f440])).
% 0.11/0.34 fof(f443,plain,(
% 0.11/0.34 ~spl0_69|spl0_70),
% 0.11/0.34 inference(split_clause,[status(thm)],[f147,f437,f440])).
% 0.11/0.34 fof(f477,plain,(
% 0.11/0.34 spl0_80 <=> op_and),
% 0.11/0.34 introduced(split_symbol_definition)).
% 0.11/0.34 fof(f479,plain,(
% 0.11/0.34 ~op_and|spl0_80),
% 0.11/0.34 inference(component_clause,[status(thm)],[f477])).
% 0.11/0.34 fof(f480,plain,(
% 0.11/0.34 spl0_81 <=> and(X0,X1)=not(or(not(X0),not(X1)))),
% 0.11/0.34 introduced(split_symbol_definition)).
% 0.11/0.34 fof(f481,plain,(
% 0.11/0.34 ![X0,X1]: (and(X0,X1)=not(or(not(X0),not(X1)))|~spl0_81)),
% 0.11/0.34 inference(component_clause,[status(thm)],[f480])).
% 0.11/0.34 fof(f483,plain,(
% 0.11/0.34 ~spl0_80|spl0_81),
% 0.11/0.34 inference(split_clause,[status(thm)],[f160,f477,f480])).
% 0.11/0.34 fof(f491,plain,(
% 0.11/0.34 spl0_84 <=> op_implies_or),
% 0.11/0.34 introduced(split_symbol_definition)).
% 0.11/0.34 fof(f493,plain,(
% 0.11/0.34 ~op_implies_or|spl0_84),
% 0.25/0.61 inference(component_clause,[status(thm)],[f491])).
% 0.25/0.61 fof(f494,plain,(
% 0.25/0.61 spl0_85 <=> implies(X0,X1)=or(not(X0),X1)),
% 0.25/0.61 introduced(split_symbol_definition)).
% 0.25/0.61 fof(f495,plain,(
% 0.25/0.61 ![X0,X1]: (implies(X0,X1)=or(not(X0),X1)|~spl0_85)),
% 0.25/0.61 inference(component_clause,[status(thm)],[f494])).
% 0.25/0.61 fof(f497,plain,(
% 0.25/0.61 ~spl0_84|spl0_85),
% 0.25/0.61 inference(split_clause,[status(thm)],[f164,f491,f494])).
% 0.25/0.61 fof(f505,plain,(
% 0.25/0.61 $false|~spl0_49|spl0_50),
% 0.25/0.61 inference(forward_subsumption_resolution,[status(thm)],[f367,f362])).
% 0.25/0.61 fof(f506,plain,(
% 0.25/0.61 ~spl0_49|spl0_50),
% 0.25/0.61 inference(contradiction_clause,[status(thm)],[f505])).
% 0.25/0.61 fof(f507,plain,(
% 0.25/0.61 $false|spl0_0),
% 0.25/0.61 inference(forward_subsumption_resolution,[status(thm)],[f183,f170])).
% 0.25/0.61 fof(f508,plain,(
% 0.25/0.61 spl0_0),
% 0.25/0.61 inference(contradiction_clause,[status(thm)],[f507])).
% 0.25/0.61 fof(f513,plain,(
% 0.25/0.61 $false|spl0_84),
% 0.25/0.61 inference(forward_subsumption_resolution,[status(thm)],[f493,f167])).
% 0.25/0.61 fof(f514,plain,(
% 0.25/0.61 spl0_84),
% 0.25/0.61 inference(contradiction_clause,[status(thm)],[f513])).
% 0.25/0.61 fof(f517,plain,(
% 0.25/0.61 $false|spl0_80),
% 0.25/0.61 inference(forward_subsumption_resolution,[status(thm)],[f479,f168])).
% 0.25/0.61 fof(f518,plain,(
% 0.25/0.61 spl0_80),
% 0.25/0.61 inference(contradiction_clause,[status(thm)],[f517])).
% 0.25/0.61 fof(f522,plain,(
% 0.25/0.61 ![X0]: (is_a_theorem(implies(implies(X0,not(X0)),not(X0)))|~spl0_65|~spl0_85)),
% 0.25/0.61 inference(paramodulation,[status(thm)],[f495,f422])).
% 0.25/0.61 fof(f529,plain,(
% 0.25/0.61 $false|spl0_64),
% 0.25/0.61 inference(forward_subsumption_resolution,[status(thm)],[f420,f171])).
% 0.25/0.61 fof(f530,plain,(
% 0.25/0.61 spl0_64),
% 0.25/0.61 inference(contradiction_clause,[status(thm)],[f529])).
% 0.25/0.61 fof(f554,plain,(
% 0.25/0.61 $false|spl0_69),
% 0.25/0.61 inference(forward_subsumption_resolution,[status(thm)],[f439,f173])).
% 0.25/0.61 fof(f555,plain,(
% 0.25/0.61 spl0_69),
% 0.25/0.61 inference(contradiction_clause,[status(thm)],[f554])).
% 0.25/0.61 fof(f593,plain,(
% 0.25/0.61 ![X0,X1]: (~is_a_theorem(or(X0,X1))|is_a_theorem(or(X1,X0))|~spl0_70|~spl0_1)),
% 0.25/0.61 inference(resolution,[status(thm)],[f441,f185])).
% 0.25/0.61 fof(f620,plain,(
% 0.25/0.61 ![X0,X1]: (and(X0,X1)=not(implies(X0,not(X1)))|~spl0_85|~spl0_81)),
% 0.25/0.61 inference(forward_demodulation,[status(thm)],[f495,f481])).
% 0.25/0.61 fof(f631,plain,(
% 0.25/0.61 ![X0,X1,X2]: (implies(implies(X0,not(X1)),X2)=or(and(X0,X1),X2)|~spl0_85|~spl0_81)),
% 0.25/0.61 inference(paramodulation,[status(thm)],[f620,f495])).
% 0.25/0.61 fof(f780,plain,(
% 0.25/0.61 ![X0,X1]: (~is_a_theorem(or(X0,not(X1)))|is_a_theorem(implies(X1,X0))|~spl0_70|~spl0_1|~spl0_85)),
% 0.25/0.61 inference(paramodulation,[status(thm)],[f495,f593])).
% 0.25/0.61 fof(f1014,plain,(
% 0.25/0.61 ![X0]: (is_a_theorem(or(and(X0,X0),not(X0)))|~spl0_81|~spl0_65|~spl0_85)),
% 0.25/0.61 inference(backward_demodulation,[status(thm)],[f631,f522])).
% 0.25/0.61 fof(f1043,plain,(
% 0.25/0.61 ![X0]: (is_a_theorem(implies(X0,and(X0,X0)))|~spl0_81|~spl0_65|~spl0_70|~spl0_1|~spl0_85)),
% 0.25/0.61 inference(resolution,[status(thm)],[f1014,f780])).
% 0.25/0.61 fof(f1044,plain,(
% 0.25/0.61 spl0_49|~spl0_81|~spl0_65|~spl0_70|~spl0_1|~spl0_85),
% 0.25/0.61 inference(split_clause,[status(thm)],[f1043,f361,f480,f421,f440,f184,f494])).
% 0.25/0.61 fof(f1050,plain,(
% 0.25/0.61 $false|~spl0_48),
% 0.25/0.61 inference(forward_subsumption_resolution,[status(thm)],[f359,f180])).
% 0.25/0.61 fof(f1051,plain,(
% 0.25/0.61 ~spl0_48),
% 0.25/0.61 inference(contradiction_clause,[status(thm)],[f1050])).
% 0.25/0.61 fof(f1052,plain,(
% 0.25/0.61 $false),
% 0.25/0.61 inference(sat_refutation,[status(thm)],[f187,f368,f424,f443,f483,f497,f506,f508,f514,f518,f530,f555,f1044,f1051])).
% 0.25/0.61 % SZS output end CNFRefutation for theBenchmark.p
% 0.25/0.61 % Elapsed time: 0.070147 seconds
% 0.25/0.61 % CPU time: 0.031500 seconds
% 0.25/0.61 % Memory used: 3.576 MB
%------------------------------------------------------------------------------