%------------------------------------------------------------------------------ % File : Zenon---0.7.1 % Problem : CSR147+1 : TPTP v8.1.0. Released v4.1.0. % Transfm : none % Format : tptp:raw % Command : run_zenon %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 : 600s % DateTime : Sat Jul 16 00:03:41 EDT 2022 % Result : Theorem 0.88s 1.04s % Output : Proof 0.88s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.11 % Problem : CSR147+1 : TPTP v8.1.0. Released v4.1.0. % 0.10/0.11 % Command : run_zenon %s %d % 0.11/0.31 % Computer : n026.cluster.edu % 0.11/0.31 % Model : x86_64 x86_64 % 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.31 % Memory : 8042.1875MB % 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.31 % CPULimit : 300 % 0.11/0.31 % WCLimit : 600 % 0.11/0.31 % DateTime : Fri Jun 10 07:13:03 EDT 2022 % 0.17/0.31 % CPUTime : % 0.88/1.04 (* PROOF-FOUND *) % 0.88/1.04 % SZS status Theorem % 0.88/1.04 (* BEGIN-PROOF *) % 0.88/1.04 % SZS output start Proof % 0.88/1.04 Theorem jim_is_experienced : (s__more_experienced (jim) (geoff)). % 0.88/1.04 Proof. % 0.88/1.04 assert (zenon_L1_ : (~((n48) = (n48))) -> False). % 0.88/1.04 do 0 intro. intros zenon_He. % 0.88/1.04 apply zenon_He. apply refl_equal. % 0.88/1.04 (* end of lemma zenon_L1_ *) % 0.88/1.04 assert (zenon_L2_ : (~((jim) = (jim))) -> False). % 0.88/1.04 do 0 intro. intros zenon_Hf. % 0.88/1.04 apply zenon_Hf. apply refl_equal. % 0.88/1.04 (* end of lemma zenon_L2_ *) % 0.88/1.04 assert (zenon_L3_ : (~((s__siblingFn (jim)) = (geoff))) -> False). % 0.88/1.04 do 0 intro. intros zenon_H10. % 0.88/1.04 apply (zenon_congruence_lr_s _ (fun zenon_Vh : _ => (~((s__siblingFn (jim)) = zenon_Vh))) _ _ zenon_H10 geoff_and_jim). zenon_intro zenon_H11. % 0.88/1.04 apply zenon_H11. apply refl_equal. % 0.88/1.04 (* end of lemma zenon_L3_ *) % 0.88/1.04 assert (zenon_L4_ : (s__has_seen_more (s__siblingFn (jim)) (jim)) -> False). % 0.88/1.04 do 0 intro. intros zenon_H12. % 0.88/1.04 cut ((s__has_seen_more (s__siblingFn (jim)) (jim)) = (s__has_seen_more (geoff) (jim))). % 0.88/1.04 intro zenon_D_pnotp. % 0.88/1.04 apply jim_has_seen_more. % 0.88/1.04 rewrite <- zenon_D_pnotp. % 0.88/1.04 exact zenon_H12. % 0.88/1.04 cut (((jim) = (jim))); [idtac | apply NNPP; zenon_intro zenon_Hf]. % 0.88/1.04 cut (((s__siblingFn (jim)) = (geoff))); [idtac | apply NNPP; zenon_intro zenon_H10]. % 0.88/1.04 congruence. % 0.88/1.04 apply (zenon_L3_); trivial. % 0.88/1.04 apply zenon_Hf. apply refl_equal. % 0.88/1.04 (* end of lemma zenon_L4_ *) % 0.88/1.04 apply NNPP. intro zenon_G. % 0.88/1.04 generalize (experience (jim)). zenon_intro zenon_H13. % 0.88/1.04 generalize (zenon_H13 (n54)). zenon_intro zenon_H14. % 0.88/1.04 generalize (zenon_H14 (n48)). zenon_intro zenon_H15. % 0.88/1.04 apply (zenon_imply_s _ _ zenon_H15); [ zenon_intro zenon_H17 | zenon_intro zenon_H16 ]. % 0.88/1.04 exact (zenon_H17 jim_human). % 0.88/1.04 apply (zenon_imply_s _ _ zenon_H16); [ zenon_intro zenon_H19 | zenon_intro zenon_H18 ]. % 0.88/1.04 apply (zenon_notand_s _ _ zenon_H19); [ zenon_intro zenon_H1b | zenon_intro zenon_H1a ]. % 0.88/1.04 exact (zenon_H1b jim_54). % 0.88/1.04 apply (zenon_notand_s _ _ zenon_H1a); [ zenon_intro zenon_H1d | zenon_intro zenon_H1c ]. % 0.88/1.04 cut ((s__age (geoff) (n48)) = (s__age (s__siblingFn (jim)) (n48))). % 0.88/1.04 intro zenon_D_pnotp. % 0.88/1.04 apply zenon_H1d. % 0.88/1.04 rewrite <- zenon_D_pnotp. % 0.88/1.04 exact geoff_48. % 0.88/1.04 cut (((n48) = (n48))); [idtac | apply NNPP; zenon_intro zenon_He]. % 0.88/1.04 cut (((geoff) = (s__siblingFn (jim)))); [idtac | apply NNPP; zenon_intro zenon_H1e]. % 0.88/1.04 congruence. % 0.88/1.04 exact (zenon_H1e geoff_and_jim). % 0.88/1.04 apply zenon_He. apply refl_equal. % 0.88/1.04 exact (zenon_H1c greater_54_48). % 0.88/1.04 apply (zenon_or_s _ _ zenon_H18); [ zenon_intro zenon_H1f | zenon_intro zenon_H12 ]. % 0.88/1.04 cut ((s__more_experienced (jim) (s__siblingFn (jim))) = (s__more_experienced (jim) (geoff))). % 0.88/1.04 intro zenon_D_pnotp. % 0.88/1.04 apply zenon_G. % 0.88/1.04 rewrite <- zenon_D_pnotp. % 0.88/1.04 exact zenon_H1f. % 0.88/1.04 cut (((s__siblingFn (jim)) = (geoff))); [idtac | apply NNPP; zenon_intro zenon_H10]. % 0.88/1.04 cut (((jim) = (jim))); [idtac | apply NNPP; zenon_intro zenon_Hf]. % 0.88/1.04 congruence. % 0.88/1.04 apply zenon_Hf. apply refl_equal. % 0.88/1.04 apply (zenon_L3_); trivial. % 0.88/1.04 apply (zenon_L4_); trivial. % 0.88/1.04 Qed. % 0.88/1.04 % SZS output end Proof % 0.88/1.04 (* END-PROOF *) % 0.88/1.04 nodes searched: 8160 % 0.88/1.04 max branch formulas: 703 % 0.88/1.04 proof nodes created: 28 % 0.88/1.04 formulas created: 6167 % 0.88/1.04 %------------------------------------------------------------------------------