%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : GRA005+1 : TPTP v8.1.2. Bugfixed v3.2.0.
% Transfm  : none
% Format   : tptp
% Command  : do_cvc5 %s %d

% 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 : Thu Aug 31 00:00:31 EDT 2023

% Result   : Theorem 0.21s 0.55s
% Output   : Proof 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem    : GRA005+1 : TPTP v8.1.2. Bugfixed v3.2.0.
% 0.11/0.14  % Command    : do_cvc5 %s %d
% 0.13/0.35  % Computer : n007.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Sun Aug 27 03:20:12 EDT 2023
% 0.13/0.35  % CPUTime    : 
% 0.21/0.50  %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.55  ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.KD3Tmgu0K7/cvc5---1.0.5_19855.p...
% 0.21/0.55  ------- get file name : TPTP file name is GRA005+1
% 0.21/0.55  ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_19855.smt2...
% 0.21/0.55  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.55  % SZS status Theorem for GRA005+1
% 0.21/0.55  % SZS output start Proof for GRA005+1
% 0.21/0.55  (
% 0.21/0.55  (let ((_let_1 (not (forall ((V1 $$unsorted) (V2 $$unsorted) (E1 $$unsorted) (E2 $$unsorted) (P $$unsorted)) (=> (and (tptp.shortest_path V1 V2 P) (tptp.precedes E1 E2 P)) (not (exists ((E3 $$unsorted)) (and (tptp.edge E3) (= (tptp.tail_of E3) (tptp.tail_of E1)) (= (tptp.head_of E3) (tptp.head_of E2)))))))))) (let ((_let_2 (forall ((V1 $$unsorted) (V2 $$unsorted) (E1 $$unsorted) (E2 $$unsorted) (P $$unsorted)) (=> (and (tptp.shortest_path V1 V2 P) (tptp.precedes E1 E2 P)) (and (not (exists ((E3 $$unsorted)) (and (= (tptp.tail_of E3) (tptp.tail_of E1)) (= (tptp.head_of E3) (tptp.head_of E2))))) (not (tptp.precedes E2 E1 P))))))) (let ((_let_3 (tptp.shortest_path SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6))) (let ((_let_4 (tptp.precedes SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6))) (let ((_let_5 (= (tptp.head_of SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5) (tptp.head_of SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_7)))) (let ((_let_6 (not _let_5))) (let ((_let_7 (= (tptp.tail_of SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4) (tptp.tail_of SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_7)))) (let ((_let_8 (not _let_7))) (let ((_let_9 (or _let_8 _let_6))) (let ((_let_10 (and _let_9 (not (tptp.precedes SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6))))) (let ((_let_11 (not _let_4))) (let ((_let_12 (not _let_3))) (let ((_let_13 (or _let_12 _let_11 _let_10))) (let ((_let_14 (or _let_12 _let_11 (not (tptp.edge SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_7)) _let_8 _let_6))) (let ((_let_15 (forall ((V1 $$unsorted) (V2 $$unsorted) (E1 $$unsorted) (E2 $$unsorted) (P $$unsorted) (BOUND_VARIABLE_1320 $$unsorted)) (or (not (tptp.shortest_path V1 V2 P)) (not (tptp.precedes E1 E2 P)) (not (tptp.edge BOUND_VARIABLE_1320)) (not (= (tptp.tail_of E1) (tptp.tail_of BOUND_VARIABLE_1320))) (not (= (tptp.head_of E2) (tptp.head_of BOUND_VARIABLE_1320))))))) (let ((_let_16 (not _let_14))) (let ((_let_17 (EQ_RESOLVE (ASSUME :args (_let_1)) (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_18 (or))) (let ((_let_19 (not _let_15))) (let ((_let_20 (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE _let_17) :args (_let_19))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_19) _let_15))) (REFL :args (_let_16)) :args _let_18)) _let_17 :args (_let_16 true _let_15)))) (let ((_let_21 (REFL :args (_let_14)))) (let ((_let_22 (forall ((V1 $$unsorted) (V2 $$unsorted) (E1 $$unsorted) (E2 $$unsorted) (P $$unsorted) (BOUND_VARIABLE_1250 $$unsorted)) (or (not (tptp.shortest_path V1 V2 P)) (not (tptp.precedes E1 E2 P)) (and (or (not (= (tptp.tail_of E1) (tptp.tail_of BOUND_VARIABLE_1250))) (not (= (tptp.head_of E2) (tptp.head_of BOUND_VARIABLE_1250)))) (not (tptp.precedes E2 E1 P))))))) (let ((_let_23 (EQ_RESOLVE (ASSUME :args (_let_2)) (MACRO_SR_EQ_INTRO :args (_let_2 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_24 (not _let_10))) (let ((_let_25 (not _let_9))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_13)) :args ((or _let_12 _let_11 _let_10 (not _let_13)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_AND_POS :args (_let_10 0)) :args ((or _let_9 _let_24))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_9)) :args ((or _let_8 _let_6 _let_25))) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_14 3)) (CONG _let_21 (MACRO_SR_PRED_INTRO :args ((= (not _let_8) _let_7))) :args _let_18)) :args ((or _let_7 _let_14))) _let_20 :args (_let_7 true _let_14)) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_14 4)) (CONG _let_21 (MACRO_SR_PRED_INTRO :args ((= (not _let_6) _let_5))) :args _let_18)) :args ((or _let_5 _let_14))) _let_20 :args (_let_5 true _let_14)) :args (_let_25 false _let_7 false _let_5)) :args (_let_24 true _let_9)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_23 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_7 QUANTIFIERS_INST_E_MATCHING ((not (= (tptp.shortest_path V1 V2 P) false)) (not (= (tptp.precedes E1 E2 P) false)) (tptp.tail_of BOUND_VARIABLE_1250)))) :args (_let_22))) _let_23 :args (_let_13 false _let_22)) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_14 1)) (CONG _let_21 (MACRO_SR_PRED_INTRO :args ((= (not _let_11) _let_4))) :args _let_18)) :args ((or _let_4 _let_14))) _let_20 :args (_let_4 true _let_14)) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_14 0)) (CONG _let_21 (MACRO_SR_PRED_INTRO :args ((= (not _let_12) _let_3))) :args _let_18)) :args ((or _let_3 _let_14))) _let_20 :args (_let_3 true _let_14)) :args (false true _let_10 false _let_13 false _let_4 false _let_3)) :args ((forall ((E $$unsorted)) (=> (tptp.edge E) (not (= (tptp.head_of E) (tptp.tail_of E))))) (forall ((E $$unsorted)) (=> (tptp.edge E) (and (tptp.vertex (tptp.head_of E)) (tptp.vertex (tptp.tail_of E))))) (=> tptp.complete (forall ((V1 $$unsorted) (V2 $$unsorted)) (=> (and (tptp.vertex V1) (tptp.vertex V2) (not (= V1 V2))) (exists ((E $$unsorted)) (let ((_let_1 (tptp.tail_of E))) (let ((_let_2 (tptp.head_of E))) (and (tptp.edge E) (xor (and (= V1 _let_2) (= V2 _let_1)) (and (= V2 _let_2) (= V1 _let_1)))))))))) (forall ((V1 $$unsorted) (V2 $$unsorted) (P $$unsorted)) (=> (and (tptp.vertex V1) (tptp.vertex V2) (exists ((E $$unsorted)) (and (tptp.edge E) (= V1 (tptp.tail_of E)) (or (and (= V2 (tptp.head_of E)) (= P (tptp.path_cons E tptp.empty))) (exists ((TP $$unsorted)) (and (tptp.path (tptp.head_of E) V2 TP) (= P (tptp.path_cons E TP)))))))) (tptp.path V1 V2 P))) (forall ((V1 $$unsorted) (V2 $$unsorted) (P $$unsorted)) (=> (tptp.path V1 V2 P) (and (tptp.vertex V1) (tptp.vertex V2) (exists ((E $$unsorted)) (and (tptp.edge E) (= V1 (tptp.tail_of E)) (xor (and (= V2 (tptp.head_of E)) (= P (tptp.path_cons E tptp.empty))) (exists ((TP $$unsorted)) (and (tptp.path (tptp.head_of E) V2 TP) (= P (tptp.path_cons E TP)))))))))) (forall ((V1 $$unsorted) (V2 $$unsorted) (P $$unsorted) (E $$unsorted)) (=> (and (tptp.path V1 V2 P) (tptp.on_path E P)) (and (tptp.edge E) (tptp.in_path (tptp.head_of E) P) (tptp.in_path (tptp.tail_of E) P)))) (forall ((V1 $$unsorted) (V2 $$unsorted) (P $$unsorted) (V $$unsorted)) (=> (and (tptp.path V1 V2 P) (tptp.in_path V P)) (and (tptp.vertex V) (exists ((E $$unsorted)) (and (tptp.on_path E P) (or (= V (tptp.head_of E)) (= V (tptp.tail_of E)))))))) (forall ((E1 $$unsorted) (E2 $$unsorted)) (= (tptp.sequential E1 E2) (and (tptp.edge E1) (tptp.edge E2) (not (= E1 E2)) (= (tptp.head_of E1) (tptp.tail_of E2))))) (forall ((P $$unsorted) (V1 $$unsorted) (V2 $$unsorted)) (=> (tptp.path V1 V2 P) (forall ((E1 $$unsorted) (E2 $$unsorted)) (=> (and (tptp.on_path E1 P) (tptp.on_path E2 P) (or (tptp.sequential E1 E2) (exists ((E3 $$unsorted)) (and (tptp.sequential E1 E3) (tptp.precedes E3 E2 P))))) (tptp.precedes E1 E2 P))))) (forall ((P $$unsorted) (V1 $$unsorted) (V2 $$unsorted)) (=> (tptp.path V1 V2 P) (forall ((E1 $$unsorted) (E2 $$unsorted)) (=> (tptp.precedes E1 E2 P) (and (tptp.on_path E1 P) (tptp.on_path E2 P) (xor (tptp.sequential E1 E2) (exists ((E3 $$unsorted)) (and (tptp.sequential E1 E3) (tptp.precedes E3 E2 P))))))))) (forall ((V1 $$unsorted) (V2 $$unsorted) (SP $$unsorted)) (= (tptp.shortest_path V1 V2 SP) (and (tptp.path V1 V2 SP) (not (= V1 V2)) (forall ((P $$unsorted)) (=> (tptp.path V1 V2 P) (tptp.less_or_equal (tptp.length_of SP) (tptp.length_of P))))))) _let_2 (forall ((E1 $$unsorted) (E2 $$unsorted) (E3 $$unsorted)) (= (tptp.triangle E1 E2 E3) (and (tptp.edge E1) (tptp.edge E2) (tptp.edge E3) (tptp.sequential E1 E2) (tptp.sequential E2 E3) (tptp.sequential E3 E1)))) (forall ((V1 $$unsorted) (V2 $$unsorted) (P $$unsorted)) (=> (tptp.path V1 V2 P) (= (tptp.length_of P) (tptp.number_of_in tptp.edges P)))) (forall ((V1 $$unsorted) (V2 $$unsorted) (P $$unsorted)) (=> (tptp.path V1 V2 P) (= (tptp.number_of_in tptp.sequential_pairs P) (tptp.minus (tptp.length_of P) tptp.n1)))) (forall ((P $$unsorted) (V1 $$unsorted) (V2 $$unsorted)) (=> (and (tptp.path V1 V2 P) (forall ((E1 $$unsorted) (E2 $$unsorted)) (=> (and (tptp.on_path E1 P) (tptp.on_path E2 P) (tptp.sequential E1 E2)) (exists ((E3 $$unsorted)) (tptp.triangle E1 E2 E3))))) (= (tptp.number_of_in tptp.sequential_pairs P) (tptp.number_of_in tptp.triangles P)))) (forall ((Things $$unsorted) (InThese $$unsorted)) (tptp.less_or_equal (tptp.number_of_in Things InThese) (tptp.number_of_in Things tptp.graph))) _let_1 true))))))))))))))))))))))))))))
% 0.21/0.56  )
% 0.21/0.56  % SZS output end Proof for GRA005+1
% 0.21/0.56  % cvc5---1.0.5 exiting
% 0.21/0.56  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------