TSTP Solution File: SYN922+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SYN922+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n027.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 : Tue Apr 30 20:53:38 EDT 2024
% Result : Theorem 0.21s 0.37s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYN922+1 : TPTP v8.1.2. Released v3.1.0.
% 0.14/0.14 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.21/0.35 % WCLimit : 300
% 0.21/0.35 % DateTime : Mon Apr 29 22:29:32 EDT 2024
% 0.21/0.35 % CPUTime :
% 0.21/0.37 % Drodi V3.6.0
% 0.21/0.37 % Refutation found
% 0.21/0.37 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.21/0.37 % SZS output start CNFRefutation for theBenchmark
% 0.21/0.37 fof(f1,conjecture,(
% 0.21/0.37 ( (! [X] :( p(X)& q(X) ))<=> ( (! [X] : p(X))& (! [X] : q(X) )) ) ),
% 0.21/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.21/0.37 fof(f2,negated_conjecture,(
% 0.21/0.37 ~(( (! [X] :( p(X)& q(X) ))<=> ( (! [X] : p(X))& (! [X] : q(X) )) ) )),
% 0.21/0.37 inference(negated_conjecture,[status(cth)],[f1])).
% 0.21/0.37 fof(f3,plain,(
% 0.21/0.37 ((![X]: (p(X)&q(X)))<~>((![X]: p(X))&(![X]: q(X))))),
% 0.21/0.37 inference(pre_NNF_transformation,[status(esa)],[f2])).
% 0.21/0.37 fof(f4,plain,(
% 0.21/0.37 pd0_0<=>((![X]: p(X))&(![X]: q(X)))),
% 0.21/0.37 introduced(predicate_definition,[f3])).
% 0.21/0.37 fof(f5,plain,(
% 0.21/0.37 (![X]: (p(X)&q(X)))<~>pd0_0),
% 0.21/0.37 inference(formula_renaming,[status(thm)],[f3,f4])).
% 0.21/0.37 fof(f6,plain,(
% 0.21/0.37 ((![X]: (p(X)&q(X)))|pd0_0)&((?[X]: (~p(X)|~q(X)))|~pd0_0)),
% 0.21/0.37 inference(NNF_transformation,[status(esa)],[f5])).
% 0.21/0.37 fof(f7,plain,(
% 0.21/0.37 (((![X]: p(X))&(![X]: q(X)))|pd0_0)&(((?[X]: ~p(X))|(?[X]: ~q(X)))|~pd0_0)),
% 0.21/0.37 inference(miniscoping,[status(esa)],[f6])).
% 0.21/0.37 fof(f8,plain,(
% 0.21/0.37 (((![X]: p(X))&(![X]: q(X)))|pd0_0)&((~p(sk0_0)|~q(sk0_1))|~pd0_0)),
% 0.21/0.37 inference(skolemization,[status(esa)],[f7])).
% 0.21/0.37 fof(f9,plain,(
% 0.21/0.37 ![X0]: (p(X0)|pd0_0)),
% 0.21/0.37 inference(cnf_transformation,[status(esa)],[f8])).
% 0.21/0.37 fof(f10,plain,(
% 0.21/0.37 ![X0]: (q(X0)|pd0_0)),
% 0.21/0.37 inference(cnf_transformation,[status(esa)],[f8])).
% 0.21/0.37 fof(f11,plain,(
% 0.21/0.37 ~p(sk0_0)|~q(sk0_1)|~pd0_0),
% 0.21/0.37 inference(cnf_transformation,[status(esa)],[f8])).
% 0.21/0.37 fof(f12,plain,(
% 0.21/0.37 (~pd0_0|((![X]: p(X))&(![X]: q(X))))&(pd0_0|((?[X]: ~p(X))|(?[X]: ~q(X))))),
% 0.21/0.37 inference(NNF_transformation,[status(esa)],[f4])).
% 0.21/0.37 fof(f13,plain,(
% 0.21/0.37 (~pd0_0|((![X]: p(X))&(![X]: q(X))))&(pd0_0|(~p(sk0_2)|~q(sk0_3)))),
% 0.21/0.37 inference(skolemization,[status(esa)],[f12])).
% 0.21/0.37 fof(f14,plain,(
% 0.21/0.37 ![X0]: (~pd0_0|p(X0))),
% 0.21/0.37 inference(cnf_transformation,[status(esa)],[f13])).
% 0.21/0.37 fof(f15,plain,(
% 0.21/0.37 ![X0]: (~pd0_0|q(X0))),
% 0.21/0.37 inference(cnf_transformation,[status(esa)],[f13])).
% 0.21/0.37 fof(f16,plain,(
% 0.21/0.37 pd0_0|~p(sk0_2)|~q(sk0_3)),
% 0.21/0.37 inference(cnf_transformation,[status(esa)],[f13])).
% 0.21/0.37 fof(f17,plain,(
% 0.21/0.37 spl0_0 <=> p(X0)),
% 0.21/0.37 introduced(split_symbol_definition)).
% 0.21/0.37 fof(f18,plain,(
% 0.21/0.37 ![X0]: (p(X0)|~spl0_0)),
% 0.21/0.37 inference(component_clause,[status(thm)],[f17])).
% 0.21/0.37 fof(f20,plain,(
% 0.21/0.37 spl0_1 <=> pd0_0),
% 0.21/0.37 introduced(split_symbol_definition)).
% 0.21/0.37 fof(f23,plain,(
% 0.21/0.37 spl0_0|spl0_1),
% 0.21/0.37 inference(split_clause,[status(thm)],[f9,f17,f20])).
% 0.21/0.37 fof(f24,plain,(
% 0.21/0.37 spl0_2 <=> q(X0)),
% 0.21/0.37 introduced(split_symbol_definition)).
% 0.21/0.37 fof(f25,plain,(
% 0.21/0.37 ![X0]: (q(X0)|~spl0_2)),
% 0.21/0.37 inference(component_clause,[status(thm)],[f24])).
% 0.21/0.37 fof(f27,plain,(
% 0.21/0.37 spl0_2|spl0_1),
% 0.21/0.37 inference(split_clause,[status(thm)],[f10,f24,f20])).
% 0.21/0.37 fof(f28,plain,(
% 0.21/0.37 spl0_3 <=> p(sk0_0)),
% 0.21/0.37 introduced(split_symbol_definition)).
% 0.21/0.37 fof(f30,plain,(
% 0.21/0.37 ~p(sk0_0)|spl0_3),
% 0.21/0.37 inference(component_clause,[status(thm)],[f28])).
% 0.21/0.37 fof(f31,plain,(
% 0.21/0.37 spl0_4 <=> q(sk0_1)),
% 0.21/0.37 introduced(split_symbol_definition)).
% 0.21/0.37 fof(f33,plain,(
% 0.21/0.37 ~q(sk0_1)|spl0_4),
% 0.21/0.37 inference(component_clause,[status(thm)],[f31])).
% 0.21/0.37 fof(f34,plain,(
% 0.21/0.37 ~spl0_3|~spl0_4|~spl0_1),
% 0.21/0.37 inference(split_clause,[status(thm)],[f11,f28,f31,f20])).
% 0.21/0.37 fof(f35,plain,(
% 0.21/0.37 ~spl0_1|spl0_0),
% 0.21/0.37 inference(split_clause,[status(thm)],[f14,f20,f17])).
% 0.21/0.37 fof(f36,plain,(
% 0.21/0.37 ~spl0_1|spl0_2),
% 0.21/0.37 inference(split_clause,[status(thm)],[f15,f20,f24])).
% 0.21/0.37 fof(f37,plain,(
% 0.21/0.37 spl0_5 <=> p(sk0_2)),
% 0.21/0.37 introduced(split_symbol_definition)).
% 0.21/0.37 fof(f39,plain,(
% 0.21/0.37 ~p(sk0_2)|spl0_5),
% 0.21/0.37 inference(component_clause,[status(thm)],[f37])).
% 0.21/0.37 fof(f40,plain,(
% 0.21/0.37 spl0_6 <=> q(sk0_3)),
% 0.21/0.37 introduced(split_symbol_definition)).
% 0.21/0.37 fof(f42,plain,(
% 0.21/0.37 ~q(sk0_3)|spl0_6),
% 0.21/0.37 inference(component_clause,[status(thm)],[f40])).
% 0.21/0.37 fof(f43,plain,(
% 0.21/0.37 spl0_1|~spl0_5|~spl0_6),
% 0.21/0.37 inference(split_clause,[status(thm)],[f16,f20,f37,f40])).
% 0.21/0.37 fof(f44,plain,(
% 0.21/0.37 $false|~spl0_2|spl0_6),
% 0.21/0.37 inference(forward_subsumption_resolution,[status(thm)],[f42,f25])).
% 0.21/0.37 fof(f45,plain,(
% 0.21/0.37 ~spl0_2|spl0_6),
% 0.21/0.37 inference(contradiction_clause,[status(thm)],[f44])).
% 0.21/0.37 fof(f46,plain,(
% 0.21/0.37 $false|~spl0_0|spl0_5),
% 0.21/0.37 inference(forward_subsumption_resolution,[status(thm)],[f39,f18])).
% 0.21/0.37 fof(f47,plain,(
% 0.21/0.37 ~spl0_0|spl0_5),
% 0.21/0.37 inference(contradiction_clause,[status(thm)],[f46])).
% 0.21/0.38 fof(f48,plain,(
% 0.21/0.38 $false|~spl0_0|spl0_3),
% 0.21/0.38 inference(forward_subsumption_resolution,[status(thm)],[f30,f18])).
% 0.21/0.38 fof(f49,plain,(
% 0.21/0.38 ~spl0_0|spl0_3),
% 0.21/0.38 inference(contradiction_clause,[status(thm)],[f48])).
% 0.21/0.38 fof(f50,plain,(
% 0.21/0.38 $false|~spl0_2|spl0_4),
% 0.21/0.38 inference(forward_subsumption_resolution,[status(thm)],[f33,f25])).
% 0.21/0.38 fof(f51,plain,(
% 0.21/0.38 ~spl0_2|spl0_4),
% 0.21/0.38 inference(contradiction_clause,[status(thm)],[f50])).
% 0.21/0.38 fof(f52,plain,(
% 0.21/0.38 $false),
% 0.21/0.38 inference(sat_refutation,[status(thm)],[f23,f27,f34,f35,f36,f43,f45,f47,f49,f51])).
% 0.21/0.38 % SZS output end CNFRefutation for theBenchmark.p
% 0.21/0.40 % Elapsed time: 0.023330 seconds
% 0.21/0.40 % CPU time: 0.034631 seconds
% 0.21/0.40 % Total memory used: 1.631 MB
% 0.21/0.40 % Net memory used: 1.510 MB
%------------------------------------------------------------------------------