TSTP Solution File: SYN950+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SYN950+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n023.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:42 EDT 2024
% Result : Theorem 0.10s 0.33s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SYN950+1 : TPTP v8.1.2. Released v3.1.0.
% 0.06/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.32 % Computer : n023.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Mon Apr 29 22:22:25 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.10/0.33 % Drodi V3.6.0
% 0.10/0.33 % Refutation found
% 0.10/0.33 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.33 % SZS output start CNFRefutation for theBenchmark
% 0.10/0.33 fof(f1,conjecture,(
% 0.10/0.33 (! [A,B] :( (! [Y] :( q(Y)=> p(Y) ))=> (? [X] :( ( p(X)=> p(A) )& ( q(X)=> p(B) ) ) )) )),
% 0.10/0.33 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.33 fof(f2,negated_conjecture,(
% 0.10/0.33 ~((! [A,B] :( (! [Y] :( q(Y)=> p(Y) ))=> (? [X] :( ( p(X)=> p(A) )& ( q(X)=> p(B) ) ) )) ))),
% 0.10/0.33 inference(negated_conjecture,[status(cth)],[f1])).
% 0.10/0.33 fof(f3,plain,(
% 0.10/0.33 (?[A,B]: ((![Y]: (~q(Y)|p(Y)))&(![X]: ((p(X)&~p(A))|(q(X)&~p(B))))))),
% 0.10/0.33 inference(pre_NNF_transformation,[status(esa)],[f2])).
% 0.10/0.33 fof(f4,plain,(
% 0.10/0.33 ![A,X]: (pd0_0(X,A)=>(p(X)&~p(A)))),
% 0.10/0.33 introduced(predicate_definition,[f3])).
% 0.10/0.33 fof(f5,plain,(
% 0.10/0.33 ?[A,B]: ((![Y]: (~q(Y)|p(Y)))&(![X]: (pd0_0(X,A)|(q(X)&~p(B)))))),
% 0.10/0.33 inference(formula_renaming,[status(thm)],[f3,f4])).
% 0.10/0.33 fof(f6,plain,(
% 0.10/0.33 (![Y]: (~q(Y)|p(Y)))&(?[A,B]: ![X]: (pd0_0(X,A)|(q(X)&~p(B))))),
% 0.10/0.33 inference(miniscoping,[status(esa)],[f5])).
% 0.10/0.33 fof(f7,plain,(
% 0.10/0.33 (![Y]: (~q(Y)|p(Y)))&![X]: (pd0_0(X,sk0_0)|(q(X)&~p(sk0_1)))),
% 0.10/0.33 inference(skolemization,[status(esa)],[f6])).
% 0.10/0.33 fof(f8,plain,(
% 0.10/0.33 ![X0]: (~q(X0)|p(X0))),
% 0.10/0.33 inference(cnf_transformation,[status(esa)],[f7])).
% 0.10/0.33 fof(f9,plain,(
% 0.10/0.33 ![X0]: (pd0_0(X0,sk0_0)|q(X0))),
% 0.10/0.33 inference(cnf_transformation,[status(esa)],[f7])).
% 0.10/0.33 fof(f10,plain,(
% 0.10/0.33 ![X0]: (pd0_0(X0,sk0_0)|~p(sk0_1))),
% 0.10/0.33 inference(cnf_transformation,[status(esa)],[f7])).
% 0.10/0.33 fof(f11,plain,(
% 0.10/0.33 ![A,X]: (~pd0_0(X,A)|(p(X)&~p(A)))),
% 0.10/0.33 inference(pre_NNF_transformation,[status(esa)],[f4])).
% 0.10/0.33 fof(f12,plain,(
% 0.10/0.33 ![X0,X1]: (~pd0_0(X0,X1)|p(X0))),
% 0.10/0.33 inference(cnf_transformation,[status(esa)],[f11])).
% 0.10/0.33 fof(f13,plain,(
% 0.10/0.33 ![X0,X1]: (~pd0_0(X0,X1)|~p(X1))),
% 0.10/0.33 inference(cnf_transformation,[status(esa)],[f11])).
% 0.10/0.33 fof(f14,plain,(
% 0.10/0.33 spl0_0 <=> pd0_0(X0,sk0_0)),
% 0.10/0.33 introduced(split_symbol_definition)).
% 0.10/0.33 fof(f15,plain,(
% 0.10/0.33 ![X0]: (pd0_0(X0,sk0_0)|~spl0_0)),
% 0.10/0.33 inference(component_clause,[status(thm)],[f14])).
% 0.10/0.33 fof(f17,plain,(
% 0.10/0.33 spl0_1 <=> p(sk0_1)),
% 0.10/0.33 introduced(split_symbol_definition)).
% 0.10/0.33 fof(f19,plain,(
% 0.10/0.33 ~p(sk0_1)|spl0_1),
% 0.10/0.33 inference(component_clause,[status(thm)],[f17])).
% 0.10/0.33 fof(f20,plain,(
% 0.10/0.33 spl0_0|~spl0_1),
% 0.10/0.33 inference(split_clause,[status(thm)],[f10,f14,f17])).
% 0.10/0.33 fof(f21,plain,(
% 0.10/0.33 ![X0]: (q(X0)|p(X0))),
% 0.10/0.33 inference(resolution,[status(thm)],[f9,f12])).
% 0.10/0.33 fof(f22,plain,(
% 0.10/0.33 ![X0]: (p(X0))),
% 0.10/0.33 inference(forward_subsumption_resolution,[status(thm)],[f21,f8])).
% 0.10/0.33 fof(f23,plain,(
% 0.10/0.33 ![X0,X1]: (~pd0_0(X0,X1))),
% 0.10/0.33 inference(forward_subsumption_resolution,[status(thm)],[f13,f22])).
% 0.10/0.33 fof(f25,plain,(
% 0.10/0.33 $false|spl0_1),
% 0.10/0.33 inference(forward_subsumption_resolution,[status(thm)],[f19,f22])).
% 0.10/0.33 fof(f26,plain,(
% 0.10/0.33 spl0_1),
% 0.10/0.33 inference(contradiction_clause,[status(thm)],[f25])).
% 0.10/0.33 fof(f27,plain,(
% 0.10/0.33 $false|~spl0_0),
% 0.10/0.33 inference(forward_subsumption_resolution,[status(thm)],[f15,f23])).
% 0.10/0.33 fof(f28,plain,(
% 0.10/0.33 ~spl0_0),
% 0.10/0.33 inference(contradiction_clause,[status(thm)],[f27])).
% 0.10/0.33 fof(f29,plain,(
% 0.10/0.33 $false),
% 0.10/0.33 inference(sat_refutation,[status(thm)],[f20,f26,f28])).
% 0.10/0.33 % SZS output end CNFRefutation for theBenchmark.p
% 0.10/0.34 % Elapsed time: 0.012559 seconds
% 0.10/0.34 % CPU time: 0.020391 seconds
% 0.10/0.34 % Total memory used: 1.891 MB
% 0.10/0.34 % Net memory used: 1.741 MB
%------------------------------------------------------------------------------