TSTP Solution File: SYN318+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SYN318+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n009.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:51:51 EDT 2024
% Result : Theorem 0.20s 0.35s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN318+1 : TPTP v8.1.2. Released v2.0.0.
% 0.12/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.33 % Computer : n009.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Mon Apr 29 21:52:56 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.35 % Drodi V3.6.0
% 0.20/0.35 % Refutation found
% 0.20/0.35 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.20/0.35 % SZS output start CNFRefutation for theBenchmark
% 0.20/0.35 fof(f1,conjecture,(
% 0.20/0.35 (? [Y] :( (! [X] :( big_f(X)=> ( big_f(Y)=> big_g(X) ) ))=> ( p=> (! [X] :( big_f(X)=> big_g(Y) ) )) ) )),
% 0.20/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.20/0.35 fof(f2,negated_conjecture,(
% 0.20/0.35 ~((? [Y] :( (! [X] :( big_f(X)=> ( big_f(Y)=> big_g(X) ) ))=> ( p=> (! [X] :( big_f(X)=> big_g(Y) ) )) ) ))),
% 0.20/0.35 inference(negated_conjecture,[status(cth)],[f1])).
% 0.20/0.35 fof(f3,plain,(
% 0.20/0.35 (![Y]: ((![X]: (~big_f(X)|(~big_f(Y)|big_g(X))))&(p&(?[X]: (big_f(X)&~big_g(Y))))))),
% 0.20/0.35 inference(pre_NNF_transformation,[status(esa)],[f2])).
% 0.20/0.35 fof(f4,plain,(
% 0.20/0.35 (![X]: (~big_f(X)|((![Y]: ~big_f(Y))|big_g(X))))&(p&((?[X]: big_f(X))&(![Y]: ~big_g(Y))))),
% 0.20/0.35 inference(miniscoping,[status(esa)],[f3])).
% 0.20/0.35 fof(f5,plain,(
% 0.20/0.35 (![X]: (~big_f(X)|((![Y]: ~big_f(Y))|big_g(X))))&(p&(big_f(sk0_0)&(![Y]: ~big_g(Y))))),
% 0.20/0.35 inference(skolemization,[status(esa)],[f4])).
% 0.20/0.35 fof(f6,plain,(
% 0.20/0.35 ![X0,X1]: (~big_f(X0)|~big_f(X1)|big_g(X0))),
% 0.20/0.35 inference(cnf_transformation,[status(esa)],[f5])).
% 0.20/0.35 fof(f8,plain,(
% 0.20/0.35 big_f(sk0_0)),
% 0.20/0.35 inference(cnf_transformation,[status(esa)],[f5])).
% 0.20/0.35 fof(f9,plain,(
% 0.20/0.35 ![X0]: (~big_g(X0))),
% 0.20/0.35 inference(cnf_transformation,[status(esa)],[f5])).
% 0.20/0.35 fof(f10,plain,(
% 0.20/0.35 spl0_0 <=> ~big_f(X0)|big_g(X0)),
% 0.20/0.35 introduced(split_symbol_definition)).
% 0.20/0.35 fof(f11,plain,(
% 0.20/0.35 ![X0]: (~big_f(X0)|big_g(X0)|~spl0_0)),
% 0.20/0.35 inference(component_clause,[status(thm)],[f10])).
% 0.20/0.35 fof(f13,plain,(
% 0.20/0.35 spl0_1 <=> ~big_f(X1)),
% 0.20/0.35 introduced(split_symbol_definition)).
% 0.20/0.35 fof(f14,plain,(
% 0.20/0.35 ![X0]: (~big_f(X0)|~spl0_1)),
% 0.20/0.35 inference(component_clause,[status(thm)],[f13])).
% 0.20/0.35 fof(f16,plain,(
% 0.20/0.35 spl0_0|spl0_1),
% 0.20/0.35 inference(split_clause,[status(thm)],[f6,f10,f13])).
% 0.20/0.35 fof(f17,plain,(
% 0.20/0.35 ![X0]: (~big_f(X0)|~spl0_0)),
% 0.20/0.35 inference(forward_subsumption_resolution,[status(thm)],[f11,f9])).
% 0.20/0.35 fof(f18,plain,(
% 0.20/0.35 $false|~spl0_0),
% 0.20/0.35 inference(backward_subsumption_resolution,[status(thm)],[f8,f17])).
% 0.20/0.35 fof(f19,plain,(
% 0.20/0.35 ~spl0_0),
% 0.20/0.35 inference(contradiction_clause,[status(thm)],[f18])).
% 0.20/0.35 fof(f20,plain,(
% 0.20/0.35 $false|~spl0_1),
% 0.20/0.35 inference(backward_subsumption_resolution,[status(thm)],[f8,f14])).
% 0.20/0.35 fof(f21,plain,(
% 0.20/0.35 ~spl0_1),
% 0.20/0.35 inference(contradiction_clause,[status(thm)],[f20])).
% 0.20/0.35 fof(f22,plain,(
% 0.20/0.35 $false),
% 0.20/0.35 inference(sat_refutation,[status(thm)],[f16,f19,f21])).
% 0.20/0.35 % SZS output end CNFRefutation for theBenchmark.p
% 0.20/0.37 % Elapsed time: 0.024329 seconds
% 0.20/0.37 % CPU time: 0.017446 seconds
% 0.20/0.37 % Total memory used: 1.825 MB
% 0.20/0.37 % Net memory used: 1.769 MB
%------------------------------------------------------------------------------