TSTP Solution File: SET900+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SET900+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n025.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:40:39 EDT 2024
% Result : Theorem 0.16s 0.32s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : SET900+1 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.10 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.31 % Computer : n025.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Apr 29 21:45:56 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.32 % Drodi V3.6.0
% 0.16/0.32 % Refutation found
% 0.16/0.32 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.16/0.32 % SZS output start CNFRefutation for theBenchmark
% 0.16/0.32 fof(f5,conjecture,(
% 0.16/0.32 (! [A,B] :~ ( A != singleton(B)& A != empty_set& (! [C] :~ ( in(C,A)& C != B ) )) )),
% 0.16/0.32 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.32 fof(f6,negated_conjecture,(
% 0.16/0.32 ~((! [A,B] :~ ( A != singleton(B)& A != empty_set& (! [C] :~ ( in(C,A)& C != B ) )) ))),
% 0.16/0.32 inference(negated_conjecture,[status(cth)],[f5])).
% 0.16/0.32 fof(f7,axiom,(
% 0.16/0.32 (! [A,B] :~ ( A != singleton(B)& A != empty_set& (! [C] :~ ( in(C,A)& C != B ) )) )),
% 0.16/0.32 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.32 fof(f15,plain,(
% 0.16/0.32 (?[A,B]: ((~A=singleton(B)&~A=empty_set)&(![C]: (~in(C,A)|C=B))))),
% 0.16/0.32 inference(pre_NNF_transformation,[status(esa)],[f6])).
% 0.16/0.32 fof(f16,plain,(
% 0.16/0.32 ((~sk0_2=singleton(sk0_3)&~sk0_2=empty_set)&(![C]: (~in(C,sk0_2)|C=sk0_3)))),
% 0.16/0.32 inference(skolemization,[status(esa)],[f15])).
% 0.16/0.32 fof(f17,plain,(
% 0.16/0.32 ~sk0_2=singleton(sk0_3)),
% 0.16/0.32 inference(cnf_transformation,[status(esa)],[f16])).
% 0.16/0.32 fof(f18,plain,(
% 0.16/0.32 ~sk0_2=empty_set),
% 0.16/0.32 inference(cnf_transformation,[status(esa)],[f16])).
% 0.16/0.32 fof(f19,plain,(
% 0.16/0.32 ![X0]: (~in(X0,sk0_2)|X0=sk0_3)),
% 0.16/0.32 inference(cnf_transformation,[status(esa)],[f16])).
% 0.16/0.32 fof(f20,plain,(
% 0.16/0.32 ![A,B]: ((A=singleton(B)|A=empty_set)|(?[C]: (in(C,A)&~C=B)))),
% 0.16/0.32 inference(pre_NNF_transformation,[status(esa)],[f7])).
% 0.16/0.32 fof(f21,plain,(
% 0.16/0.32 ![A,B]: ((A=singleton(B)|A=empty_set)|(in(sk0_4(B,A),A)&~sk0_4(B,A)=B))),
% 0.16/0.32 inference(skolemization,[status(esa)],[f20])).
% 0.16/0.32 fof(f22,plain,(
% 0.16/0.32 ![X0,X1]: (X0=singleton(X1)|X0=empty_set|in(sk0_4(X1,X0),X0))),
% 0.16/0.32 inference(cnf_transformation,[status(esa)],[f21])).
% 0.16/0.32 fof(f23,plain,(
% 0.16/0.32 ![X0,X1]: (X0=singleton(X1)|X0=empty_set|~sk0_4(X1,X0)=X1)),
% 0.16/0.32 inference(cnf_transformation,[status(esa)],[f21])).
% 0.16/0.32 fof(f24,plain,(
% 0.16/0.32 spl0_0 <=> sk0_2=singleton(X0)|sk0_4(X0,sk0_2)=sk0_3),
% 0.16/0.32 introduced(split_symbol_definition)).
% 0.16/0.32 fof(f25,plain,(
% 0.16/0.32 ![X0]: (sk0_2=singleton(X0)|sk0_4(X0,sk0_2)=sk0_3|~spl0_0)),
% 0.16/0.32 inference(component_clause,[status(thm)],[f24])).
% 0.16/0.32 fof(f27,plain,(
% 0.16/0.32 spl0_1 <=> sk0_2=empty_set),
% 0.16/0.32 introduced(split_symbol_definition)).
% 0.16/0.32 fof(f28,plain,(
% 0.16/0.32 sk0_2=empty_set|~spl0_1),
% 0.16/0.32 inference(component_clause,[status(thm)],[f27])).
% 0.16/0.32 fof(f30,plain,(
% 0.16/0.32 ![X0]: (sk0_2=singleton(X0)|sk0_2=empty_set|sk0_4(X0,sk0_2)=sk0_3)),
% 0.16/0.32 inference(resolution,[status(thm)],[f22,f19])).
% 0.16/0.32 fof(f31,plain,(
% 0.16/0.32 spl0_0|spl0_1),
% 0.16/0.32 inference(split_clause,[status(thm)],[f30,f24,f27])).
% 0.16/0.32 fof(f33,plain,(
% 0.16/0.32 spl0_2 <=> sk0_2=singleton(sk0_3)),
% 0.16/0.32 introduced(split_symbol_definition)).
% 0.16/0.32 fof(f34,plain,(
% 0.16/0.32 sk0_2=singleton(sk0_3)|~spl0_2),
% 0.16/0.32 inference(component_clause,[status(thm)],[f33])).
% 0.16/0.32 fof(f36,plain,(
% 0.16/0.32 sk0_2=singleton(sk0_3)|sk0_2=singleton(sk0_3)|sk0_2=empty_set|~spl0_0),
% 0.16/0.32 inference(resolution,[status(thm)],[f25,f23])).
% 0.16/0.32 fof(f37,plain,(
% 0.16/0.32 spl0_2|spl0_1|~spl0_0),
% 0.16/0.32 inference(split_clause,[status(thm)],[f36,f33,f27,f24])).
% 0.16/0.32 fof(f56,plain,(
% 0.16/0.32 $false|~spl0_1),
% 0.16/0.32 inference(forward_subsumption_resolution,[status(thm)],[f28,f18])).
% 0.16/0.32 fof(f57,plain,(
% 0.16/0.32 ~spl0_1),
% 0.16/0.32 inference(contradiction_clause,[status(thm)],[f56])).
% 0.16/0.32 fof(f59,plain,(
% 0.16/0.32 $false|~spl0_2),
% 0.16/0.32 inference(forward_subsumption_resolution,[status(thm)],[f34,f17])).
% 0.16/0.32 fof(f60,plain,(
% 0.16/0.32 ~spl0_2),
% 0.16/0.32 inference(contradiction_clause,[status(thm)],[f59])).
% 0.16/0.32 fof(f61,plain,(
% 0.16/0.32 $false),
% 0.16/0.32 inference(sat_refutation,[status(thm)],[f31,f37,f57,f60])).
% 0.16/0.32 % SZS output end CNFRefutation for theBenchmark.p
% 0.16/0.33 % Elapsed time: 0.015113 seconds
% 0.16/0.33 % CPU time: 0.018994 seconds
% 0.16/0.33 % Total memory used: 9.368 MB
% 0.16/0.33 % Net memory used: 9.235 MB
%------------------------------------------------------------------------------