TSTP Solution File: GEO125+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : GEO125+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n007.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:07:52 EDT 2023
% Result : Theorem 0.06s 0.28s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : GEO125+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.08 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.06/0.26 % Computer : n007.cluster.edu
% 0.06/0.26 % Model : x86_64 x86_64
% 0.06/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26 % Memory : 8042.1875MB
% 0.06/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26 % CPULimit : 300
% 0.06/0.26 % WCLimit : 300
% 0.06/0.26 % DateTime : Tue May 30 11:46:16 EDT 2023
% 0.06/0.26 % CPUTime :
% 0.06/0.27 % Drodi V3.5.1
% 0.06/0.28 % Refutation found
% 0.06/0.28 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.06/0.28 % SZS output start CNFRefutation for theBenchmark
% 0.06/0.28 fof(f17,axiom,(
% 0.06/0.28 (! [C,P,Q,R] :( between_c(C,P,Q,R)<=> ( P != R& (? [Cpp] :( part_of(Cpp,C)& end_point(P,Cpp)& end_point(R,Cpp)& inner_point(Q,Cpp) ) )) ) )),
% 0.06/0.28 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.06/0.28 fof(f18,axiom,(
% 0.06/0.28 (! [O,P,Q,R] :( between_o(O,P,Q,R)<=> ( ( ordered_by(O,P,Q)& ordered_by(O,Q,R) )| ( ordered_by(O,R,Q)& ordered_by(O,Q,P) ) ) ) )),
% 0.06/0.28 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.06/0.28 fof(f20,axiom,(
% 0.06/0.28 (! [P,O] :( finish_point(P,O)<=> ( incident_o(P,O)& (! [Q] :( ( P != Q& incident_o(Q,O) )=> ordered_by(O,Q,P) ) )) ) )),
% 0.06/0.28 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.06/0.28 fof(f21,axiom,(
% 0.06/0.28 (! [O,P,Q] :( ordered_by(O,P,Q)=> ( incident_o(P,O)& incident_o(Q,O) ) ) )),
% 0.06/0.28 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.06/0.28 fof(f23,axiom,(
% 0.06/0.28 (! [P,Q,R,O] :( between_o(O,P,Q,R)<=> (? [C] :( (! [P] :( incident_o(P,O)<=> incident_c(P,C) ))& between_c(C,P,Q,R) ) )) )),
% 0.06/0.28 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.06/0.28 fof(f28,conjecture,(
% 0.06/0.28 (! [O,P,Q] :( ( finish_point(P,O)& finish_point(Q,O) )=> P = Q ) )),
% 0.06/0.28 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.06/0.28 fof(f29,negated_conjecture,(
% 0.06/0.28 ~((! [O,P,Q] :( ( finish_point(P,O)& finish_point(Q,O) )=> P = Q ) ))),
% 0.06/0.28 inference(negated_conjecture,[status(cth)],[f28])).
% 0.06/0.28 fof(f115,plain,(
% 0.06/0.28 ![C,P,Q,R]: ((~between_c(C,P,Q,R)|(~P=R&(?[Cpp]: (((part_of(Cpp,C)&end_point(P,Cpp))&end_point(R,Cpp))&inner_point(Q,Cpp)))))&(between_c(C,P,Q,R)|(P=R|(![Cpp]: (((~part_of(Cpp,C)|~end_point(P,Cpp))|~end_point(R,Cpp))|~inner_point(Q,Cpp))))))),
% 0.06/0.28 inference(NNF_transformation,[status(esa)],[f17])).
% 0.06/0.28 fof(f116,plain,(
% 0.06/0.28 (![C,P,Q,R]: (~between_c(C,P,Q,R)|(~P=R&(?[Cpp]: (((part_of(Cpp,C)&end_point(P,Cpp))&end_point(R,Cpp))&inner_point(Q,Cpp))))))&(![C,P,Q,R]: (between_c(C,P,Q,R)|(P=R|(![Cpp]: (((~part_of(Cpp,C)|~end_point(P,Cpp))|~end_point(R,Cpp))|~inner_point(Q,Cpp))))))),
% 0.06/0.28 inference(miniscoping,[status(esa)],[f115])).
% 0.06/0.28 fof(f117,plain,(
% 0.06/0.28 (![C,P,Q,R]: (~between_c(C,P,Q,R)|(~P=R&(((part_of(sk0_13(R,Q,P,C),C)&end_point(P,sk0_13(R,Q,P,C)))&end_point(R,sk0_13(R,Q,P,C)))&inner_point(Q,sk0_13(R,Q,P,C))))))&(![C,P,Q,R]: (between_c(C,P,Q,R)|(P=R|(![Cpp]: (((~part_of(Cpp,C)|~end_point(P,Cpp))|~end_point(R,Cpp))|~inner_point(Q,Cpp))))))),
% 0.06/0.28 inference(skolemization,[status(esa)],[f116])).
% 0.06/0.28 fof(f118,plain,(
% 0.06/0.28 ![X0,X1,X2,X3]: (~between_c(X0,X1,X2,X3)|~X1=X3)),
% 0.06/0.28 inference(cnf_transformation,[status(esa)],[f117])).
% 0.06/0.28 fof(f124,plain,(
% 0.06/0.28 ![O,P,Q,R]: ((~between_o(O,P,Q,R)|((ordered_by(O,P,Q)&ordered_by(O,Q,R))|(ordered_by(O,R,Q)&ordered_by(O,Q,P))))&(between_o(O,P,Q,R)|((~ordered_by(O,P,Q)|~ordered_by(O,Q,R))&(~ordered_by(O,R,Q)|~ordered_by(O,Q,P)))))),
% 0.06/0.28 inference(NNF_transformation,[status(esa)],[f18])).
% 0.06/0.28 fof(f125,plain,(
% 0.06/0.28 (![O,P,Q,R]: (~between_o(O,P,Q,R)|((ordered_by(O,P,Q)&ordered_by(O,Q,R))|(ordered_by(O,R,Q)&ordered_by(O,Q,P)))))&(![O,P,Q,R]: (between_o(O,P,Q,R)|((~ordered_by(O,P,Q)|~ordered_by(O,Q,R))&(~ordered_by(O,R,Q)|~ordered_by(O,Q,P)))))),
% 0.06/0.28 inference(miniscoping,[status(esa)],[f124])).
% 0.06/0.28 fof(f131,plain,(
% 0.06/0.28 ![X0,X1,X2,X3]: (between_o(X0,X1,X2,X3)|~ordered_by(X0,X3,X2)|~ordered_by(X0,X2,X1))),
% 0.06/0.28 inference(cnf_transformation,[status(esa)],[f125])).
% 0.06/0.28 fof(f141,plain,(
% 0.06/0.28 ![P,O]: (finish_point(P,O)<=>(incident_o(P,O)&(![Q]: ((P=Q|~incident_o(Q,O))|ordered_by(O,Q,P)))))),
% 0.06/0.28 inference(pre_NNF_transformation,[status(esa)],[f20])).
% 0.06/0.28 fof(f142,plain,(
% 0.06/0.28 ![P,O]: ((~finish_point(P,O)|(incident_o(P,O)&(![Q]: ((P=Q|~incident_o(Q,O))|ordered_by(O,Q,P)))))&(finish_point(P,O)|(~incident_o(P,O)|(?[Q]: ((~P=Q&incident_o(Q,O))&~ordered_by(O,Q,P))))))),
% 0.06/0.28 inference(NNF_transformation,[status(esa)],[f141])).
% 0.06/0.28 fof(f143,plain,(
% 0.06/0.28 (![P,O]: (~finish_point(P,O)|(incident_o(P,O)&(![Q]: ((P=Q|~incident_o(Q,O))|ordered_by(O,Q,P))))))&(![P,O]: (finish_point(P,O)|(~incident_o(P,O)|(?[Q]: ((~P=Q&incident_o(Q,O))&~ordered_by(O,Q,P))))))),
% 0.06/0.28 inference(miniscoping,[status(esa)],[f142])).
% 0.06/0.28 fof(f144,plain,(
% 0.06/0.28 (![P,O]: (~finish_point(P,O)|(incident_o(P,O)&(![Q]: ((P=Q|~incident_o(Q,O))|ordered_by(O,Q,P))))))&(![P,O]: (finish_point(P,O)|(~incident_o(P,O)|((~P=sk0_15(O,P)&incident_o(sk0_15(O,P),O))&~ordered_by(O,sk0_15(O,P),P)))))),
% 0.06/0.28 inference(skolemization,[status(esa)],[f143])).
% 0.06/0.28 fof(f145,plain,(
% 0.06/0.28 ![X0,X1]: (~finish_point(X0,X1)|incident_o(X0,X1))),
% 0.06/0.28 inference(cnf_transformation,[status(esa)],[f144])).
% 0.06/0.28 fof(f146,plain,(
% 0.06/0.28 ![X0,X1,X2]: (~finish_point(X0,X1)|X0=X2|~incident_o(X2,X1)|ordered_by(X1,X2,X0))),
% 0.06/0.28 inference(cnf_transformation,[status(esa)],[f144])).
% 0.06/0.28 fof(f150,plain,(
% 0.06/0.28 ![O,P,Q]: (~ordered_by(O,P,Q)|(incident_o(P,O)&incident_o(Q,O)))),
% 0.06/0.28 inference(pre_NNF_transformation,[status(esa)],[f21])).
% 0.06/0.28 fof(f152,plain,(
% 0.06/0.28 ![X0,X1,X2]: (~ordered_by(X0,X1,X2)|incident_o(X2,X0))),
% 0.06/0.28 inference(cnf_transformation,[status(esa)],[f150])).
% 0.06/0.28 fof(f159,plain,(
% 0.06/0.28 ![P,Q,R,O]: ((~between_o(O,P,Q,R)|(?[C]: ((![P]: ((~incident_o(P,O)|incident_c(P,C))&(incident_o(P,O)|~incident_c(P,C))))&between_c(C,P,Q,R))))&(between_o(O,P,Q,R)|(![C]: ((?[P]: ((~incident_o(P,O)|~incident_c(P,C))&(incident_o(P,O)|incident_c(P,C))))|~between_c(C,P,Q,R)))))),
% 0.06/0.28 inference(NNF_transformation,[status(esa)],[f23])).
% 0.06/0.28 fof(f160,plain,(
% 0.06/0.28 (![P,Q,R,O]: (~between_o(O,P,Q,R)|(?[C]: (((![P]: (~incident_o(P,O)|incident_c(P,C)))&(![P]: (incident_o(P,O)|~incident_c(P,C))))&between_c(C,P,Q,R)))))&(![P,Q,R,O]: (between_o(O,P,Q,R)|(![C]: ((?[P]: ((~incident_o(P,O)|~incident_c(P,C))&(incident_o(P,O)|incident_c(P,C))))|~between_c(C,P,Q,R)))))),
% 0.06/0.28 inference(miniscoping,[status(esa)],[f159])).
% 0.06/0.28 fof(f161,plain,(
% 0.06/0.28 (![P,Q,R,O]: (~between_o(O,P,Q,R)|(((![P]: (~incident_o(P,O)|incident_c(P,sk0_17(O,R,Q,P))))&(![P]: (incident_o(P,O)|~incident_c(P,sk0_17(O,R,Q,P)))))&between_c(sk0_17(O,R,Q,P),P,Q,R))))&(![P,Q,R,O]: (between_o(O,P,Q,R)|(![C]: (((~incident_o(sk0_18(C,O,R,Q,P),O)|~incident_c(sk0_18(C,O,R,Q,P),C))&(incident_o(sk0_18(C,O,R,Q,P),O)|incident_c(sk0_18(C,O,R,Q,P),C)))|~between_c(C,P,Q,R)))))),
% 0.06/0.28 inference(skolemization,[status(esa)],[f160])).
% 0.06/0.28 fof(f164,plain,(
% 0.06/0.28 ![X0,X1,X2,X3]: (~between_o(X0,X1,X2,X3)|between_c(sk0_17(X0,X3,X2,X1),X1,X2,X3))),
% 0.06/0.28 inference(cnf_transformation,[status(esa)],[f161])).
% 0.06/0.28 fof(f188,plain,(
% 0.06/0.28 (?[O,P,Q]: ((finish_point(P,O)&finish_point(Q,O))&~P=Q))),
% 0.06/0.28 inference(pre_NNF_transformation,[status(esa)],[f29])).
% 0.06/0.28 fof(f189,plain,(
% 0.06/0.28 ?[P,Q]: ((?[O]: (finish_point(P,O)&finish_point(Q,O)))&~P=Q)),
% 0.06/0.28 inference(miniscoping,[status(esa)],[f188])).
% 0.06/0.28 fof(f190,plain,(
% 0.06/0.28 ((finish_point(sk0_24,sk0_26)&finish_point(sk0_25,sk0_26))&~sk0_24=sk0_25)),
% 0.06/0.28 inference(skolemization,[status(esa)],[f189])).
% 0.06/0.28 fof(f191,plain,(
% 0.06/0.28 finish_point(sk0_24,sk0_26)),
% 0.06/0.28 inference(cnf_transformation,[status(esa)],[f190])).
% 0.06/0.28 fof(f192,plain,(
% 0.06/0.28 finish_point(sk0_25,sk0_26)),
% 0.06/0.28 inference(cnf_transformation,[status(esa)],[f190])).
% 0.06/0.28 fof(f193,plain,(
% 0.06/0.28 ~sk0_24=sk0_25),
% 0.06/0.28 inference(cnf_transformation,[status(esa)],[f190])).
% 0.06/0.28 fof(f198,plain,(
% 0.06/0.28 ![X0,X1,X2]: (~between_c(X0,X1,X2,X1))),
% 0.06/0.28 inference(destructive_equality_resolution,[status(esa)],[f118])).
% 0.06/0.28 fof(f222,plain,(
% 0.06/0.28 ![X0,X1,X2,X3]: (between_c(sk0_17(X0,X1,X2,X3),X3,X2,X1)|~ordered_by(X0,X1,X2)|~ordered_by(X0,X2,X3))),
% 0.06/0.28 inference(resolution,[status(thm)],[f164,f131])).
% 0.06/0.28 fof(f249,plain,(
% 0.06/0.28 ![X0,X1,X2]: (~ordered_by(X0,X1,X2)|~ordered_by(X0,X2,X1))),
% 0.06/0.28 inference(resolution,[status(thm)],[f222,f198])).
% 0.06/0.28 fof(f254,plain,(
% 0.06/0.28 ![X0,X1,X2]: (~ordered_by(X0,X1,X2)|~finish_point(X1,X0)|X1=X2|~incident_o(X2,X0))),
% 0.06/0.28 inference(resolution,[status(thm)],[f249,f146])).
% 0.06/0.28 fof(f255,plain,(
% 0.06/0.28 ![X0,X1,X2]: (~ordered_by(X0,X1,X2)|~finish_point(X1,X0)|X1=X2)),
% 0.06/0.28 inference(forward_subsumption_resolution,[status(thm)],[f254,f152])).
% 0.06/0.28 fof(f256,plain,(
% 0.06/0.28 ![X0]: (~ordered_by(sk0_26,sk0_25,X0)|sk0_25=X0)),
% 0.06/0.28 inference(resolution,[status(thm)],[f255,f192])).
% 0.06/0.28 fof(f270,plain,(
% 0.06/0.28 spl0_2 <=> sk0_25=X0|~finish_point(X0,sk0_26)|X0=sk0_25),
% 0.06/0.28 introduced(split_symbol_definition)).
% 0.06/0.28 fof(f271,plain,(
% 0.06/0.28 ![X0]: (sk0_25=X0|~finish_point(X0,sk0_26)|X0=sk0_25|~spl0_2)),
% 0.06/0.28 inference(component_clause,[status(thm)],[f270])).
% 0.06/0.28 fof(f273,plain,(
% 0.06/0.28 spl0_3 <=> incident_o(sk0_25,sk0_26)),
% 0.06/0.28 introduced(split_symbol_definition)).
% 0.06/0.28 fof(f275,plain,(
% 0.06/0.28 ~incident_o(sk0_25,sk0_26)|spl0_3),
% 0.12/0.28 inference(component_clause,[status(thm)],[f273])).
% 0.12/0.28 fof(f276,plain,(
% 0.12/0.28 ![X0]: (sk0_25=X0|~finish_point(X0,sk0_26)|X0=sk0_25|~incident_o(sk0_25,sk0_26))),
% 0.12/0.28 inference(resolution,[status(thm)],[f256,f146])).
% 0.12/0.28 fof(f277,plain,(
% 0.12/0.28 spl0_2|~spl0_3),
% 0.12/0.28 inference(split_clause,[status(thm)],[f276,f270,f273])).
% 0.12/0.28 fof(f303,plain,(
% 0.12/0.28 ~finish_point(sk0_25,sk0_26)|spl0_3),
% 0.12/0.28 inference(resolution,[status(thm)],[f275,f145])).
% 0.12/0.28 fof(f304,plain,(
% 0.12/0.28 $false|spl0_3),
% 0.12/0.28 inference(forward_subsumption_resolution,[status(thm)],[f303,f192])).
% 0.12/0.28 fof(f305,plain,(
% 0.12/0.28 spl0_3),
% 0.12/0.28 inference(contradiction_clause,[status(thm)],[f304])).
% 0.12/0.28 fof(f306,plain,(
% 0.12/0.28 ![X0]: (sk0_25=X0|~finish_point(X0,sk0_26)|~spl0_2)),
% 0.12/0.28 inference(duplicate_literals_removal,[status(esa)],[f271])).
% 0.12/0.28 fof(f307,plain,(
% 0.12/0.28 sk0_25=sk0_24|~spl0_2),
% 0.12/0.28 inference(resolution,[status(thm)],[f306,f191])).
% 0.12/0.28 fof(f308,plain,(
% 0.12/0.28 $false|~spl0_2),
% 0.12/0.28 inference(forward_subsumption_resolution,[status(thm)],[f307,f193])).
% 0.12/0.28 fof(f309,plain,(
% 0.12/0.28 ~spl0_2),
% 0.12/0.28 inference(contradiction_clause,[status(thm)],[f308])).
% 0.12/0.28 fof(f310,plain,(
% 0.12/0.28 $false),
% 0.12/0.28 inference(sat_refutation,[status(thm)],[f277,f305,f309])).
% 0.12/0.28 % SZS output end CNFRefutation for theBenchmark.p
% 0.12/0.29 % Elapsed time: 0.024332 seconds
% 0.12/0.29 % CPU time: 0.090039 seconds
% 0.12/0.29 % Memory used: 13.172 MB
%------------------------------------------------------------------------------