TSTP Solution File: SET108+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SET108+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n014.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:34:01 EDT 2023
% Result : Theorem 0.17s 0.56s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET108+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.03/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.33 % Computer : n014.cluster.edu
% 0.10/0.33 % Model : x86_64 x86_64
% 0.10/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.33 % Memory : 8042.1875MB
% 0.10/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.33 % CPULimit : 300
% 0.10/0.33 % WCLimit : 300
% 0.10/0.33 % DateTime : Tue May 30 10:18:18 EDT 2023
% 0.10/0.33 % CPUTime :
% 0.10/0.34 % Drodi V3.5.1
% 0.17/0.56 % Refutation found
% 0.17/0.56 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.17/0.56 % SZS output start CNFRefutation for theBenchmark
% 0.17/0.56 fof(f44,conjecture,(
% 0.17/0.56 (! [X] :(? [U,V] :( ( member(U,universal_class)& member(V,universal_class)& X = ordered_pair(U,V) )| ( ~ (? [Y,Z] :( member(Y,universal_class)& member(Z,universal_class)& X = ordered_pair(Y,Z) ))& U = X& V = X ) ) ))),
% 0.17/0.56 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.17/0.56 fof(f45,negated_conjecture,(
% 0.17/0.56 ~((! [X] :(? [U,V] :( ( member(U,universal_class)& member(V,universal_class)& X = ordered_pair(U,V) )| ( ~ (? [Y,Z] :( member(Y,universal_class)& member(Z,universal_class)& X = ordered_pair(Y,Z) ))& U = X& V = X ) ) )))),
% 0.17/0.56 inference(negated_conjecture,[status(cth)],[f44])).
% 0.17/0.56 fof(f191,plain,(
% 0.17/0.56 (?[X]: ![U,V]: (((~member(U,universal_class)|~member(V,universal_class))|~X=ordered_pair(U,V))&(((?[Y,Z]: ((member(Y,universal_class)&member(Z,universal_class))&X=ordered_pair(Y,Z)))|~U=X)|~V=X)))),
% 0.17/0.56 inference(pre_NNF_transformation,[status(esa)],[f45])).
% 0.17/0.56 fof(f192,plain,(
% 0.17/0.56 ?[X]: ((![U,V]: ((~member(U,universal_class)|~member(V,universal_class))|~X=ordered_pair(U,V)))&(((?[Y,Z]: ((member(Y,universal_class)&member(Z,universal_class))&X=ordered_pair(Y,Z)))|(![U]: ~U=X))|(![V]: ~V=X)))),
% 0.17/0.56 inference(miniscoping,[status(esa)],[f191])).
% 0.17/0.56 fof(f193,plain,(
% 0.17/0.56 ((![U,V]: ((~member(U,universal_class)|~member(V,universal_class))|~sk0_7=ordered_pair(U,V)))&((((member(sk0_8,universal_class)&member(sk0_9,universal_class))&sk0_7=ordered_pair(sk0_8,sk0_9))|(![U]: ~U=sk0_7))|(![V]: ~V=sk0_7)))),
% 0.17/0.56 inference(skolemization,[status(esa)],[f192])).
% 0.17/0.56 fof(f194,plain,(
% 0.17/0.56 ![X0,X1]: (~member(X0,universal_class)|~member(X1,universal_class)|~sk0_7=ordered_pair(X0,X1))),
% 0.17/0.56 inference(cnf_transformation,[status(esa)],[f193])).
% 0.17/0.56 fof(f195,plain,(
% 0.17/0.56 ![X0,X1]: (member(sk0_8,universal_class)|~X0=sk0_7|~X1=sk0_7)),
% 0.17/0.56 inference(cnf_transformation,[status(esa)],[f193])).
% 0.17/0.56 fof(f196,plain,(
% 0.17/0.56 ![X0,X1]: (member(sk0_9,universal_class)|~X0=sk0_7|~X1=sk0_7)),
% 0.17/0.56 inference(cnf_transformation,[status(esa)],[f193])).
% 0.17/0.56 fof(f197,plain,(
% 0.17/0.56 ![X0,X1]: (sk0_7=ordered_pair(sk0_8,sk0_9)|~X0=sk0_7|~X1=sk0_7)),
% 0.17/0.56 inference(cnf_transformation,[status(esa)],[f193])).
% 0.17/0.56 fof(f198,plain,(
% 0.17/0.56 spl0_0 <=> member(sk0_8,universal_class)),
% 0.17/0.56 introduced(split_symbol_definition)).
% 0.17/0.56 fof(f201,plain,(
% 0.17/0.56 spl0_1 <=> ~X0=sk0_7),
% 0.17/0.56 introduced(split_symbol_definition)).
% 0.17/0.56 fof(f202,plain,(
% 0.17/0.56 ![X0]: (~X0=sk0_7|~spl0_1)),
% 0.17/0.56 inference(component_clause,[status(thm)],[f201])).
% 0.17/0.56 fof(f204,plain,(
% 0.17/0.56 spl0_0|spl0_1),
% 0.17/0.56 inference(split_clause,[status(thm)],[f195,f198,f201])).
% 0.17/0.56 fof(f205,plain,(
% 0.17/0.56 spl0_2 <=> member(sk0_9,universal_class)),
% 0.17/0.56 introduced(split_symbol_definition)).
% 0.17/0.56 fof(f208,plain,(
% 0.17/0.56 spl0_2|spl0_1),
% 0.17/0.56 inference(split_clause,[status(thm)],[f196,f205,f201])).
% 0.17/0.56 fof(f209,plain,(
% 0.17/0.56 spl0_3 <=> sk0_7=ordered_pair(sk0_8,sk0_9)),
% 0.17/0.56 introduced(split_symbol_definition)).
% 0.17/0.56 fof(f210,plain,(
% 0.17/0.56 sk0_7=ordered_pair(sk0_8,sk0_9)|~spl0_3),
% 0.17/0.56 inference(component_clause,[status(thm)],[f209])).
% 0.17/0.56 fof(f212,plain,(
% 0.17/0.56 spl0_3|spl0_1),
% 0.17/0.56 inference(split_clause,[status(thm)],[f197,f209,f201])).
% 0.17/0.56 fof(f219,plain,(
% 0.17/0.56 $false|~spl0_1),
% 0.17/0.56 inference(destructive_equality_resolution,[status(esa)],[f202])).
% 0.17/0.56 fof(f220,plain,(
% 0.17/0.56 ~spl0_1),
% 0.17/0.56 inference(contradiction_clause,[status(thm)],[f219])).
% 0.17/0.56 fof(f290,plain,(
% 0.17/0.56 ~member(sk0_8,universal_class)|~member(sk0_9,universal_class)|~spl0_3),
% 0.17/0.56 inference(resolution,[status(thm)],[f210,f194])).
% 0.17/0.56 fof(f291,plain,(
% 0.17/0.56 ~spl0_0|~spl0_2|~spl0_3),
% 0.17/0.56 inference(split_clause,[status(thm)],[f290,f198,f205,f209])).
% 0.17/0.56 fof(f297,plain,(
% 0.17/0.56 $false),
% 0.17/0.56 inference(sat_refutation,[status(thm)],[f204,f208,f212,f220,f291])).
% 0.17/0.56 % SZS output end CNFRefutation for theBenchmark.p
% 0.17/0.56 % Elapsed time: 0.016911 seconds
% 0.17/0.56 % CPU time: 0.016405 seconds
% 0.17/0.56 % Memory used: 3.840 MB
%------------------------------------------------------------------------------