TSTP Solution File: GEO252+1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : GEO252+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n026.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 Aug 30 22:50:52 EDT 2023
% Result : Theorem 0.19s 0.52s
% Output : Proof 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO252+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% 0.00/0.13 % Command : do_cvc5 %s %d
% 0.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 29 21:16:06 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.47 %----Proving TF0_NAR, FOF, or CNF
% 0.19/0.52 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.a2UUgF7Bbq/cvc5---1.0.5_3915.p...
% 0.19/0.52 ------- get file name : TPTP file name is GEO252+1
% 0.19/0.52 ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_3915.smt2...
% 0.19/0.52 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.19/0.52 % SZS status Theorem for GEO252+1
% 0.19/0.52 % SZS output start Proof for GEO252+1
% 0.19/0.52 (
% 0.19/0.52 (let ((_let_1 (not (forall ((A $$unsorted) (B $$unsorted) (L $$unsorted)) (=> (and (tptp.left_apart_point A L) (tptp.left_apart_point B (tptp.reverse_line L))) (and (tptp.distinct_points A B) (tptp.left_convergent_lines (tptp.line_connecting A B) L))))))) (let ((_let_2 (forall ((A $$unsorted) (L $$unsorted)) (not (or (tptp.left_apart_point A L) (tptp.left_apart_point A (tptp.reverse_line L))))))) (let ((_let_3 (forall ((BOUND_VARIABLE_997 $$unsorted) (BOUND_VARIABLE_999 $$unsorted)) (not (tptp.left_apart_point BOUND_VARIABLE_997 BOUND_VARIABLE_999))))) (let ((_let_4 (tptp.left_apart_point SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4))) (let ((_let_5 (not _let_4))) (let ((_let_6 (or _let_5 (not (tptp.left_apart_point SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 (tptp.reverse_line SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4))) (and (tptp.distinct_points SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3) (tptp.left_convergent_lines (tptp.line_connecting SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3) SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4))))) (let ((_let_7 (forall ((A $$unsorted) (B $$unsorted) (L $$unsorted)) (or (not (tptp.left_apart_point A L)) (not (tptp.left_apart_point B (tptp.reverse_line L))) (and (tptp.distinct_points A B) (tptp.left_convergent_lines (tptp.line_connecting A B) L)))))) (let ((_let_8 (not _let_6))) (let ((_let_9 (EQ_RESOLVE (ASSUME :args (_let_1)) (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_10 (or))) (let ((_let_11 (not _let_7))) (let ((_let_12 (_let_3))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_12) :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.left_apart_point BOUND_VARIABLE_997 BOUND_VARIABLE_999) false))))) :args _let_12)) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_6 0)) (CONG (REFL :args (_let_6)) (MACRO_SR_PRED_INTRO :args ((= (not _let_5) _let_4))) :args _let_10)) :args ((or _let_4 _let_6))) (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE _let_9) :args (_let_11))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_11) _let_7))) (REFL :args (_let_8)) :args _let_10)) _let_9 :args (_let_8 true _let_7)) :args (_let_4 true _let_6)) (AND_ELIM (EQ_RESOLVE (ASSUME :args (_let_2)) (MACRO_SR_EQ_INTRO :args (_let_2 SB_DEFAULT SBA_FIXPOINT))) :args (0)) :args (false false _let_4 false _let_3)) :args ((forall ((A $$unsorted) (L $$unsorted)) (= (tptp.apart_point_and_line A L) (or (tptp.left_apart_point A L) (tptp.left_apart_point A (tptp.reverse_line L))))) (forall ((L $$unsorted) (M $$unsorted)) (= (tptp.convergent_lines L M) (and (tptp.unequally_directed_lines L M) (tptp.unequally_directed_lines L (tptp.reverse_line M))))) (forall ((A $$unsorted) (B $$unsorted) (L $$unsorted)) (let ((_let_1 (tptp.reverse_line L))) (= (tptp.divides_points L A B) (or (and (tptp.left_apart_point A L) (tptp.left_apart_point B _let_1)) (and (tptp.left_apart_point A _let_1) (tptp.left_apart_point B L)))))) (forall ((L $$unsorted) (A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.reverse_line L))) (= (tptp.before_on_line L A B) (and (tptp.distinct_points A B) (not (or (tptp.left_apart_point A L) (tptp.left_apart_point A _let_1))) (not (or (tptp.left_apart_point B L) (tptp.left_apart_point B _let_1))) (not (tptp.unequally_directed_lines L (tptp.line_connecting A B))))))) (forall ((L $$unsorted) (A $$unsorted) (B $$unsorted) (C $$unsorted)) (= (tptp.between_on_line L A B C) (or (and (tptp.before_on_line L A B) (tptp.before_on_line L B C)) (and (tptp.before_on_line L C B) (tptp.before_on_line L B A))))) (forall ((A $$unsorted)) (not (tptp.distinct_points A A))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (tptp.distinct_points A B) (or (tptp.distinct_points A C) (tptp.distinct_points B C)))) (forall ((L $$unsorted)) (not (tptp.distinct_lines L L))) (forall ((L $$unsorted) (M $$unsorted) (N $$unsorted)) (=> (tptp.distinct_lines L M) (or (tptp.distinct_lines L N) (tptp.distinct_lines M N)))) (forall ((L $$unsorted)) (not (tptp.unequally_directed_lines L L))) (forall ((L $$unsorted) (M $$unsorted) (N $$unsorted)) (=> (tptp.unequally_directed_lines L M) (or (tptp.unequally_directed_lines L N) (tptp.unequally_directed_lines M N)))) (forall ((L $$unsorted) (M $$unsorted) (N $$unsorted)) (let ((_let_1 (tptp.reverse_line N))) (=> (and (tptp.unequally_directed_lines L M) (tptp.unequally_directed_lines L (tptp.reverse_line M))) (or (and (tptp.unequally_directed_lines L N) (tptp.unequally_directed_lines L _let_1)) (and (tptp.unequally_directed_lines M N) (tptp.unequally_directed_lines M _let_1)))))) (forall ((L $$unsorted) (M $$unsorted)) (=> (and (tptp.line L) (tptp.line M)) (or (tptp.unequally_directed_lines L M) (tptp.unequally_directed_lines L (tptp.reverse_line M))))) (forall ((L $$unsorted) (M $$unsorted)) (let ((_let_1 (tptp.reverse_line M))) (=> (and (tptp.unequally_directed_lines L M) (tptp.unequally_directed_lines L _let_1)) (or (tptp.left_convergent_lines L M) (tptp.left_convergent_lines L _let_1))))) _let_2 (forall ((L $$unsorted) (M $$unsorted)) (not (or (tptp.left_convergent_lines L M) (tptp.left_convergent_lines L (tptp.reverse_line M))))) (forall ((A $$unsorted) (B $$unsorted)) (=> (and (tptp.point A) (tptp.point B) (tptp.distinct_points A B)) (tptp.line (tptp.line_connecting A B)))) (forall ((L $$unsorted) (M $$unsorted)) (=> (and (tptp.line L) (tptp.line M) (tptp.unequally_directed_lines L M) (tptp.unequally_directed_lines L (tptp.reverse_line M))) (tptp.point (tptp.intersection_point L M)))) (forall ((L $$unsorted) (A $$unsorted)) (=> (and (tptp.point A) (tptp.line L)) (tptp.line (tptp.parallel_through_point L A)))) (forall ((L $$unsorted)) (=> (tptp.line L) (tptp.line (tptp.reverse_line L)))) (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.line_connecting A B))) (=> (tptp.distinct_points A B) (and (not (tptp.apart_point_and_line A _let_1)) (not (tptp.apart_point_and_line B _let_1)))))) (forall ((L $$unsorted) (M $$unsorted)) (let ((_let_1 (tptp.intersection_point L M))) (=> (and (tptp.unequally_directed_lines L M) (tptp.unequally_directed_lines L (tptp.reverse_line M))) (and (not (tptp.apart_point_and_line _let_1 L)) (not (tptp.apart_point_and_line _let_1 M)))))) (forall ((A $$unsorted) (L $$unsorted)) (not (tptp.apart_point_and_line A (tptp.parallel_through_point L A)))) (forall ((L $$unsorted)) (not (tptp.distinct_lines L (tptp.reverse_line L)))) (forall ((A $$unsorted) (B $$unsorted)) (not (tptp.unequally_directed_lines (tptp.line_connecting A B) (tptp.reverse_line (tptp.line_connecting B A))))) (forall ((A $$unsorted) (L $$unsorted)) (not (tptp.unequally_directed_lines (tptp.parallel_through_point L A) L))) (forall ((A $$unsorted) (B $$unsorted) (L $$unsorted) (M $$unsorted)) (let ((_let_1 (tptp.reverse_line M))) (let ((_let_2 (tptp.reverse_line L))) (=> (and (tptp.distinct_points A B) (tptp.distinct_lines L M)) (or (tptp.left_apart_point A L) (tptp.left_apart_point B L) (tptp.left_apart_point A M) (tptp.left_apart_point B M) (tptp.left_apart_point A _let_2) (tptp.left_apart_point B _let_2) (tptp.left_apart_point A _let_1) (tptp.left_apart_point B _let_1)))))) (forall ((A $$unsorted) (B $$unsorted) (L $$unsorted)) (=> (and (tptp.distinct_points A B) (tptp.left_apart_point A L)) (or (tptp.left_apart_point B L) (tptp.left_convergent_lines (tptp.line_connecting A B) L)))) (forall ((A $$unsorted) (B $$unsorted) (L $$unsorted)) (=> (tptp.left_apart_point A L) (or (tptp.distinct_points A B) (tptp.left_apart_point B L)))) (forall ((A $$unsorted) (L $$unsorted) (M $$unsorted)) (=> (and (tptp.left_apart_point A L) (tptp.unequally_directed_lines L M)) (or (tptp.distinct_lines L M) (tptp.left_apart_point A (tptp.reverse_line M))))) (forall ((L $$unsorted) (M $$unsorted) (N $$unsorted)) (=> (tptp.left_convergent_lines L M) (or (tptp.unequally_directed_lines M N) (tptp.left_convergent_lines L N)))) _let_1 true)))))))))))))))
% 0.19/0.52 )
% 0.19/0.52 % SZS output end Proof for GEO252+1
% 0.19/0.52 % cvc5---1.0.5 exiting
% 0.19/0.52 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------