0.00/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.11 % Command : do_cvc5 %s %d 0.10/0.31 % Computer : n009.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 : 960 0.10/0.31 % WCLimit : 120 0.10/0.31 % DateTime : Tue Aug 9 02:57:20 EDT 2022 0.10/0.31 % CPUTime : 0.16/0.42 %----Proving TF0_NAR, FOF, or CNF 0.16/0.46 ------- cvc5-fof casc J11 : /export/starexec/sandbox2/benchmark/theBenchmark.p at /export/starexec/sandbox2/benchmark/theBenchmark.p... 0.16/0.46 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10... 0.16/0.46 % SZS status Theorem for theBenchmark 0.16/0.46 % SZS output start Proof for theBenchmark 0.16/0.46 (let ((_let_1 (isa wec thm))) (let ((_let_2 (not _let_1))) (let ((_let_3 (forall ((S1 $$unsorted) (S2 $$unsorted)) (= (forall ((Ax $$unsorted) (C $$unsorted)) (=> (status Ax C S1) (status Ax C S2))) (isa S1 S2))))) (let ((_let_4 (forall ((Ax $$unsorted) (C $$unsorted)) (= (status Ax C thm) (forall ((I1 $$unsorted)) (=> (model I1 Ax) (model I1 C))))))) (let ((_let_5 (forall ((Ax $$unsorted) (C $$unsorted)) (= (and (exists ((I1 $$unsorted)) (model I1 Ax)) (exists ((I3 $$unsorted)) (and (not (model I3 Ax)) (model I3 C))) (forall ((I2 $$unsorted)) (=> (model I2 Ax) (model I2 C)))) (status Ax C wec))))) (let ((_let_6 (forall ((I1 $$unsorted)) (or (not (model I1 skv_21)) (model I1 skv_22))))) (let ((_let_7 (forall ((I2 $$unsorted)) (or (not (model I2 skv_21)) (model I2 skv_22))))) (let ((_let_8 (status skv_21 skv_22 thm))) (let ((_let_9 (= _let_8 _let_6))) (let ((_let_10 (not _let_6))) (let ((_let_11 (forall ((Ax $$unsorted) (C $$unsorted)) (= (status Ax C thm) (forall ((I1 $$unsorted)) (or (not (model I1 Ax)) (model I1 C))))))) (let ((_let_12 (EQ_RESOLVE (ASSUME :args (_let_4)) (MACRO_SR_EQ_INTRO :args (_let_4 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_13 (status skv_21 skv_22 wec))) (let ((_let_14 (not _let_13))) (let ((_let_15 (or _let_14 _let_8))) (let ((_let_16 (forall ((Ax $$unsorted) (C $$unsorted)) (or (not (status Ax C wec)) (status Ax C thm))))) (let ((_let_17 (not _let_15))) (let ((_let_18 (= _let_1 _let_16))) (let ((_let_19 (not _let_16))) (let ((_let_20 (forall ((S1 $$unsorted) (S2 $$unsorted)) (= (isa S1 S2) (forall ((Ax $$unsorted) (C $$unsorted)) (or (not (status Ax C S1)) (status Ax C S2))))))) (let ((_let_21 (EQ_RESOLVE (ASSUME :args (_let_3)) (MACRO_SR_EQ_INTRO :args (_let_3 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_22 (OR))) (let ((_let_23 (_let_19))) (let ((_let_24 (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE (ASSUME :args _let_23)) :args _let_23)) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_19) _let_16))) (REFL :args (_let_17)) :args _let_22)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS2 :args (_let_18)) :args ((or _let_1 _let_19 (not _let_18)))) (ASSUME :args (_let_2)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_21 :args (wec thm QUANTIFIERS_INST_E_MATCHING_SIMPLE ((isa S1 S2)))) :args (_let_20))) _let_21 :args (_let_18 false _let_20)) :args (_let_19 true _let_1 false _let_18)) :args (_let_17 true _let_16)))) (let ((_let_25 (and (not (forall ((I1 $$unsorted)) (not (model I1 skv_21)))) (not (forall ((I3 $$unsorted)) (or (model I3 skv_21) (not (model I3 skv_22))))) _let_7))) (let ((_let_26 (= _let_13 _let_25))) (let ((_let_27 (forall ((Ax $$unsorted) (C $$unsorted)) (= (status Ax C wec) (and (not (forall ((I1 $$unsorted)) (not (model I1 Ax)))) (not (forall ((I3 $$unsorted)) (or (model I3 Ax) (not (model I3 C))))) (forall ((I2 $$unsorted)) (or (not (model I2 Ax)) (model I2 C)))))))) (let ((_let_28 (EQ_RESOLVE (ASSUME :args (_let_5)) (MACRO_SR_EQ_INTRO :args (_let_5 SB_DEFAULT SBA_FIXPOINT))))) (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (EQUIV_ELIM1 (ALPHA_EQUIV :args (_let_7 (= I2 I1)))) :args ((or _let_6 (not _let_7)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_AND_POS :args (_let_25 2)) :args ((or _let_7 (not _let_25)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS1 :args (_let_26)) :args ((or _let_14 _let_25 (not _let_26)))) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_15 0)) (CONG (REFL :args (_let_15)) (MACRO_SR_PRED_INTRO :args ((= (not _let_14) _let_13))) :args _let_22)) :args ((or _let_13 _let_15))) _let_24 :args (_let_13 true _let_15)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_28 :args (skv_21 skv_22 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((status Ax C wec)))) :args (_let_27))) _let_28 :args (_let_26 false _let_27)) :args (_let_25 false _let_13 false _let_26)) :args (_let_7 false _let_25)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS2 :args (_let_9)) :args ((or _let_8 _let_10 (not _let_9)))) (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_15 1)) _let_24 :args ((not _let_8) true _let_15)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_12 :args (skv_21 skv_22 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((status Ax C thm)))) :args (_let_11))) _let_12 :args (_let_9 false _let_11)) :args (_let_10 true _let_8 false _let_9)) :args (false false _let_7 true _let_6)) :args ((forall ((Ax $$unsorted) (C $$unsorted)) (= (= (exists ((I2 $$unsorted)) (model I2 C)) (exists ((I1 $$unsorted)) (model I1 Ax))) (status Ax C esa))) (forall ((Ax $$unsorted) (C $$unsorted)) (= (and (not (exists ((I1 $$unsorted)) (model I1 Ax))) (forall ((I2 $$unsorted)) (model I2 C))) (status Ax C tca))) _let_5 (forall ((Ax $$unsorted) (C $$unsorted)) (= (and (exists ((I1 $$unsorted)) (model I1 Ax)) (exists ((I2 $$unsorted)) (not (model I2 Ax))) (forall ((I3 $$unsorted)) (model I3 C))) (status Ax C wtc))) (forall ((Ax $$unsorted) (C $$unsorted)) (= (status Ax C eqv) (and (exists ((I1 $$unsorted)) (model I1 Ax)) (forall ((I2 $$unsorted)) (= (model I2 Ax) (model I2 C)))))) (forall ((Ax $$unsorted) (C $$unsorted)) (= (status Ax C cax) (not (exists ((I1 $$unsorted)) (model I1 Ax))))) (forall ((Ax $$unsorted) (C $$unsorted)) (= (and (exists ((I1 $$unsorted)) (model I1 Ax)) (forall ((I2 $$unsorted)) (=> (model I2 Ax) (model I2 C))) (exists ((I3 $$unsorted)) (and (model I3 C) (not (model I3 Ax)))) (exists ((I4 $$unsorted)) (not (model I4 C)))) (status Ax C wth))) (forall ((Ax $$unsorted) (C $$unsorted)) (= (=> (not (exists ((I1 $$unsorted)) (model I1 Ax))) (not (exists ((I2 $$unsorted)) (model I2 C)))) (status Ax C unp))) _let_4 (forall ((Ax $$unsorted) (C $$unsorted)) (= (status Ax C csa) (exists ((I1 $$unsorted)) (and (model I1 (not C)) (model I1 Ax))))) (forall ((Ax $$unsorted) (C $$unsorted)) (= (and (exists ((I1 $$unsorted)) (model I1 Ax)) (exists ((I2 $$unsorted)) (not (model I2 Ax))) (forall ((I3 $$unsorted)) (= (model I3 C) (model I3 Ax)))) (status Ax C eth))) (forall ((Ax $$unsorted) (C $$unsorted)) (= (and (exists ((I2 $$unsorted)) (model I2 C)) (exists ((I3 $$unsorted)) (not (model I3 C))) (not (exists ((I1 $$unsorted)) (model I1 Ax)))) (status Ax C wca))) (forall ((Ax $$unsorted) (C $$unsorted)) (= (and (exists ((I2 $$unsorted)) (and (model I2 Ax) (model I2 (not C)))) (exists ((I1 $$unsorted)) (and (model I1 C) (model I1 Ax)))) (status Ax C noc))) (forall ((Ax $$unsorted) (C $$unsorted)) (= (status Ax C tau) (forall ((I1 $$unsorted)) (and (model I1 Ax) (model I1 C))))) (forall ((Ax $$unsorted) (C $$unsorted)) (= (and (forall ((I1 $$unsorted)) (model I1 Ax)) (forall ((I2 $$unsorted)) (model I2 (not C)))) (status Ax C uns))) (forall ((Ax $$unsorted) (C $$unsorted)) (= (=> (exists ((I1 $$unsorted)) (model I1 Ax)) (exists ((I2 $$unsorted)) (model I2 C))) (status Ax C sap))) (forall ((Ax $$unsorted) (C $$unsorted)) (= (status Ax C sat) (exists ((I1 $$unsorted)) (and (model I1 C) (model I1 Ax))))) (forall ((Ax $$unsorted) (C $$unsorted)) (= (status Ax C tac) (and (exists ((I1 $$unsorted)) (model I1 Ax)) (forall ((I2 $$unsorted)) (model I2 C))))) (forall ((Ax $$unsorted) (C $$unsorted)) (= (status Ax C sca) (and (exists ((I2 $$unsorted)) (model I2 C)) (not (exists ((I1 $$unsorted)) (model I1 Ax)))))) (exists ((I1 $$unsorted) (Ax $$unsorted) (C $$unsorted)) (and (not (model I1 C)) (exists ((I2 $$unsorted)) (model I2 C)) (model I1 Ax))) (exists ((Ax $$unsorted) (C $$unsorted)) (and (exists ((I2 $$unsorted)) (or (not (model I2 C)) (not (model I2 Ax)))) (exists ((I1 $$unsorted)) (and (model I1 C) (model I1 Ax))))) (exists ((Ax $$unsorted) (C $$unsorted)) (and (exists ((I1 $$unsorted)) (model I1 Ax)) (exists ((I4 $$unsorted)) (not (model I4 C))) (exists ((I3 $$unsorted)) (and (model I3 C) (not (model I3 Ax)))) (forall ((I2 $$unsorted)) (=> (model I2 Ax) (model I2 C))))) (forall ((I $$unsorted) (F $$unsorted)) (xor (model I (not F)) (model I F))) (forall ((S1 $$unsorted) (S2 $$unsorted)) (= (xora S1 S2) (forall ((Ax $$unsorted) (C $$unsorted)) (xor (status Ax C S1) (status Ax C S2))))) _let_3 (forall ((I $$unsorted) (F $$unsorted)) (= (model I F) (not (model I (not F))))) (forall ((S1 $$unsorted) (S2 $$unsorted)) (= (nevera S1 S2) (forall ((Ax $$unsorted) (C $$unsorted)) (=> (status Ax C S1) (not (status Ax C S2)))))) (forall ((S1 $$unsorted) (S2 $$unsorted)) (= (nota S1 S2) (exists ((Ax $$unsorted) (C $$unsorted)) (and (not (status Ax C S2)) (status Ax C S1))))) (forall ((S1 $$unsorted) (S2 $$unsorted)) (= (exists ((Ax $$unsorted) (C $$unsorted)) (and (status Ax C S1) (status Ax C S2))) (mighta S1 S2))) (exists ((F $$unsorted)) (forall ((I $$unsorted)) (not (model I F)))) (exists ((F $$unsorted)) (forall ((I $$unsorted)) (model I F))) (exists ((F $$unsorted)) (and (exists ((I1 $$unsorted)) (model I1 F)) (exists ((I2 $$unsorted)) (not (model I2 F))))) _let_2 true)))))))))))))))))))))))))))))) 0.16/0.46 % SZS output end Proof for theBenchmark 0.16/0.47 EOF