TSTP Solution File: LCL452+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : LCL452+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n005.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:21 EDT 2023
% Result : Theorem 0.13s 0.35s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL452+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.33 % Computer : n005.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue May 30 09:47:36 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.13/0.34 % Drodi V3.5.1
% 0.13/0.35 % Refutation found
% 0.13/0.35 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.35 % SZS output start CNFRefutation for theBenchmark
% 0.13/0.35 fof(f10,axiom,(
% 0.13/0.35 ( or_1<=> (! [X,Y] : is_a_theorem(implies(X,or(X,Y))) )) ),
% 0.13/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.35 fof(f20,axiom,(
% 0.13/0.35 ( cn2<=> (! [P,Q] : is_a_theorem(implies(P,implies(not(P),Q))) )) ),
% 0.13/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.35 fof(f27,axiom,(
% 0.13/0.35 ( op_or=> (! [X,Y] : or(X,Y) = not(and(not(X),not(Y))) )) ),
% 0.13/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.35 fof(f29,axiom,(
% 0.13/0.35 ( op_implies_and=> (! [X,Y] : implies(X,Y) = not(and(X,not(Y))) )) ),
% 0.13/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.35 fof(f32,axiom,(
% 0.13/0.35 op_or ),
% 0.13/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.35 fof(f33,axiom,(
% 0.13/0.35 op_implies_and ),
% 0.13/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.35 fof(f43,axiom,(
% 0.13/0.35 or_1 ),
% 0.13/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.35 fof(f53,conjecture,(
% 0.13/0.35 cn2 ),
% 0.13/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.13/0.35 fof(f54,negated_conjecture,(
% 0.13/0.35 ~(cn2 )),
% 0.13/0.35 inference(negated_conjecture,[status(cth)],[f53])).
% 0.13/0.35 fof(f97,plain,(
% 0.13/0.35 (~or_1|(![X,Y]: is_a_theorem(implies(X,or(X,Y)))))&(or_1|(?[X,Y]: ~is_a_theorem(implies(X,or(X,Y)))))),
% 0.13/0.35 inference(NNF_transformation,[status(esa)],[f10])).
% 0.13/0.35 fof(f98,plain,(
% 0.13/0.35 (~or_1|(![X,Y]: is_a_theorem(implies(X,or(X,Y)))))&(or_1|~is_a_theorem(implies(sk0_19,or(sk0_19,sk0_20))))),
% 0.13/0.35 inference(skolemization,[status(esa)],[f97])).
% 0.13/0.35 fof(f99,plain,(
% 0.13/0.35 ![X0,X1]: (~or_1|is_a_theorem(implies(X0,or(X0,X1))))),
% 0.13/0.35 inference(cnf_transformation,[status(esa)],[f98])).
% 0.13/0.35 fof(f137,plain,(
% 0.13/0.35 (~cn2|(![P,Q]: is_a_theorem(implies(P,implies(not(P),Q)))))&(cn2|(?[P,Q]: ~is_a_theorem(implies(P,implies(not(P),Q)))))),
% 0.13/0.35 inference(NNF_transformation,[status(esa)],[f20])).
% 0.13/0.35 fof(f138,plain,(
% 0.13/0.35 (~cn2|(![P,Q]: is_a_theorem(implies(P,implies(not(P),Q)))))&(cn2|~is_a_theorem(implies(sk0_41,implies(not(sk0_41),sk0_42))))),
% 0.13/0.35 inference(skolemization,[status(esa)],[f137])).
% 0.13/0.35 fof(f140,plain,(
% 0.13/0.35 cn2|~is_a_theorem(implies(sk0_41,implies(not(sk0_41),sk0_42)))),
% 0.13/0.35 inference(cnf_transformation,[status(esa)],[f138])).
% 0.13/0.35 fof(f165,plain,(
% 0.13/0.35 ~op_or|(![X,Y]: or(X,Y)=not(and(not(X),not(Y))))),
% 0.13/0.35 inference(pre_NNF_transformation,[status(esa)],[f27])).
% 0.13/0.35 fof(f166,plain,(
% 0.13/0.35 ![X0,X1]: (~op_or|or(X0,X1)=not(and(not(X0),not(X1))))),
% 0.13/0.35 inference(cnf_transformation,[status(esa)],[f165])).
% 0.13/0.35 fof(f169,plain,(
% 0.13/0.35 ~op_implies_and|(![X,Y]: implies(X,Y)=not(and(X,not(Y))))),
% 0.13/0.35 inference(pre_NNF_transformation,[status(esa)],[f29])).
% 0.13/0.35 fof(f170,plain,(
% 0.13/0.35 ![X0,X1]: (~op_implies_and|implies(X0,X1)=not(and(X0,not(X1))))),
% 0.13/0.35 inference(cnf_transformation,[status(esa)],[f169])).
% 0.13/0.35 fof(f175,plain,(
% 0.13/0.35 op_or),
% 0.13/0.35 inference(cnf_transformation,[status(esa)],[f32])).
% 0.13/0.35 fof(f176,plain,(
% 0.13/0.35 op_implies_and),
% 0.13/0.35 inference(cnf_transformation,[status(esa)],[f33])).
% 0.13/0.35 fof(f186,plain,(
% 0.13/0.35 or_1),
% 0.13/0.35 inference(cnf_transformation,[status(esa)],[f43])).
% 0.13/0.35 fof(f196,plain,(
% 0.13/0.35 ~cn2),
% 0.13/0.35 inference(cnf_transformation,[status(esa)],[f54])).
% 0.13/0.35 fof(f308,plain,(
% 0.13/0.35 spl0_30 <=> or_1),
% 0.13/0.35 introduced(split_symbol_definition)).
% 0.13/0.35 fof(f310,plain,(
% 0.13/0.35 ~or_1|spl0_30),
% 0.13/0.35 inference(component_clause,[status(thm)],[f308])).
% 0.13/0.35 fof(f311,plain,(
% 0.13/0.35 spl0_31 <=> is_a_theorem(implies(X0,or(X0,X1)))),
% 0.13/0.35 introduced(split_symbol_definition)).
% 0.13/0.35 fof(f312,plain,(
% 0.13/0.35 ![X0,X1]: (is_a_theorem(implies(X0,or(X0,X1)))|~spl0_31)),
% 0.13/0.35 inference(component_clause,[status(thm)],[f311])).
% 0.13/0.35 fof(f314,plain,(
% 0.13/0.35 ~spl0_30|spl0_31),
% 0.13/0.35 inference(split_clause,[status(thm)],[f99,f308,f311])).
% 0.13/0.35 fof(f412,plain,(
% 0.13/0.35 spl0_58 <=> cn2),
% 0.13/0.35 introduced(split_symbol_definition)).
% 0.13/0.35 fof(f413,plain,(
% 0.13/0.35 cn2|~spl0_58),
% 0.13/0.35 inference(component_clause,[status(thm)],[f412])).
% 0.13/0.35 fof(f419,plain,(
% 0.13/0.35 spl0_60 <=> is_a_theorem(implies(sk0_41,implies(not(sk0_41),sk0_42)))),
% 0.13/0.35 introduced(split_symbol_definition)).
% 0.13/0.35 fof(f421,plain,(
% 0.13/0.35 ~is_a_theorem(implies(sk0_41,implies(not(sk0_41),sk0_42)))|spl0_60),
% 0.13/0.35 inference(component_clause,[status(thm)],[f419])).
% 0.13/0.35 fof(f422,plain,(
% 0.13/0.35 spl0_58|~spl0_60),
% 0.13/0.35 inference(split_clause,[status(thm)],[f140,f412,f419])).
% 0.13/0.35 fof(f486,plain,(
% 0.13/0.36 spl0_78 <=> op_or),
% 0.13/0.36 introduced(split_symbol_definition)).
% 0.13/0.36 fof(f488,plain,(
% 0.13/0.36 ~op_or|spl0_78),
% 0.13/0.36 inference(component_clause,[status(thm)],[f486])).
% 0.13/0.36 fof(f489,plain,(
% 0.13/0.36 spl0_79 <=> or(X0,X1)=not(and(not(X0),not(X1)))),
% 0.13/0.36 introduced(split_symbol_definition)).
% 0.13/0.36 fof(f490,plain,(
% 0.13/0.36 ![X0,X1]: (or(X0,X1)=not(and(not(X0),not(X1)))|~spl0_79)),
% 0.13/0.36 inference(component_clause,[status(thm)],[f489])).
% 0.13/0.36 fof(f492,plain,(
% 0.13/0.36 ~spl0_78|spl0_79),
% 0.13/0.36 inference(split_clause,[status(thm)],[f166,f486,f489])).
% 0.13/0.36 fof(f500,plain,(
% 0.13/0.36 spl0_82 <=> op_implies_and),
% 0.13/0.36 introduced(split_symbol_definition)).
% 0.13/0.36 fof(f502,plain,(
% 0.13/0.36 ~op_implies_and|spl0_82),
% 0.13/0.36 inference(component_clause,[status(thm)],[f500])).
% 0.13/0.36 fof(f503,plain,(
% 0.13/0.36 spl0_83 <=> implies(X0,X1)=not(and(X0,not(X1)))),
% 0.13/0.36 introduced(split_symbol_definition)).
% 0.13/0.36 fof(f504,plain,(
% 0.13/0.36 ![X0,X1]: (implies(X0,X1)=not(and(X0,not(X1)))|~spl0_83)),
% 0.13/0.36 inference(component_clause,[status(thm)],[f503])).
% 0.13/0.36 fof(f506,plain,(
% 0.13/0.36 ~spl0_82|spl0_83),
% 0.13/0.36 inference(split_clause,[status(thm)],[f170,f500,f503])).
% 0.13/0.36 fof(f523,plain,(
% 0.13/0.36 $false|spl0_82),
% 0.13/0.36 inference(forward_subsumption_resolution,[status(thm)],[f502,f176])).
% 0.13/0.36 fof(f524,plain,(
% 0.13/0.36 spl0_82),
% 0.13/0.36 inference(contradiction_clause,[status(thm)],[f523])).
% 0.13/0.36 fof(f525,plain,(
% 0.13/0.36 $false|spl0_78),
% 0.13/0.36 inference(forward_subsumption_resolution,[status(thm)],[f488,f175])).
% 0.13/0.36 fof(f526,plain,(
% 0.13/0.36 spl0_78),
% 0.13/0.36 inference(contradiction_clause,[status(thm)],[f525])).
% 0.13/0.36 fof(f587,plain,(
% 0.13/0.36 $false|spl0_30),
% 0.13/0.36 inference(forward_subsumption_resolution,[status(thm)],[f310,f186])).
% 0.13/0.36 fof(f588,plain,(
% 0.13/0.36 spl0_30),
% 0.13/0.36 inference(contradiction_clause,[status(thm)],[f587])).
% 0.13/0.36 fof(f606,plain,(
% 0.13/0.36 ![X0,X1]: (or(X0,X1)=implies(not(X0),X1)|~spl0_79|~spl0_83)),
% 0.13/0.36 inference(paramodulation,[status(thm)],[f504,f490])).
% 0.13/0.36 fof(f663,plain,(
% 0.13/0.36 ~is_a_theorem(implies(sk0_41,or(sk0_41,sk0_42)))|spl0_60|~spl0_79|~spl0_83),
% 0.13/0.36 inference(paramodulation,[status(thm)],[f606,f421])).
% 0.13/0.36 fof(f664,plain,(
% 0.13/0.36 $false|~spl0_31|spl0_60|~spl0_79|~spl0_83),
% 0.13/0.36 inference(forward_subsumption_resolution,[status(thm)],[f663,f312])).
% 0.13/0.36 fof(f665,plain,(
% 0.13/0.36 ~spl0_31|spl0_60|~spl0_79|~spl0_83),
% 0.13/0.36 inference(contradiction_clause,[status(thm)],[f664])).
% 0.13/0.36 fof(f666,plain,(
% 0.13/0.36 $false|~spl0_58),
% 0.13/0.36 inference(forward_subsumption_resolution,[status(thm)],[f413,f196])).
% 0.13/0.36 fof(f667,plain,(
% 0.13/0.36 ~spl0_58),
% 0.13/0.36 inference(contradiction_clause,[status(thm)],[f666])).
% 0.13/0.36 fof(f668,plain,(
% 0.13/0.36 $false),
% 0.13/0.36 inference(sat_refutation,[status(thm)],[f314,f422,f492,f506,f524,f526,f588,f665,f667])).
% 0.13/0.36 % SZS output end CNFRefutation for theBenchmark.p
% 0.19/0.58 % Elapsed time: 0.021464 seconds
% 0.19/0.58 % CPU time: 0.058551 seconds
% 0.19/0.58 % Memory used: 12.807 MB
%------------------------------------------------------------------------------